Watersheds on weighted graphs

Abstract : The watershed is an efficient and versatile segmentation tool, as it partitions the images into disjoint catchment basins. We study the watershed on node or edge weighted graphs. We do not aim at constructing a partition of the nodes but consider the catchment zones, i.e. the attraction zone of a drop of water. Often, such zones largely overlap. In a first part we show how to derive from a node or edge weighted graph a ooding graph with the same trajectories of a drop of water, whether one considers its node weights alone or its edge weights alone. In a second part we show how to reduce the number of possible trajectories of a drop of water in order to generate watershed partitions. This is the long version, with proofs, of a paper published with the same title "Watersheds on weighted graphs" in Pattern Recognition Letters, Volume 47, October, 2014.
Type de document :
Article dans une revue
Pattern Recognition Letters, Elsevier, 2014, 47, pp.72-79. <10.1016/j.patrec.2014.02.018>
Liste complète des métadonnées

Contributeur : Fernand Meyer <>
Soumis le : vendredi 30 janvier 2015 - 21:15:32
Dernière modification le : mardi 12 septembre 2017 - 11:41:39
Document(s) archivé(s) le : samedi 12 septembre 2015 - 07:16:51


Fichiers produits par l'(les) auteur(s)


Distributed under a Creative Commons Paternité 4.0 International License




Fernand Meyer. Watersheds on weighted graphs. Pattern Recognition Letters, Elsevier, 2014, 47, pp.72-79. <10.1016/j.patrec.2014.02.018>. <hal-01111752>



Consultations de
la notice


Téléchargements du document