Watersheds on weighted graphs - Mines Paris Accéder directement au contenu
Article Dans Une Revue Pattern Recognition Letters Année : 2014

Watersheds on weighted graphs

Fernand Meyer


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

Dates et versions

hal-01111752 , version 1 (30-01-2015)





Fernand Meyer. Watersheds on weighted graphs. Pattern Recognition Letters, 2014, 47, pp.72-79. ⟨10.1016/j.patrec.2014.02.018⟩. ⟨hal-01111752⟩
195 Consultations
240 Téléchargements



Gmail Facebook X LinkedIn More