Abstract
In this paper, we study topological watersheds on perfect fusion graphs, an ideal framework for region merging. An important result is that contrarily to the general case, in this framework, any topological watershed is thin.
Then we investigate a new image transformation called C-watershed and we show that, on perfect fusion graphs, the segmentations obtained by C-watershed correspond to segmentations obtained by topological watersheds. Compared to topological watershed, a major advantage of this transformation is that, on perfect fusion graph, it can be computed thanks to a simple linear-time immersion-like algorithm. Finally, we derive characterizations of perfect fusion graphs based on thinness properties of both topological watersheds and C-watersheds.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pavlidis, T.: Structural Pattern Recognition. Springer Series in Electrophysics, vol. 1, pp. 90–123. Springer, Heidelberg (1977); Segmentation techniques, chapter 4–5
Vincent, L., Soille, P.: Watersheds in digital spaces: An efficient algorithm based on immersion simulations. PAMI 13(6), 583–598 (1991)
Meyer, F.: Un algorithme optimal de ligne de partage des eaux. In: Actes du 8ème Congrès AFCET, Lyon-Villeurbanne, France, pp. 847–859 (1991)
Beucher, S., Meyer, F.: The morphological approach to segmentation: the watershed transformation. In: Dougherty, E. (ed.) Mathematical Morphology in Image Processing, pp. 443–481. Marcel Decker (1993)
Couprie, M., Bertrand, G.: Topological grayscale watershed transform. In: SPIE Vision Geometry V Proceedings, vol. 3168, pp. 136–146 (1997)
Jasiobedzki, P., Taylor, C., Brunt, J.: Automated analysis of retinal images. IVC 1(3), 139–144 (1993)
Cousty, J., Bertrand, G., Couprie, M., Najman, L.: Fusion graphs: merging properties and watershed (submitted, 2006); Also in technical report IGM2005-04, http://igm.univ-mlv.fr/LabInfo/rapportsInternes/2005/04.pdf
Bertrand, G.: On topological watersheds. JMIV 22(2-3), 217–230 (2005)
Couprie, M., Najman, L., Bertrand, G.: Quasi-linear algorithms for the topological watershed. JMIV 22(2-3), 231–249 (2005)
Najman, L., Couprie, M., Bertrand, G.: Watersheds, mosaics and the emergence paradigm. DAM 147(2-3), 301–324 (2005) (Special issue on DGCI)
Beucher, S.: Watershed, hierarchical segmentation and waterfall algorithm. In: Mathematical Morphology and its Applications to Image Processing, pp. 69–76 (1994)
Najman, L., Schmitt, M.: Geodesic saliency of watershed contours and hierarchical segmentation. PAMI 18(12), 1163–1173 (1996)
Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Trans. on Image Processing (to appear, 2006)
Bertrand, G.: A new definition for the dynamics. In: 7th International Symposium on Mathematical Morphology Proceedings, pp. 197–206 (2005)
Rosenfeld, A.: The fuzzy geometry of image subsets. Pattern Recognition Letters 2, 311–317 (1984)
Thorup, M.: On ram priority queues. In: 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 59–67 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cousty, J., Couprie, M., Najman, L., Bertrand, G. (2006). Grayscale Watersheds on Perfect Fusion Graphs. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds) Combinatorial Image Analysis. IWCIA 2006. Lecture Notes in Computer Science, vol 4040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11774938_6
Download citation
DOI: https://doi.org/10.1007/11774938_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35153-5
Online ISBN: 978-3-540-35154-2
eBook Packages: Computer ScienceComputer Science (R0)