Algorithms for the Topological Watershed

The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,4] consists in modifying the original image by lowering some points until stability while preserving some topological properties, namely, the connectivity of each lower cross-section. Such a transformation (and its result) is called a topological watershed. In this paper, we propose quasi-linear algorithms for computing topological watersheds. These algorithms are proved to give correct results with respect to the definitions, and their time complexity is analyzed.

[1]  Mikkel Thorup,et al.  On RAM priority queues , 1996, SODA '96.

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

[3]  Luc Vincent,et al.  Morphological grayscale reconstruction in image analysis: applications and efficient algorithms , 1993, IEEE Trans. Image Process..

[4]  Gilles Bertrand,et al.  Quasi-Linear Algorithms for the Topological Watershed , 2005, Journal of Mathematical Imaging and Vision.

[5]  Gilles Bertrand,et al.  Enhanced computation method of topological smoothing on shared memory parallel machines , 2005, Journal of Mathematical Imaging and Vision.

[6]  Michel Couprie,et al.  Quasilinear algorithm for the component tree , 2004, IS&T/SPIE Electronic Imaging.

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

[8]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

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

[10]  Gilles Bertrand,et al.  Topological gray-scale watershed transformation , 1997, Optics & Photonics.