Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/73809
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Afonso, L. | - |
dc.contributor.author | Papa, J. | - |
dc.contributor.author | Papa, L. | - |
dc.contributor.author | Marana, Aparecido Nilceu | - |
dc.contributor.author | Rocha, Anderson | - |
dc.date.accessioned | 2014-05-27T11:27:17Z | - |
dc.date.accessioned | 2016-10-25T18:40:00Z | - |
dc.date.available | 2014-05-27T11:27:17Z | - |
dc.date.available | 2016-10-25T18:40:00Z | - |
dc.date.issued | 2012-12-01 | - |
dc.identifier | http://dx.doi.org/10.1109/ICIP.2012.6467255 | - |
dc.identifier.citation | Proceedings - International Conference on Image Processing, ICIP, p. 1897-1900. | - |
dc.identifier.issn | 1522-4880 | - |
dc.identifier.uri | http://hdl.handle.net/11449/73809 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/73809 | - |
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. © 2012 IEEE. | en |
dc.format.extent | 1897-1900 | - |
dc.language.iso | eng | - |
dc.source | Scopus | - |
dc.subject | Automatic Visual Word Dictionary Calculation | - |
dc.subject | Bag-of-visual Words | - |
dc.subject | Clustering algorithms | - |
dc.subject | Optimum-Path Forest | - |
dc.subject | Discriminative features | - |
dc.subject | Graph-based clustering | - |
dc.subject | Image Categorization | - |
dc.subject | Invariant points | - |
dc.subject | Optimum-path forests | - |
dc.subject | State-of-the-art techniques | - |
dc.subject | User intervention | - |
dc.subject | Vision communities | - |
dc.subject | Visual dictionaries | - |
dc.subject | Visual word | - |
dc.subject | Forestry | - |
dc.subject | Image processing | - |
dc.subject | Algorithms | - |
dc.subject | Image Analysis | - |
dc.title | Automatic visual dictionary generation through Optimum-Path Forest clustering | en |
dc.type | outro | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.contributor.institution | Universidade Estadual de Campinas (UNICAMP) | - |
dc.description.affiliation | Universidade Estadual Paulista (UNESP) Department of Computing | - |
dc.description.affiliation | University of Campinas Institute of Computing | - |
dc.description.affiliationUnesp | Universidade Estadual Paulista (UNESP) Department of Computing | - |
dc.identifier.doi | 10.1109/ICIP.2012.6467255 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | Proceedings - International Conference on Image Processing, ICIP | - |
dc.identifier.scopus | 2-s2.0-84875818163 | - |
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.