DocumentCode
2264141
Title
Scaling object recognition: Benchmark of current state of the art techniques
Author
Aly, Mohamed ; Welinder, Peter ; Munich, Mario ; Perona, Pietro
Author_Institution
Comput. Vision Group, Caltech, Pasadena, CA, USA
fYear
2009
fDate
Sept. 27 2009-Oct. 4 2009
Firstpage
2117
Lastpage
2124
Abstract
Scaling from hundreds to millions of objects is the next challenge in visual recognition. We investigate and benchmark the scalability properties (memory requirements, runtime, recognition performance) of the state-of-the-art object recognition techniques: the forest of k-d trees, the locality sensitive hashing (LSH) method, and the approximate clustering procedure with the tf-idf inverted index. The characterization of the images was performed with SIFT features. We conduct experiments on two new datasets of more than 100,000 images each, and quantify the performance using artificial and natural deformations. We analyze the results and point out the pitfalls of each of the compared methodologies suggesting potential new research avenues for the field.
Keywords
cryptography; object recognition; trees (mathematics); approximate clustering procedure; artificial-natural deformations; k-d trees; locality sensitive hashing method; memory requirements; recognition performance; runtime performance; scalability properties; scaling object recognition; visual recognition; Computational efficiency; Computer vision; Image databases; Image recognition; Nearest neighbor searches; Object recognition; Scalability; Spatial databases; Visual databases; Vocabulary;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision Workshops (ICCV Workshops), 2009 IEEE 12th International Conference on
Conference_Location
Kyoto
Print_ISBN
978-1-4244-4442-7
Electronic_ISBN
978-1-4244-4441-0
Type
conf
DOI
10.1109/ICCVW.2009.5457542
Filename
5457542
Link To Document