Abstract
Segmentation is a classical problem in image processing that has been an active research topic for more than three decades. Classical tools provided by mathematical morphology for segmenting images are the connected set operators and the watershed transformation. Both of these operations can be applied to form hierarchies of nested partitions at increasing scales. This paper studies two image partition hierarchies founded in mathematical morphology, namely the max/min tree and the watershed lake tree. By considering watershed and max/min tree image descriptions we show that a watershed lake tree comprises a subset of min tree vertices.
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.
References
Bangham, J.A., Hidalgo, J.R., Harvey, R., Cawley, G.: The segmentation of images via scale-space trees. In: 9th BMVC, pp. 33–43 (1998)
Beucher,S., Lantuéjoul, C.: Use of watershed in contour detection. In: Proc. Int’l Workshop Image Processing, Real-Time Edge and Motion Detection/Estimation, Rennes, France (1979)
Breen, E.J., Jones, R.: Attribute openings, thinnings, and granulometries. Computer Vision and Image Understanding 64(3), 377–389 (1996)
Cheng, F., Venetsanopoulos, A.N.: An adaptive morphological filter for image processing. IEEE Transactions on Image Processing 1(4), 533–539 (1992)
Cichosz, J., Meyer, F.: Morphological multiscale image segmentation. In: WIAMIS 1997, pp. 161–166 (1997)
Crespo, J., Serra, J., Schafer, R.W.: Theoretical aspects of morphological filters by reconstruction. Signal Processing 47(2), 201–225 (1995)
Fisher, M., Aldrige, R.: Hierarchical segmentation of images using a watershed scale-space trees. In: IEEE Int. Conf. Image Processing and its Applications, pp. 522–526 (1999)
Grimaud, M.: A new measure of contrast: the dynamics. In: Proceedings of SPIE Conference on Image Algebra and Morphological Image Processing, vol. 1769, pp. 292–304 (1992)
Heijmans, H.J.A.M.: Connected morphological operators for binary images. Computer Vision and Image Understanding: CVIU 73(1), 99–120 (1999)
Huang, X., Fisher, M., Smith, D.: An efficient implementation of max tree with linked list and hash table. In: Proceedings of International Conference on Digital Image Computing-Techniques and Applications, Macquarie University, Sydney, Australia, pp. 299–308, (December 2003)
Jones, R.: Connected filtering and segmentation using component trees. Computer Vision and Image Understanding 75(3), 215–228 (1999)
Matheron, G.: Random Sets and Integral Geometry. John Wiley and Sons, New York (1975)
Meijster, A., Wilkinson, M.: A comparison of algorithms for connected set openings and closings. IEEE PAMI 24(4), 484–494 (2002)
Meyer, F., Beucher, S.: Morphological segmentation. J. Visual Communication and Image Representation 1, 21–46 (1990)
Najman, L., Schmitt, M.: Geodesic saliency of watershed contours and hierarchical segmentation. IEEE PAMI 18(12), 1163–1173 (1996)
Ostermann, L.G.: Hierarchical Region Based Processing of Image and Video Sequences: Application to Filtering, Segmentation and Information Retrieval. PhD thesis, Department of Signal Theory and Communications, Universitat Politecnica de Catalunya, Barcelona, Spain (April 2002)
Salembier, P., Garrido, L.: Binary partition tree as an efficent representation for image processing, segmentation, and information retrieval. IEEE Transactions on Image Processing 9(4), 561–576 (2000)
Salembier, P., Oliveras, A., Garrido, L.: Anti-extensive connected operators for image and sequence processing. IEEE Transactions on Image Processing 7(4), 555–570 (1998)
Salembier, P., Serra, J.: Flat zones filtering, connected operators and filters by reconstruction. IEEE Transactions on Image Processing 3(8), 1153–1160 (1995)
Serra, J.: Image Analysis and Mathematical Morphology, vol. I. Academic Press, London (1982)
Serra, J.: Image Analysis and Mathematical Morphology: Theorectical Advances, vol. II. Academic Press, London (1988)
Serra, J., Salembier, P.: Connected operators and pyramids. In: Proceedings of SPIE Conference on Image Algebra and Mathematical Morphology, vol. 2030, pp. 65–76 (1993)
Vincent, L.: Grayscale area openings and closings: Their efficent implementation and applications. In: WMMASP 1993, pp. 22–27 (1993)
Vincent, L.: Fast grayscale granulometry algorithms. In: SMMAI 1994, pp. 265–272 (1994)
Vincent, L., Soille, P.: Watersheds in digital spaces: An efficient algorithm based on immersion simulations. IEEE PAMI 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
Huang, X., Fisher, M., Zhu, Y. (2004). From Min Tree to Watershed Lake Tree: Theory and Implementation. 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_105
Download citation
DOI: https://doi.org/10.1007/978-3-540-30125-7_105
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23223-0
Online ISBN: 978-3-540-30125-7
eBook Packages: Springer Book Archive