Issue No. 05 - May (2010 vol. 32)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2009.71
Jean Cousty , Université Paris-Est, Equipe A3SI, ESIEE, Paris and INRIA Sophia Antipolis, France
Gilles Bertrand , Université Paris-Est, Equipe A3SI, ESIEE, Paris
Laurent Najman , Université Paris-Est, Equipe A3SI, ESIEE, Paris
Michel Couprie , Université Paris-Est, Equipe A3SI, ESIEE, Paris
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.
Watershed, thinning, minimum spanning forest, shortest path forest, connection value, image segmentation.
L. Najman, M. Couprie, G. Bertrand and J. Cousty, "Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 32, no. , pp. 925-939, 2009.