 |
HAL UPEC - UPEM Portal |  |
 |
Conference papers
Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts
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.
Cited literature [29 references]
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 : Wednesday, February 26, 2020 - 7:06:05 PM
Long-term archiving on: : Thursday, March 30, 2017 - 2:51:49 PM
Contributor : Laurent Najman <>
Submitted on : Monday, September 12, 2011 - 2:30:55 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Long-term archiving on: : Thursday, March 30, 2017 - 2:51:49 PM
File
hal.pdf
Files produced by the author(s)