Search results for " processing"
showing 10 items of 7549 documents
hidden markov random fields and cuckoo search method for medical image segmentation
2020
Segmentation of medical images is an essential part in the process of diagnostics. Physicians require an automatic, robust and valid results. Hidden Markov Random Fields (HMRF) provide powerful model. This latter models the segmentation problem as the minimization of an energy function. Cuckoo search (CS) algorithm is one of the recent nature-inspired meta-heuristic algorithms. It has shown its efficiency in many engineering optimization problems. In this paper, we use three cuckoo search algorithm to achieve medical image segmentation.
Unsupervised learning of category-specific symmetric 3D keypoints from point sets
2020
Lecture Notes in Computer Science, 12370
3D landmark detection for augmented reality based otologic procedures
2019
International audience; Ear consists of the smallest bones in the human body and does not contain significant amount of distinct landmark points that may be used to register a preoperative CT-scan with the surgical video in an augmented reality framework. Learning based algorithms may be used to help the surgeons to identify landmark points. This paper presents a convolutional neural network approach to landmark detection in preoperative ear CT images and then discusses an augmented reality system that can be used to visualize the cochlear axis on an otologic surgical video.
Enhancing scientific information systems with semantic annotations
2013
International audience; Scientific Information Systems aim to produce or improve knowledge on a subject through activities of research and development. The management of scientific dat a requires some essential properties. We propose SemLab an architecture that sup ports interoperability, data quality and extensibility through a unique paradigm: semantic annotation. We present two app lications that validate our architecture.
Representing and Reasoning for Spatiotemporal Ontology Integration
2004
International audience; The World-Wide Web hosts many autonomous and heterogeneous information sources. In the near future each source may be described by its own ontology. The distributed nature of ontology development will lead to a large number of local ontologies covering overlapping domains. Ontology integration will then become an essential capability for effective interoperability and information sharing. Integration is known to be a hard problem, whose complexity increases particularly in the presence of spatiotemporal information. Space and time entail additional problems such as the heterogeneity of granularity used in representing spatial and temporal features. Spatio-temporal ob…
Improving Video Object Detection by Seq-Bbox Matching
2019
International audience
Event-Based Trajectory Prediction Using Spiking Neural Networks
2021
International audience; In recent years, event-based sensors have been combined with spiking neural networks (SNNs) to create a new generation of bio-inspired artificial vision systems. These systems can process spatio-temporal data in real time, and are highly energy efficient. In this study, we used a new hybrid event-based camera in conjunction with a multi-layer spiking neural network trained with a spike-timing-dependent plasticity learning rule. We showed that neurons learn from repeated and correlated spatio-temporal patterns in an unsupervised way and become selective to motion features, such as direction and speed. This motion selectivity can then be used to predict ball trajectory…
Some Computational Aspects of DISTANCE-SAT
2007
In many AI fields, one must face the problem of finding a solution that is as close as possible to a given configuration. This paper addresses this problem in a propositional framework. We introduce the decision problem distance-sat, which consists in determining whether a propositional formula admits a model that disagrees with a given partial interpretation on at most d variables. The complexity of distance-sat and of several restrictions of it are identified. Two algorithms based on the well-known Davis/Logemann/Loveland search procedure for the satisfiability problem sat are presented so as to solve distance-sat for CNF formulas. Their computational behaviors are compared with the ones …
How to Enrich Description Logics with Fuzziness
2017
International audience; The paper describes the relation between fuzzy and non-fuzzy description logics. It gives an overview about current research in these areas and describes the difference between tasks for description logics and fuzzy logics. The paper also deals with the transformation properties of description logics to fuzzy logics and backwards. While the process of transformation from a description logic to a fuzzy logic is a trivial inclusion, the other way of reducing information from fuzzy logic to description logic is a difficult task, that will be topic of future work.
Propagation d'informations le long d'une ligne de transmission non linéaire structurée en super réseau et simulant un neurone myélinisé
2019
Non-linear systems are almostly described by partial differential equations that characterize them. We have some systems such as the chain of coupled pebdelums, the protein chain comprising molecules with hydrogen bonds, atomic lattice, and so on .These systems are most often characterized by anharmonic inter particulate interactions and and then immersed in deformable potential substrates. In addition to nonlinearity and dispersion, these other phenomena namely anharmonicity and deformability are responsible for certain properties of propagation of solitary waves such as (compactons, kinks and anti-kinks, peackons, ...etc) and also the ability of the systems to transmit a signal . We used …