A locally constrained watershed transform

The watershed transform, from mathematical morphology, is a powerful and flexible tool for segmentation. However, it does not allow a priori knowledge relating to characteristics of region boundaries to be included in the way that other approaches do. This paper introduces the locally constrained watershed transform, which includes border constraints by modifying the underlying path definition upon which the watershed transform depends. This approach maintains many of the desirable properties of the watershed transform, such as well-defined stopping conditions and efficient implementation, while offering more stable segmentation in the presence of noisy or incomplete boundaries

[1]  Baba C. Vemuri,et al.  Shape Modeling with Front Propagation: A Level Set Approach , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Roman Goldenberg,et al.  Fast Geodesic Active Contours , 1999, Scale-Space.

[3]  W E Higgins,et al.  Interactive morphological watershed analysis for 3D medical images. , 1993, Computerized medical imaging and graphics : the official journal of the Computerized Medical Imaging Society.

[4]  Rolf Adams,et al.  Seeded Region Growing , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[6]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[7]  Edmond J. Breen,et al.  An Evaluation of Priority Queues for Mathematical Morphology , 1994, ISMM.

[8]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[9]  Marcel Worring,et al.  Watersnakes: Energy-Driven Watershed Segmentation , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[11]  Richard Beare Regularized Seeded Region Growing , 2002 .

[12]  Arnold Meijster,et al.  Efficient sequential and parallel algorithms for morphological image processing , 2004 .

[13]  Serge Beucher,et al.  Use of watersheds in contour detection , 1979 .

[14]  F. Meyer IMAGE SEGMENTATION BASED ON VISCOUS FLOODING SIMULATION , 2002 .

[15]  Fernand Meyer,et al.  Topographic distance and watershed lines , 1994, Signal Process..

[16]  Luc Vincent,et al.  Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Beatriz Marcotegui,et al.  A toolbox for interactive segmentation based on nested partitions , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[18]  Jos B. T. M. Roerdink,et al.  The Watershed Transform: Definitions, Algorithms and Parallelization Strategies , 2000, Fundam. Informaticae.

[19]  Jos B. T. M. Roerdink,et al.  Mathematical Morphology in Image Processing , 1993 .