Algorithms for hierarchical segmentation based on the Felzenszwalb-Huttenlocher dissimilarity

Abstract : Hierarchical image segmentation provides a region-oriented scale-space, i.e., a set of image segmentations at different detail levels in which the segmentations at finer levels are nested with respect to those at coarser levels. Most image segmentation algorithms, such as region merging algorithms, rely on a criterion for merging that does not lead to a hierarchy. Guimarães et al. proposed in 2012 a hierarchical graph-based image segmentation method relying on a criterion popularized by Felzenszwalb and Huttenlocher in 2004, hence hierarchizing the popular Felzenszwalb-Huttenlocher method. However, Guimarães et al. did not provide an algorithm to compute the proposed hierarchy. We propose a series of algorithms to compute the result of this hierarchical graph-based image segmentation method. For an image of size 321 × 481 pixels, the most efficient algorithm produces the result in half a second whereas the most naive one requires more than four hours
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01710920
Contributor : Edward Jorge Yuri Cayllahua Cahuina <>
Submitted on : Thursday, March 1, 2018 - 2:56:25 PM
Last modification on : Tuesday, August 13, 2019 - 4:02:03 PM
Long-term archiving on : Wednesday, May 30, 2018 - 12:32:39 PM

File

ICPRAI2018.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01710920, version 1

Citation

Edward Jorge Yuri Cayllahua Cahuina, Jean Cousty, Yukiko Kenmochi, Arnaldo de Albuquerque Araujo, Guillermo Cámara-Chávez. Algorithms for hierarchical segmentation based on the Felzenszwalb-Huttenlocher dissimilarity. International Conference on Pattern Recognition and Artificial Intelligence, May 2018, Montreal, Canada. ⟨hal-01710920⟩

Share

Metrics

Record views

260

Files downloads

135