Indexing in large scale image collections: Scaling properties and benchmark

Authors:
Mohamed Aly;Mario Munich;Pietro Perona
Affiliations:
Computational Vision Lab, Electrical Engineering, Caltech, Pasadena, CA 91125, USA;Evolution Robotics, Pasadena, CA 91106, USA;Computational Vision Lab, Electrical Engineering, Caltech, Pasadena, CA 91125, USA
Venue:
WACV '11 Proceedings of the 2011 IEEE Workshop on Applications of Computer Vision (WACV)
Year:
2011

Citing 0
Cited 3

Approximate all nearest neighbor search for high dimensional entropy estimation for image registration

Signal Processing
An efficient parallel strategy for matching visual self-similarities in large image databases

ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part I
Spider: A system for finding 3D video copies

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Indexing quickly and accurately in a large collection of images has become an important problem with many applications. Given a query image, the goal is to retrieve matching images in the collection. We compare the structure and properties of seven different methods based on the two leading approaches: voting from matching of local descriptors vs. matching histograms of visual words, including some new methods. We derive theoretical estimates of how the memory and computational cost scale with the number of images in the database. We evaluate these properties empirically on four real-world datasets with different statistics. We discuss the pros and cons of the different methods and suggest promising directions for future research.