Papers › Distinctive Interest Point Selection for Efficient Near-duplicate Image Retrieval
Distinctive Interest Point Selection for Efficient Near-duplicate Image Retrieval
Burak Yildiz, M. Fatih Demirci
Distinctive subset of the interest points creation for near-duplicate image retrieval is significant in two terms. The former is that the query time decreases reasonably. The latter is that using the distinctive subsets performs better than the ordinary subsets. In this paper, we focus on the creation of such subsets for effective near-duplicate retrieval and propose a novel interest point selection method. In this method, the distinctive subset is created with a ranking according to a density map calculated from the interest points. We examined a number of experiments to show the performance of the proposed method and we got a convincing result of 95.46% recall while the precision is still 96.04%.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections