dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2015-03-18T15:56:37Z
dc.date.available2015-03-18T15:56:37Z
dc.date.created2015-03-18T15:56:37Z
dc.date.issued2012-01-01
dc.identifier2012 Ieee International Conference On Image Processing (icip 2012). New York: Ieee, p. 1897-1900, 2012.
dc.identifier1522-4880
dc.identifierhttp://hdl.handle.net/11449/117646
dc.identifierWOS:000319334901236
dc.identifier9039182932747194
dc.identifier6027713750942689
dc.description.abstractImage 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.
dc.languageeng
dc.publisherIeee
dc.relation2012 Ieee International Conference On Image Processing (icip 2012)
dc.relation0,257
dc.rightsAcesso aberto
dc.sourceWeb of Science
dc.subjectOptimum-Path Forest
dc.subjectClustering algorithms
dc.subjectBag-of-visual Words
dc.subjectAutomatic Visual Word Dictionary Calculation
dc.titleAutomatic visual dictionary generation through optimum-path forest clusteringautomatic visual dictionary generation through optimum-path forest clustering
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución