A clique-based C-CRF denoising of the nearest-neighbor affinity graph improves three graph-based visual re-ranking methods on ROxford and RParis.
2) with k- NN of each database image to ameliorate noisy edges whose vertices are not positive, i.e., similar images
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CV 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Enhancing Visual Re-ranking through Denoising Nearest Neighbor Graph via Continuous CRF
A clique-based C-CRF denoising of the nearest-neighbor affinity graph improves three graph-based visual re-ranking methods on ROxford and RParis.