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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download

https://hal-mines-paristech.archives-ouvertes.fr/hal-01111752
Contributor : Fernand Meyer <>
Submitted on : Friday, January 30, 2015 - 9:15:32 PM
Last modification on : Monday, November 12, 2018 - 10:56:14 AM
Document(s) archivé(s) le : Saturday, September 12, 2015 - 7:16:51 AM

File

plwshed_v8withproofs.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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

Share

Metrics

Record views

208

Files downloads

161