Publicación:
Efficient Algorithms for Hierarchical Graph-Based Segmentation Relying on the Felzenszwalb–Huttenlocher Dissimilarity
Efficient Algorithms for Hierarchical Graph-Based Segmentation Relying on the Felzenszwalb–Huttenlocher Dissimilarity
| dc.contributor.author | Cahuina, Edward Cayllahua | es_PE |
| dc.contributor.author | Cousty, Jean | es_PE |
| dc.contributor.author | Kenmochi, Yukiko | es_PE |
| dc.contributor.author | de Albuquerque Araújo, Arnaldo | es_PE |
| dc.contributor.author | Cámara-Chávez, Guillermo | es_PE |
| dc.contributor.author | Guimarães, Silvio Jamil F. | es_PE |
| dc.date.accessioned | 2024-05-30T23:13:38Z | |
| dc.date.available | 2024-05-30T23:13:38Z | |
| dc.date.issued | 2018-12-27 | |
| dc.description | The research leading to these results has received funding from the French Agence Nationale de la Recherche, grant agreement ANR-15-CE40-0006 (CoMeDiC), the Brazilian Federal Agency of Support and Evaluation of Postgraduate Education (program CAPES/PVE: grant 064965/2014-01), the Peruvian agency Consejo Na-cional de Ciencia, Tecnolog´ıa e Innovaci´on Tecnol´ogica CONCYTEC (contract N-101-2016-. FONDECYT-DE). The first author would like to thank Brazilian agencies CNPq and CAPES and Peruvian agency CONCYTEC for the financial support during his thesis. | |
| dc.description.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. However, most image segmentation algorithms, among which a graph-based image segmentation method relying on a region merging criterion was proposed by Felzenszwalb–Huttenlocher in 2004, do not lead to a hierarchy. In order to cope with a demand for hierarchical segmentation, Guimarães et al. proposed in 2012 a method for hierarchizing the popular Felzenszwalb–Huttenlocher method, without providing an algorithm to compute the proposed hierarchy. This paper is devoted to providing a series of algorithms to compute the result of this hierarchical graph-based image segmentation method efficiently, based mainly on two ideas: optimal dissimilarity measuring and incremental update of the hierarchical structure. Experiments show that, 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 4 h. | |
| dc.description.sponsorship | Consejo Nacional de Ciencia, Tecnología e Innovación Tecnológica - Concytec | |
| dc.identifier.doi | https://doi.org/10.1142/s0218001419400081 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12390/1338 | |
| dc.language.iso | eng | |
| dc.publisher | World Scientific Pub Co Pte Lt | |
| dc.relation.ispartof | International Journal of Pattern Recognition and Artificial Intelligence | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | quasi-flat zone | |
| dc.subject | Image segmentation | es_PE |
| dc.subject | hierarchical analysis | es_PE |
| dc.subject | incremental algorithm | es_PE |
| dc.subject.ocde | https://purl.org/pe-repo/ocde/ford#2.02.03 | |
| dc.title | Efficient Algorithms for Hierarchical Graph-Based Segmentation Relying on the Felzenszwalb–Huttenlocher Dissimilarity | |
| dc.type | info:eu-repo/semantics/article | |
| dspace.entity.type | Publication | |
| oairecerif.author.affiliation | #PLACEHOLDER_PARENT_METADATA_VALUE# | |
| oairecerif.author.affiliation | #PLACEHOLDER_PARENT_METADATA_VALUE# | |
| oairecerif.author.affiliation | #PLACEHOLDER_PARENT_METADATA_VALUE# | |
| oairecerif.author.affiliation | #PLACEHOLDER_PARENT_METADATA_VALUE# | |
| oairecerif.author.affiliation | #PLACEHOLDER_PARENT_METADATA_VALUE# | |
| oairecerif.author.affiliation | #PLACEHOLDER_PARENT_METADATA_VALUE# |