 |
Journal articles
Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds
Abstract : We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three algorithmic watershed cut strategies: the first one is well suited to parallel implementations, the second one leads to a flexible linear-time sequential implementation whereas the third one links the watershed cuts and the popular flooding algorithms. We state that watershed cuts preserve a notion of contrast, called connection value, on which are (implicitly) ased several morphological region merging methods. We also establish the links and differences between watershed cuts, minimum spanning forests, shortest-path forests and topological watersheds. Finally, we present illsutrations of the proposed framework to the segmentation of artwork surfaces and diffusion tensor images.
https://hal-upec-upem.archives-ouvertes.fr/hal-00729346
Contributor : Jean Cousty <>
Submitted on : Monday, January 14, 2013 - 11:12:55 AM
Last modification on : Monday, June 29, 2020 - 10:30:03 PM
Long-term archiving on: : Monday, April 15, 2013 - 3:52:28 AM
Contributor : Jean Cousty <>
Submitted on : Monday, January 14, 2013 - 11:12:55 AM
Last modification on : Monday, June 29, 2020 - 10:30:03 PM
Long-term archiving on: : Monday, April 15, 2013 - 3:52:28 AM
File
WatershedCutsPAMI-part2-full.p...
Files produced by the author(s)