Watersheds, mosaics, and the emergence paradigm

Discrete Applied Mathematics

Volumn 147, Issue 2-3, 2005, Pages 301-324

  Najman, Laurent ^a,b   Couprie, Michel ^a,b   Bertrand, Gilles ^a,b  

^a Groupe ESIEE   (France)

^b ESIEE PARIS   (France)

Author keywords

Flooding; Mathematical morphology; Mosaic; Topological watershed; Topology; Watersheds

Indexed keywords

FLOODING; MOSAICS; TOPOLOGICAL WATERSHEDS; WATERSHED ALGORITHMS;

ALGORITHMS; COMPUTER SIMULATION; FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; SET THEORY; TOPOLOGY; WATERSHEDS;

IMAGE PROCESSING;

EID: 14844311995     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.09.017     Document Type: Conference Paper

References (36)

1. G. Bertrand, Some properties of topological greyscale watersheds, in: L.J. Latecki, D.M. Mount, A.Y. Wu (Eds.), Vision Geometry XII. Number 5300 in IS&T/SPIE Symposium on Electronic Imaging, San-Jose, CA, USA, SPIE, 2004, pp. 127-137.
2. G. Bertrand, J. Everat, and M. Couprie Image segmentation through operators based upon topology J. Electronic Imaging 6 1997 395 405
3. S. Beucher, Segmentation d'images et morphologie mathématique, Ph.D. Thesis, École des Mines de Paris, France, 1990.
4. S. Beucher, C. Lantuéjoul, Use of watersheds in contour detection, in: Proceedings of International Workshop on Image Processing, Real-Time Edge and Motion Detection/Estimation, Rennes, France, 1979.
5. S. Beucher, and F. Meyer The morphological approach to segmentation the watershed transformation E. Dougherty Mathematical Morphology in Image Processing 1993 Marcel Decker 433 481
6. S. Beucher, Watershed, hierarchical segmentation and waterfall algorithm, in: J. Serra, P. Soille (Eds.), Proceedings of Mathematical Morphology and its Applications to Image Processing, Fontainebleau, France, Kluwer, 1994, pp. 69-76.
7. M. Couprie, G. Bertrand, Topological grayscale watershed transform, in: SPIE Vision Geometry V Proceedings, vol. 3168, 1997, pp. 136-146.
8. M. Couprie, G. Bertrand, Tesselations by connection in orders, in: Discrete geometry for computer imagery, Lecture Notes in Computer Science, vol. 1953, Springer, Berlin, 2000, pp. 15-26.
9. M. Couprie, F.N. Bezerra, and G. Bertrand Topological operators for grayscale image processing J. Electronic Imaging 10 2001 1003 1015
10. M. Couprie, L. Najman, G. Bertrand, Quasi-linear algorithms for topological watershed, Journal of Mathematical Imaging and Vision (2005), Special issue on Mathematical Morphology, to appear.
11. H. Digabel, and C. Lantuéjoul Iterative algorithms J.L. Chermant Second European Symposium on Qualitative Analysis of Microstructures in Material Science, Biology and Medicine 1978 Stuttgart FRG Riederer Verlag 85 99
12. E. Dougherty, and R. Lotufo Hands-on Morphological Image Processing 2003 SPIE Press
13. V. Goetcherian From binary to grey tone image processing using fuzzy logic concepts Pattern Recognition 12 1980 7 15
14. H. Heijmans Morphological Image Operators 1994 Academic Press New York
15. C. Jordan Nouvelles observations sur les lignes de faîtes et de thalweg Comptes Rendus des Séances de l'Académie des Sciences 75 1872 1023 1025
16. R.A. Lotufo, A.X. Falcao, F.A. Zampirolli, Ift-watershed from gray-scale marker, in: SIBGRAPI'02, Fortaleza-CE, Brazil, 2002, pp. 146-152.
17. J. Maxwell On hills and dales Philosophical Magazine 4/40 1870 421 427
18. F. Meyer, Un algorithme optimal de ligne de partage des eaux, in: Actes du 8ème Congrès AFCET, Lyon-Villeurbanne, France, 1991, pp. 847-859.
19. F. Meyer Topographic distance and watershed lines Signal Processing 38 1994 113 126 (special issue on Mathematical Morphology)
20. F. Meyer, and S. Beucher Morphological segmentation Journal of Visual Communication and Image Representation 1 1990 21 46
21. L. Najman, M. Couprie, Watershed algorithms and contrast preservation, in: DGCI'03. Lecture Notes in Computer Sciences, vol. 2886, Springer, Berlin, 2003, pp. 62-71.
22. L. Najman, M. Couprie, Quasi-linear algorithm for the component tree, in: L.J. Latecki, D.M. Mount, A.Y. Wu (Eds.), Vision Geometry XII. Number 5300 in IS&T/SPIE Symposium on Electronic Imaging, San-Jose, CA, USA, SPIE, 2004, pp. 98-107.
23. L. Najman, Morphologie Mathématique: de la Segmentation d'Images à l'Analyse Multivoque, Ph.D. Thesis, Université Paris-Dauphine, 1994.
24. L. Najman, and M. Schmitt Watershed of a continuous function Signal Processing 38 1994 99 112 (special issue on Mathematical Morphology)
25. L. Najman, and M. Schmitt Geodesic saliency of watershed contours and hierarchical segmentation IEEE Trans. on PAMI 18 1996 1163 1173
26. V. Ranwez, and P. Soille Order independent homotopic thinning for binary and grey tone anchored skeletons Pattern Recognition Lett. 23 2002 687 702
27. J. Roerdink, and A. Meijster The watershed transform definitions, algorithms and parallelization strategies Fundamenta Informaticae 41 2000 187 228
28. A. Rosenfeld Fuzzy digital topology Information and Control 40 1979 76 87
29. A. Rosenfeld On connectivity properties of grayscale pictures Pattern Recognition 16 1983 47 50
30. A. Rosenfeld The fuzzy geometry of image subsets Pattern Recognition Lett. 2 1984 311 317
31. P. Soille, Morphologie mathématique: du relief à la dimensionalité-Algorithmes et méthodes, Ph.D. Thesis, Université catholique de Louvain, Partnership with the Paris's School of Mines, 1992.
32. P. Soille Morphological Image Analysis 1999 Springer Berlin
33. P. Soille, and M. Ansoult Automated basin delineation from digital elevation models using mathematical morphology Signal Processing 20 1990 171 182
34. P. Soille, L. Vincent, Determining watersheds in digital pictures via flooding simulations, in: M. Kunt (Ed.), Visual Communications and Image Processing'90, vol. 1360, Bellingham, Society of Photo-Instrumentation Engineers, 1990, pp. 240-250.
35. L. Vincent, Algorithmes morphologiques à base de files d'attente et de lacets, Extension aux graphes (Morphological Algorithms Based on Queues and Loops, with Extension to Graphs), Ph.D. Thesis, School of Mines, Paris, 1990.
36. L. Vincent, and P. Soille Watersheds in digital spaces an efficient algorithm based on immersion simulations IEEE Transactions on PAMI 13 1991 583 598