Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps

Abstract : Hierarchies of partitions are generally represented by dendrograms (direct representation). They can also be represented by saliency maps or minimum spanning trees. In this article, we precisely study the links between these three representations. In particular, we provide a new bijection between saliency maps and hierarchies based on quasi-flat zones as often used in image processing and we characterize saliency maps and minimum spanning trees as solutions to constrained minimization problems where the constraint is quasi-flat zones preservation. In practice, these results make up a toolkit for designing new hierarchical methods where one can choose the most convenient representation. They also invite us to process non-image data with morphological hierarchies. More precisely, we show the practical interest of the proposed framework for: i) hierarchical watershed image segmentations, ii) combinations of dierent hierarchical segmentations, iii) hierarchicalizations of some non-hierarchical image segmentation methods based on regional dissimilarities, and iv) hierarchical analysis of geographical data.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [50 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01344727
Contributor : Jean Cousty <>
Submitted on : Wednesday, November 29, 2017 - 9:48:03 AM
Last modification on : Thursday, February 7, 2019 - 4:35:01 PM

File

JC2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01344727, version 2

Citation

Jean Cousty, Laurent Najman, Yukiko Kenmochi, Silvio Guimarães. Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps. Journal of Mathematical Imaging and Vision, Springer Verlag, 2018, 60 (4), pp.479-502. ⟨https://link.springer.com/article/10.1007/s10851-017-0768-7⟩. ⟨hal-01344727v2⟩

Share

Metrics

Record views

301

Files downloads

982