Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Pattern Analysis and Machine Intelligence Année : 2010

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

Jean Cousty
Michel Couprie

Résumé

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.
Fichier principal
Vignette du fichier
WatershedCutsPAMI-part2-full.pdf (464.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00729346 , version 1 (14-01-2013)

Identifiants

  • HAL Id : hal-00729346 , version 1

Citer

Jean Cousty, Gilles Bertrand, Laurent Najman, Michel Couprie. Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2010, 32 (5), pp.925-939. ⟨hal-00729346⟩
165 Consultations
679 Téléchargements

Partager

Gmail Facebook X LinkedIn More