Watersnakes: Energy-driven watershed srgmentation
- 28 February 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 25 (3) , 330-342
- https://doi.org/10.1109/tpami.2003.1182096
Abstract
The watershed algorithm from mathematical morphology is powerful for segmentation. However, it does not allow incorporation of a priori information as segmentation methods that are based on energy minimization. In particular, there is no control of the smoothness of the segmentation result. In this paper, we show how to represent watershed segmentation as an energy minimization problem using the distance-based definition of the watershed line. A priori considerations about smoothness can then be imposed by adding the contour length to the energy function. This leads to a new segmentation method called watersnakes, integrating the strengths of watershed segmentation and energy based segmentation. Experimental results show that, when the original watershed segmentation has noisy boundaries or wrong limbs attached to the object of interest, the proposed method overcomes those drawbacks and yields a better segmentation.Keywords
This publication has 23 references indexed in Scilit:
- Distance transformations in digital imagesPublished by Elsevier ,2006
- Morphological segmentationPublished by Elsevier ,2004
- Topographic distance and watershed linesPublished by Elsevier ,2003
- Geodesic saliency of watershed contours and hierarchical segmentationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- Region competition: unifying snakes, region growing, and Bayes/MDL for multiband image segmentationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- Seeded region growingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Shape-from-shading, viscosity solutions and edgesNumerische Mathematik, 1993
- Morphological grayscale reconstruction in image analysis: applications and efficient algorithmsIEEE Transactions on Image Processing, 1993
- Watersheds in digital spaces: an efficient algorithm based on immersion simulationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulationsJournal of Computational Physics, 1988