Michel Couprie

ORCID: 0000-0003-1728-636X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • 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...

10.1109/tpami.2008.173 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 2009-03-09

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...

10.1109/tip.2006.877518 article EN IEEE Transactions on Image Processing 2006-10-18

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....

10.1109/tpami.2009.71 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 2009-04-18

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.

10.1117/12.292778 article EN Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 1997-10-20

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...

10.1109/tpami.2008.117 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 2009-02-19

10.1007/s10851-005-4892-4 article EN Journal of Mathematical Imaging and Vision 2005-04-14

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...

10.1164/rccm.2111070 article EN American Journal of Respiratory and Critical Care Medicine 2002-10-29

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.

10.1117/1.1408316 article EN Journal of Electronic Imaging 2001-01-01

10.1016/j.dam.2004.09.017 article EN publisher-specific-oa Discrete Applied Mathematics 2004-12-28

10.1007/s10851-007-0063-0 article EN Journal of Mathematical Imaging and Vision 2008-01-28

10.1016/j.patcog.2010.04.015 article EN Pattern Recognition 2010-04-29

10.1007/s10851-011-0308-9 article EN Journal of Mathematical Imaging and Vision 2011-07-28

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...

10.1109/pdis.1991.183107 article EN 2002-12-10

10.1007/s10851-012-0402-7 article EN Journal of Mathematical Imaging and Vision 2012-11-17
Coming Soon ...