Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/117646
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Afonso, Luis Cláudio Súgi | - |
dc.contributor.author | Papa, João Paulo | - |
dc.contributor.author | Papa, Luciene Patrici | - |
dc.contributor.author | Marana, Aparecido Nilceu | - |
dc.contributor.author | Rocha, Anderson | - |
dc.contributor.author | - | |
dc.date.accessioned | 2015-03-18T15:56:37Z | - |
dc.date.accessioned | 2016-10-25T20:35:51Z | - |
dc.date.available | 2015-03-18T15:56:37Z | - |
dc.date.available | 2016-10-25T20:35:51Z | - |
dc.date.issued | 2012-01-01 | - |
dc.identifier | http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6467255 | - |
dc.identifier.citation | 2012 Ieee International Conference On Image Processing (icip 2012). New York: Ieee, p. 1897-1900, 2012. | - |
dc.identifier.issn | 1522-4880 | - |
dc.identifier.uri | http://hdl.handle.net/11449/117646 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/117646 | - |
dc.description.abstract | Image categorization by means of bag of visual words has received increasing attention by the image processing and vision communities in the last years. In these approaches, each image is represented by invariant points of interest which are mapped to a Hilbert Space representing a visual dictionary which aims at comprising the most discriminative features in a set of images. Notwithstanding, the main problem of such approaches is to find a compact and representative dictionary. Finding such representative dictionary automatically with no user intervention is an even more difficult task. In this paper, we propose a method to automatically find such dictionary by employing a recent developed graph-based clustering algorithm called Optimum-Path Forest, which does not make any assumption about the visual dictionary's size and is more efficient and effective than the state-of-the-art techniques used for dictionary generation. | en |
dc.format.extent | 1897-1900 | - |
dc.language.iso | eng | - |
dc.publisher | Ieee | - |
dc.source | Web of Science | - |
dc.subject | Optimum-Path Forest | en |
dc.subject | Clustering algorithms | en |
dc.subject | Bag-of-visual Words | en |
dc.subject | Automatic Visual Word Dictionary Calculation | en |
dc.title | Automatic visual dictionary generation through optimum-path forest clusteringautomatic visual dictionary generation through optimum-path forest clustering | en |
dc.type | outro | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.description.affiliation | UNESP Univ Estadual Paulista, Dept Comp, Jaboticabal, Brazil | - |
dc.description.affiliationUnesp | UNESP Univ Estadual Paulista, Dept Comp, Jaboticabal, Brazil | - |
dc.identifier.wos | WOS:000319334901236 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | 2012 Ieee International Conference On Image Processing (icip 2012) | - |
Appears in Collections: | Artigos, TCCs, Teses e Dissertações da Unesp |
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.