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

摘要: We recently introduced watershed cuts, a notion of in edge-weighted graphs. In this paper, our main contribution is thinning paradigm from which we derive three algorithmic cut strategies: The first one well suited to parallel implementations, the second leads flexible linear-time sequential implementation, whereas third links cuts and popular flooding algorithms. state that preserve contrast, called connection value, on several morphological region merging methods are (implicitly) based. also establish differences between minimum spanning forests, shortest path topological watersheds. Finally, present illustrations proposed framework segmentation artwork surfaces diffusion tensor images.