1 / 22

Advanced Image Retrieval through Bundling Features for Duplicate Web Image Search

This research paper presents a novel approach to large-scale image retrieval focusing on locating near and partial duplicate images in vast web image datasets. Traditional quantization methods of local SIFT descriptors often degrade feature discriminative power and overlook geometric relationships, which are crucial for accurate retrieval. By introducing "bundled features," which combine SIFT and MSER, we enhance the retrieval process. Our method utilizes a hierarchical K-means vocabulary and soft quantization techniques to improve retrieval accuracy while maintaining efficiency. Experimental results highlight the effectiveness of bundled features in overcoming traditional challenges in image search.

inigo
Télécharger la présentation

Advanced Image Retrieval through Bundling Features for Duplicate Web Image Search

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Bundling Features for Large Scale Partial-Duplicate Web Image Search Zhong Wu∗, QifaKe, Michael Isard, and Jian Sun Microsoft Research

  2. Outline • Introduction • Bundled Features • Image Retrieval using Bundled Features • Experimental Results

  3. Introduction Our goal, given a query image, is to locate its near- and partial-duplicate images in a large corpus of web images.

  4. State-of-the-art large scale image retrieval systems have relied on quantizing local SIFT descriptors into visual words, and then applying scalable textual indexing and retrieval schemes. Bag-of-words representations, however: 1. reduce the discriminative power of image features due to feature quantization 2. ignore geometric relationships among visual words.

  5. Geometric verification becomes an important post-processing step for getting a reasonable retrieval precision, especially for low-resolution images. But full geometric verification is computationally expensive. In practice therefore it is only applied to a subset of the top-ranked candidate images. For web image retrieval the number of near or partial duplicates could be large, and applying full geometric verification to only these top-ranked images may not be sufficient for good recall.

  6. Bundled Features • SIFT The discriminative power of the quantized SIFT feature decreases rapidly, resulting in many false positive matches between individual features. • MSER (Maximally Stable Extremal Regions ) False positive matches remain an issue for large image databases. • Bundled Feature = SIFT + MSER

  7. Image Retrieval using Bundled Features • Feature quantization Use hierarchical K means to obtain a vocabulary of one million visual words from a training set of 50 thousand images. Use a k-d tree to organize these visual words for nearest neighbor search during quantization. To reduce quantization error, we use a soft quantization scheme[13] , mapping a descriptor to its n-nearest visual words in the k-d tree. [13] J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman. Lost in quantization: Improving particular object retrieval in large scale image databases. In CVPR, 2008.

  8. K-D Tree pointList = [(2,3), (5,4), (9,6), (4,7), (8,1), (7,2)]

  9. Matching bundled features

  10. Membership term Geometric term

  11. Inverted index • Indexing and retrieval

  12. Voting TF-IDF

  13. Experimental Results

  14. Re-ranking

  15. Impact of λ Runtime

  16. Conclusion • Bundled features are more discriminative than individual SIFT features. • They allow us to enforce simple and robust geometric constraints at the bundle level.

More Related