Geodesic saliency of watershed contours and hierarchical segmentation
- 1 December 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 18 (12) , 1163-1173
- https://doi.org/10.1109/34.546254
Abstract
The watershed is one of the latest segmentation tools developed in mathematical morphology. In order to prevent its oversegmentation, the notion of dynamics of a minimum, based on geodesic reconstruction, has been proposed. In this paper, we extend the notion of dynamics to the contour arcs. This notion acts as a measure of the saliency of the contour. Contrary to the dynamics of minima, our concept reflects the extension and shape of the corresponding object in the image. This representation is also much more natural, because it is expressed in terms of partitions of the plane, i.e., segmentations. A hierarchical segmentation process is then derived, which gives a compact description of the image, containing all the segmentations one can obtain by the notion of dynamics, by means of a simple thresholding. Finally, efficient algorithms for computing the geodesic reconstruction as well as the dynamics of contours are presented.Keywords
This publication has 7 references indexed in Scilit:
- Topographic distance and watershed linesPublished by Elsevier ,2003
- On corner and vertex detectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Topological and geometrical corners by watershedPublished by Springer Nature ,1995
- Watershed of a continuous functionSignal Processing, 1994
- Watersheds in digital spaces: an efficient algorithm based on immersion simulationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- AN OPTIMAL REGION GROWING ALGORITHM FOR IMAGE SEGMENTATIONInternational Journal of Pattern Recognition and Artificial Intelligence, 1987
- A Computational Approach to Edge DetectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986