Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2009

Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation

Résumé

We study hierachical 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 edgesegmentations. We end this paper by showing how the proposed framework allows to see constrained connectivity as a classical watershed-based morphological scheme, which provides an efficient algorithm to compute the whole hierarchy.
Fichier principal
Vignette du fichier
ultrametrics_long.pdf (1.74 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00419373 , version 1 (09-02-2010)
hal-00419373 , version 2 (17-12-2010)

Identifiants

Citer

Laurent Najman. Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation. 2009. ⟨hal-00419373v1⟩
622 Consultations
426 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More