The Watershed Transform: Definitions, Algorithms and Parallelization Strategies

The watershed transform is the method of choice for image segmentation in the field of mathematical morphology. We present a critical review of several definitions of the watershed transform and the associated sequential algorithms, and discuss various issues which often cause confusion in the literature. The need to distinguish between definition, algorithm specification and algorithm implementation is pointed out. Various examples are given which illustrate differences between watershed transforms based on different definitions and/or implementations. The second part of the paper surveys approaches for parallel implementation of sequential watershed algorithms.

[1]  C. Berge.  Théorie des graphes et ses applications , 1958 .

[2]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3]  L. Bittner.  C. Berge, Théorie des graphes et ses applications. VIII + 277 S. m. 117 Abb. Paris 1958. Dunod Editeur. Preis geb. 3400 F , 1960 .

[4]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[5]  Edsger W. Dijkstra,et al.  Co-operating sequential processes , 1968 .

[6]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

[7]  S. Beucher.  Use of watersheds in contour detection , 1979 .

[8]  Hanan Samet,et al.  Connected Component Labeling Using Quadtrees , 1981, JACM.

[9]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

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

[11]  R. Lee,et al.  Two-Dimensional Critical Point Configuration Graphs , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Jan van Leeuwen,et al.  Worst-case Analysis of Set Union Algorithms , 1984, JACM.

[13]  L. Nackman.  Two-Dimensional Critical Point Configuration Graphs , 1984, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Piet W. Verbeek,et al.  Shading from shape, the eikonal equation solved by grey-weighted distance transform , 1990, Pattern Recognit. Lett..

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

[16]  Viktor K. Prasanna,et al.  Parallel Architectures and Algorithms for Image Component Labeling , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Patrick Wambacq,et al.  Component labelling on a MIMD multiprocessor , 1993 .

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

[19]  Moncef Gabbouj,et al.  Fast watershed algorithms: analysis and extensions , 1994, Electronic Imaging.

[20]  Ian Foster,et al.  Designing and building parallel programs , 1994 .

[21]  William Gropp,et al.  Skjellum using mpi: portable parallel programming with the message-passing interface , 1994 .

[22]  Moncef Gabbouj,et al.  Implementation of a Distributed Watershed Algorithm , 1994, ISMM.

[23]  M. J. Quinn,et al.  Parallel computing (2nd ed.): theory and practice , 1994 .

[24]  Serge Beucher,et al.  Watershed, Hierarchical Segmentation and Waterfall Algorithm , 1994, ISMM.

[25]  Gerald Schreiber,et al.  PIPS--A general purpose Parallel Image Processing System , 1994 .

[26]  Laurent Najman,et al.  Watershed of a continuous function , 1994, Signal Process..

[27]  M. J. Quinn,et al.  Parallel Computing: Theory and Practice , 1994 .

[28]  Jos B. T. M. Roerdink,et al.  A Proposal for the Implementation of a Parallel Watershed Algorithm , 1995, CAIP.

[29]  Moncef Gabbouj,et al.  A Parallel Watershed Algorithm Based on the Shortest Path Computation , 1995 .

[30]  Ian T. Foster,et al.  Designing and building parallel programs - concepts and tools for parallel software engineering , 1995 .

[31]  Jack Dongarra,et al.  PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing , 1995 .

[32]  Moncef Gabbouj,et al.  Parallel Watershed Algorithm Based on Sequential Scanning , 1995 .

[33]  Jos B. T. M. Roerdink,et al.  Computation of Watersheds Based on Parallel Graph Algorithms , 1996, ISMM.

[34]  Dominique Noguet,et al.  A Data Dependent Architecture Based on Seeded Region Growing Strategy for Advanced Morphological Operators , 1996, ISMM.

[35]  Christophe Fiorio,et al.  Two Linear Time Union-Find Strategies for Image Processing , 1996, Theor. Comput. Sci..

[36]  Jos B. T. M. Roerdink,et al.  Segmentation by watersheds: definition and parallel implementation , 1996, TFCV.

[37]  Hans Burkhardt,et al.  A Parallel Watershed Algorithm , 1996 .

[38]  Moncef Gabbouj,et al.  Parallel Image Component Labeling With Watershed Transformation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[39]  Jos B. T. M. Roerdink,et al.  A disjoint set algorithm for the watershed transform , 1998, 9th European Signal Processing Conference (EUSIPCO 1998).

[40]  Alina N. Moga,et al.  A connected component approach to the watershed segmentation , 1998 .

[41]  Moncef Gabbouj,et al.  Parallel Marker-Based Image Segmentation with Watershed Transformation , 1998, J. Parallel Distributed Comput..

[42]  Moncef Gabbouj,et al.  Parallel watershed transformation algorithms for image segmentation , 1998, Parallel Comput..

[43]  B. Dundas,et al.  DIFFERENTIAL TOPOLOGY , 2002 .