Skip to Main content Skip to Navigation
Journal articles

On the equivalence between hierarchical segmentations and ultrametric watersheds

Abstract : We study hierarchical segmentation in the framework of edge-weighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that there exists a bijection between the set of ultrametric watersheds and the set of hierarchical segmentations. We end this paper by showing how to use the proposed framework in practice in the example of constrained connectivity; in particular it allows to compute such a hierarchy following a classical watershed-based morphological scheme, which provides an efficient algorithm to compute the whole hierarchy.
Document type :
Journal articles
Complete list of metadatas

Cited literature [45 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00419373
Contributor : Laurent Najman <>
Submitted on : Friday, December 17, 2010 - 4:50:12 PM
Last modification on : Monday, June 29, 2020 - 10:30:29 PM
Long-term archiving on: : Friday, December 2, 2016 - 4:32:30 PM

Files

ultrametrics_long.pdf
Files produced by the author(s)

Identifiers

Citation

Laurent Najman. On the equivalence between hierarchical segmentations and ultrametric watersheds. Journal of Mathematical Imaging and Vision, Springer Verlag, 2011, 40 (3), pp.231-247. ⟨10.1007/s10851-011-0259-1⟩. ⟨hal-00419373v2⟩

Share

Metrics

Record views

619

Files downloads

675