Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts

Jean Cousty

Résumé

We study hierarchical segmentations that are optimal in the sense of minimal spanning forests of the original image. We introduce a region-merging operation called uprooting, and we prove that optimal hierarchical segmentations are equivalent to the ones given by uprooting a watershed-cut based segmentation. Based on those theoretical results, we propose an efficient algorithm to compute such hierarchies, as well as the first saliency map algorithm compatible with the morphological filtering framework.
Fichier principal
Vignette du fichier
hal.pdf (1.25 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00622505 , version 1 (12-09-2011)

Identifiants

Citer

Jean Cousty, Laurent Najman. Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts. 10th International Symposium on Mathematical Morphology (ISMM'11), Jul 2011, Verbania-Intra, Italy. pp.272-283, ⟨10.1007/978-3-642-21569-8_24⟩. ⟨hal-00622505⟩
431 Consultations
983 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More