论文信息 - Implementation and Complexity of the Watershed‐from‐Markers Algorithm Computed as a Minimal Cost Forest

Implementation and Complexity of the Watershed‐from‐Markers Algorithm Computed as a Minimal Cost Forest

The watershed algorithm belongs to classical algorithms in mathematical morphology. Lotufo et al.1 published a principle of the watershed computation by means of an iterative forest transform (IFT), which computes a shortest path forest from given markers. The algorithm itself was described for a 2D case (image) without a detailed discussion of its computation and memory demands for real datasets.

Rainer Wegenkittl | Petr Felkel | Mario Bruckschwaiger

[1] Charles Ashbacher,et al. Microsoft Visual C++, Version 6.0 , 1999 .

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

[3] Robert B. Dial,et al. Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[4] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

[5] Milan Sonka,et al. Image Processing, Analysis and Machine Vision , 1993, Springer US.

[6] Alexandre X. Falcão,et al. The Ordered Queue and the Optimality of the Watershed Approaches , 2000, ISMM.

[7] Kurt Mehlhorn,et al. Faster algorithms for the shortest path problem , 1990, JACM.