Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds

Citations Over TimeTop 10% of 2009 papers

Abstract

We recently introduced 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 several morphological region merging methods are (implicitly) based. We also establish the links and differences between watershed cuts, minimum spanning forests, shortest path forests, and topological watersheds. Finally, we present illustrations of the proposed framework to the segmentation of artwork surfaces and diffusion tensor images.

Related Papers

• → Feasibility of peach bloom thinning with hand-held mechanical devices(2011)13 cited
• → Effects of Thinning Type on the Harvester Productivity and on the Residual Stand(1997)56 cited
• → Comparative Analysis of Thinning Techniques in Garchinsky Forestry(2022)5 cited
• → Mechanical flower thinning in peach trees(2019)5 cited
• The Analysis Effect of Thinning in Natural Shaw(2006)