A disjoint set algorithm for the watershed transform

European Signal Processing Conference

Volumn 1998-January, Issue , 1998, Pages

  Meijster, Arnold ^a   Roerdink, Jos B T M ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE SEGMENTATION; QUEUEING THEORY; SIGNAL PROCESSING;

FIFO QUEUE; PARALLEL IMPLEMENTATIONS; SET ALGORITHM; UNION FIND; WATERSHED TRANSFORM;

WATERSHEDS;

EID: 85002249116     PISSN: 22195491     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Beucher, S., and Meyer, F. The morphological approach to segmentation: the watershed transformation. In Mathematical Morphology in Image Processing, E. R. Dougherty, Ed. Marcel Dekker, New York, 1993, ch. 12, pp. 433-481.
2. Bieniek, A., Burkhardt, H., Marschner, H., Nolle, M., and Schreiber, G. A parallel watershed algorithm. In Proc. 10th Scandinavian Conference on Image Analysis (SCIA'97), Lappeenranta, Finland (1997), pp. 237-244.
3. Meijster, A., and Roerdink, J. B. T. M. A proposal for the implementation of a parallel watershed algorithm. In Computer Analysis of Images and Patterns, V. Hlavac and R. Šára, Eds., Vol. 970 of Lecture Notes in Computer Science. Springer-Verlag, New York-Heidelberg-Berlin, 1995, pp. 790-795.
4. Meyer, F. Topographic distance and watershed lines. Signal Process. 38 (1994), 113-125.
5. Tarjan, R. E. Data Structures and Network Algorithms. SIAM, 1983.
6. Vincent, L., and Soille, P. Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE Trans. Patt. Anal. Mach. Intell. 13, 6 (1990), 583-598.