dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.date.accessioned2018-12-11T17:03:21Z
dc.date.available2018-12-11T17:03:21Z
dc.date.created2018-12-11T17:03:21Z
dc.date.issued2016-10-05
dc.identifierNeurocomputing, v. 208, p. 66-79.
dc.identifier1872-8286
dc.identifier0925-2312
dc.identifierhttp://hdl.handle.net/11449/173064
dc.identifier10.1016/j.neucom.2016.03.081
dc.identifier2-s2.0-84973541124
dc.description.abstractEffectively measuring the similarity among images is a challenging problem in image retrieval tasks due to the difficulty of considering the dataset manifold. This paper presents an unsupervised manifold learning algorithm that takes into account the intrinsic dataset geometry for defining a more effective distance among images. The dataset structure is modeled in terms of a Correlation Graph (CG) and analyzed using Strongly Connected Components (SCCs). While the Correlation Graph adjacency provides a precise but strict similarity relationship, the Strongly Connected Components analysis expands these relationships considering the dataset geometry. A large and rigorous experimental evaluation protocol was conducted for different image retrieval tasks. The experiments were conducted in different datasets involving various image descriptors. Results demonstrate that the manifold learning algorithm can significantly improve the effectiveness of image retrieval systems. The presented approach yields better results in terms of effectiveness than various methods recently proposed in the literature.
dc.languageeng
dc.relationNeurocomputing
dc.relation1,073
dc.rightsAcesso restrito
dc.sourceScopus
dc.subjectContent-based image retrieval
dc.subjectCorrelation graph
dc.subjectStrongly connected components
dc.subjectUnsupervised manifold learning
dc.titleA correlation graph approach for unsupervised manifold learning in image retrieval tasks
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución