Efficient Algorithms for Hierarchical Graph-Based Segmentation Relying on the Felzenszwalb–Huttenlocher Dissimilarity

• Autores: Cahuina, Edward Cayllahua, Cousty, Jean, Kenmochi, Yukiko, de Albuquerque Araújo, Arnaldo, Cámara-Chávez, Guillermo, Guimarães, Silvio Jamil F.
• Formato: artículo
• Fecha de Publicación: 2018
• Institución: Consejo Nacional de Ciencia Tecnología e Innovación
• Repositorio: CONCYTEC-Institucional
• Lenguaje: inglés
• OAI Identifier: oai:repositorio.concytec.gob.pe:20.500.12390/1338
• Enlace del recurso: https://hdl.handle.net/20.500.12390/1338; https://doi.org/10.1142/s0218001419400081
• Nivel de acceso: acceso abierto
• Materia: quasi-flat zone; Image segmentation; hierarchical analysis; incremental algorithm; https://purl.org/pe-repo/ocde/ford#2.02.03

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.