Abstract
Watersheds are the latest segmentation tool developed in mathematical morphology. These algorithms produce a segmentation of an image into a set of basins separated by watershed pixels. The over segmentation produced by these algorithms is reduced by removing all contours with a low saliency. This contour’s saliency is generally defined from the minimal height of the watershed pixels along the contour. However, such a definition does not allow to define a contour’s saliency in case of thick watersheds. Moreover, the set of basins which corresponds to the intuitive notion of regions does not define an image partition. In this paper we propose a method which allows to aggregate the watershed pixels to the basins while preserving the notion of contour and the associated saliency. The model used to encode the image partition is then decimated according to the contour saliency to obtain a hierarchy of partitions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Brice, R., Fennema, C.: Scene analysis using regions. Artificial intelligence 1, 205–226 (1970)
Brun, L., Kropatsch, W.: Combinatorial pyramids. In: Suvisoft (ed.) IEEE International conference on Image Processing (ICIP), Barcelona, September 2003, vol. II, pp. 33–37. IEEE, Los Alamitos (2003)
Domenger, J.P.: Conception et implémentation du noyau graphique d’un environnement 2D1/2 d’édition d’images discrè tes. PhD thesis, Labri Université Bordeaux I, 351 cours de la libération 33405 Talence, avril (1992)
Françon, J.: Topologie de Khalimsky et Kovalevsky et algorithmes graphiques. In: DGCI 1991, Strasbourg (September 1991)
Khalimsky, E., Kopperman, R., Meyer, P.: Boundaries in digital planes. Journal of applied Math. and Stocastic Analysis 3, 27–55 (1990)
Kropatsch, W.G., Macho, H.: Finding the structure of connected components using dual irregular pyramids. In: Cinquième Colloque DGCI, LLAIC1, Université d’Auvergne pp.147–158 (September 1995) ISBN 2-87663-040-0
Marchadier, J., Arquès, D., Michelin, S.: Thinning grayscale well-composed images. Pattern Recognition Letters 25, 581–590 (2004)
Najman, L., Couprie, M.: Watershed algorithms and contrast preservation. In: Nyström, I., Sanniti di Baja, G., Svensson, S. (eds.) DGCI 2003. LNCS, vol. 2886, pp. 62–71. Springer, Heidelberg (2003)
Rosenfeld, A.: Digital topology. Amer. math. monthly 86, 621–630 (1979)
Vincent, L., Soille, P.: Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEETPAMI 13(6), 583–598 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brun, L., Vautrot, P., Meyer, F. (2004). Hierarchical Watersheds with Inter-pixel Boundaries. In: Campilho, A., Kamel, M. (eds) Image Analysis and Recognition. ICIAR 2004. Lecture Notes in Computer Science, vol 3211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30125-7_104
Download citation
DOI: https://doi.org/10.1007/978-3-540-30125-7_104
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23223-0
Online ISBN: 978-3-540-30125-7
eBook Packages: Springer Book Archive