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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [29 references]  Display  Hide  Download
https://hal-upec-upem.archives-ouvertes.fr/hal-00622505
Contributor : Laurent Najman <>
Submitted on : Monday, September 12, 2011 - 2:30:55 PM
Last modification on : Thursday, July 5, 2018 - 2:28:33 PM
Document(s) archivé(s) le : Thursday, March 30, 2017 - 2:51:49 PM

File

hal.pdf
Files produced by the author(s)

Identifiers

Collections

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

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. pp.272-283, ⟨10.1007/978-3-642-21569-8_24⟩. ⟨hal-00622505⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

513

Files downloads

434

Contact

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