Sciweavers

Share
ADC
2007
Springer

Pruning SIFT for Scalable Near-duplicate Image Matching

12 years 6 months ago
Pruning SIFT for Scalable Near-duplicate Image Matching
The detection of image versions from large image collections is a formidable task as two images are rarely identical. Geometric variations such as cropping, rotation, and slight photometric alteration are unsuitable for content-based retrieval techniques, whereas digital watermarking techniques have limited application for practical retrieval. Recently, the application of Scale Invariant Feature Transform (SIFT) interest points to this domain have shown high effectiveness, but scalability remains a problem due to the large number of features generated for each image. In this work, we show that for this application domain, the SIFT interest points can be dramatically pruned to effect large reductions in both memory requirements and query run-time, with almost negligible loss in effectiveness. We demonstrate that, unlike using the original SIFT features, the pruned features scales better for collections containing hundreds of thousands of images.
Jun Jie Foo, Ranjan Sinha
Added 06 Jun 2010
Updated 06 Jun 2010
Type Conference
Year 2007
Where ADC
Authors Jun Jie Foo, Ranjan Sinha
Comments (0)
books