Implementation and complexity of the watershed-from-markers algorithm computed as a minimal cost forest

@article{Felkel2001ImplementationAC,
  title={Implementation and complexity of the watershed-from-markers algorithm computed as a minimal cost forest},
  author={Petr Felkel and Mario Bruckschwaiger and Rainer Wegenkittl},
  journal={Comput. Graph. Forum},
  year={2001},
  volume={20},
  pages={26-35}
}
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. As IFT cleverly solves the problem of plateaus and as it gives precise results when thin objects… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 35 extracted citations

Four-Color Theorem and Level Set Methods for Watershed Segmentation

International Journal of Computer Vision • 2008
View 5 Excerpts
Highly Influenced

PDE Based Algorithms for Smooth Watersheds

IEEE Transactions on Medical Imaging • 2015
View 3 Excerpts

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Data structures and procedures”, Journal of Geographic Information and Decision Analysis , 1(1), pp

F. B. Zhan, “Three fastest shortest path algorithms on real road networks
69–82 • 1997

Three fastest shortest path algorithms on real road networks : Data structures and procedures ”

N. J. Prentice Hall
Network Flows : Theory , Algorithms and Applications . • 1993

A note on two problems in connection with graphs

E. W. Dijkstra
Numeriche Mathematik , • 1959

Similar Papers

Loading similar papers…