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

Jean Cousty 1 Laurent Najman 1
1 LIGM - Laboratoire d'Informatique Gaspard-Monge
Abstract : 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.
Type de document :
Communication dans un congrès
10th International Symposium on Mathematical Morphology (ISMM'11), Jul 2011, Verbania-Intra, Italy. 6671, pp.272-283, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-21569-8_24〉
Liste complète des métadonnées

Littérature citée [29 références]  Voir  Masquer  Télécharger
https://hal-upec-upem.archives-ouvertes.fr/hal-00622505
Contributeur : Laurent Najman <>
Soumis le : lundi 12 septembre 2011 - 14:30:55
Dernière modification le : vendredi 12 juillet 2013 - 18:13:40
Document(s) archivé(s) le : jeudi 30 mars 2017 - 14:51:49

Fichier

hal.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

ENPC-LIGM | ENPC | PARISTECH | UNIV-MLV | LIGM_A3SI | LIGM | UPEC-UPEM

Citation

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. 6671, pp.272-283, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-21569-8_24〉. 〈hal-00622505〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de
la notice

361

Téléchargements du document

290

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD