2018
DOI: 10.1016/j.patcog.2017.05.009
|View full text |Cite
|
Sign up to set email alerts
|

Unsupervised manifold learning through reciprocal kNN graph and Connected Components for image retrieval tasks

Abstract: Performing effective image retrieval tasks, capable of exploiting the underlying structure of datasets still constitutes a challenge research scenario. This paper proposes a novel manifold learning approach that exploits the intrinsic dataset geometry for improving the effectiveness of image retrieval tasks. The underlying dataset manifold is modeled and analyzed in terms of a Reciprocal kNN Graph and its Connected Components. The method computes the new retrieval results on an unsupervised way, without the ne… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 57 publications
(36 citation statements)
references
References 67 publications
0
36
0
Order By: Relevance
“…Notice that our approaches present effectiveness results superior or comparable to the baselines in the majority of the scenarios. [23] et al [24] et al [25] et al [26] et al [27] [28] et al [29] et al [30] et al [31] et al [32] [34] et al [35] et al [28] et al [25] et al [18] et al [ [36] et al [37] et al [32] et al [30] et al [38] Figure 6 presents examples of visual results for three different queries on the UKBench dataset. Each row shows the results for the queries that were selected as part of the combination.…”
Section: Resultsmentioning
confidence: 99%
“…Notice that our approaches present effectiveness results superior or comparable to the baselines in the majority of the scenarios. [23] et al [24] et al [25] et al [26] et al [27] [28] et al [29] et al [30] et al [31] et al [32] [34] et al [35] et al [28] et al [25] et al [18] et al [ [36] et al [37] et al [32] et al [30] et al [38] Figure 6 presents examples of visual results for three different queries on the UKBench dataset. Each row shows the results for the queries that were selected as part of the combination.…”
Section: Resultsmentioning
confidence: 99%
“…A brief look at Algorithm 1 reveals a lot of potential for parallelism. For instance, there are three big loops whose bodies could be executed concurrently with almost no interference: (i) authority score loop (lines 7-24); (ii) distance computation loop (lines 25-32); and (iii) sorting loop (lines [33][34][35]. Notice, however, that these loops need to be executed in order: it is not possible to start the distance computation loop before completing the authority score computation loop.…”
Section: Parallelization Strategymentioning
confidence: 99%
“…Diffusion process [18,50] , graph-based learning methods [47] , and iterative re-ranking techniques [36,37] are some approaches proposed in the literature. The intrinsic structure of the datasets has been also exploited by other recent manifold learning methods [2,25,33,34] , yielding significant effectiveness gains in different scenarios.…”
Section: Introductionmentioning
confidence: 99%
“…The KNN algorithm is a widely used classification technique [39][40][41]. It is one of the simplest algorithms as it stocks all available cases and classifies the new ones by similarity measures.…”
Section: Classificationmentioning
confidence: 99%