- Digital Image Processing Techniques
- Medical Image Segmentation Techniques
- Topological and Geometric Data Analysis
- Computational Geometry and Mesh Generation
- Image Retrieval and Classification Techniques
- Computer Graphics and Visualization Techniques
- Image and Object Detection Techniques
- Advanced Numerical Analysis Techniques
- Advanced Vision and Imaging
- 3D Shape Modeling and Analysis
- Advanced Database Systems and Queries
- Distributed systems and fault tolerance
- Video Analysis and Summarization
- Historical Geography and Cartography
- Computability, Logic, AI Algorithms
- Medical Imaging Techniques and Applications
- Historical Art and Culture Studies
- Cell Image Analysis Techniques
- Automated Road and Building Extraction
- Data Management and Algorithms
- Advanced Image and Video Retrieval Techniques
- Advanced Data Storage Technologies
- Distributed and Parallel Computing Systems
- Human Motion and Animation
- Robotics and Sensor-Based Localization
UniLaSalle Amiens (ESIEE-Amiens)
2009-2020
Centre National de la Recherche Scientifique
2004-2020
Université Gustave Eiffel
2010-2020
ESIEE Paris
1988-2020
Laboratoire d'Informatique Gaspard-Monge
2010-2020
ESIEA University
2004-2019
Paris-Est Sup
2011-2017
Université Paris Cité
2008-2015
Délégation Paris 5
2008-2013
Laboratoire d’Informatique et Systèmes
2010
We study the watersheds in edge-weighted graphs. define watershed cuts following intuitive idea of drops water flowing on a topographic surface. first establish consistency these watersheds: they can be equivalently defined by their "catchment basinsrdquo (through steepest descent property) or "dividing linesrdquo separating catchment basins drop principle). Then, we prove, through an equivalence theorem, optimality terms minimum spanning forests. Afterward, introduce linear-time algorithm...
The level sets of a map are the points with above given threshold. connected components sets, thanks to inclusion relation, can be organized in tree structure, that is called component tree. This tree, under several variations, has been used numerous applications. Various algorithms have proposed literature for computing fastest ones (considering worst-case complexity) proven run O(n ln(n)). In this paper, we propose simple implement quasi-linear algorithm on symmetric graphs, based Tarjan's...
We recently introduced watershed cuts, a notion of in edge-weighted graphs. In this paper, our main contribution is thinning paradigm from which we derive three algorithmic cut strategies: The first one well suited to parallel implementations, the second leads flexible linear-time sequential implementation, whereas third links cuts and popular flooding algorithms. state that preserve contrast, called connection value, on several morphological region merging methods are (implicitly) based....
We propose an original approach to the watershed problem, based on topology. introduce a 1D topology for grayscale images, and more generally weighted graphs. This allows us precisely define topological transformation that generalizes action of transformation. Furthermore, we efficient algorithm compute this transformation,a nd give example application image segmentation.
A point of a discrete object is called simple if it can be deleted from this without altering topology. In article, we present new characterizations points which hold in dimensions 2, 3 and 4, lead to efficient algorithms for detecting such points. order prove these characterizations, establish two confluence properties the collapse operation neighborhood spaces low dimension. This work settled framework cubical complexes, provides sound topological basis image analysis, allows retrieve main...
The diagnosis of primary ciliary dyskinesia is based on demonstration defects, mainly concerning dynein arms. Whereas the absence outer arms can be easily distinguished, inner difficult to confirm because their low contrast electron microscopy. Ciliary ultrastructure was studied in 40 patients suffering from respiratory tract infections. Conventional transmission microscopy showed normal cilia 6 patients, confirmed a 26 and inconclusive 8 patients. All doubtful cases were related arm...
The <i>Journal of Electronic Imaging</i> (JEI), copublished bimonthly with the Society for Imaging Science and Technology, publishes peer-reviewed papers that cover research applications in all areas electronic imaging science technology.
DBS3 is a database system with extended relational capabilities designed for shared-memory multiprocessor. This paper presents the design choices, architecture and performance evaluation of current prototype. The major contributions are: parallel dataflow execution model based on data declustering, compile-time optimization both independent pipelined parallelism, exploitation efficient concurrent execution. prototype runs shared-memory, commercially available initial experiments single-user...