Scaling object recognition: Benchmark of current state of the art techniques

2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009

Volumn , Issue , 2009, Pages 2117-2124

  Aly, Mohamed ^a   Welinder, Peter ^a   Munich, Mario ^b   Perona, Pietro ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b Evolution Robotics Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING PROCEDURE; DATA SETS; INVERTED INDICES; K-D TREE; LOCALITY SENSITIVE HASHING; MEMORY REQUIREMENTS; RECOGNITION PERFORMANCE; RUNTIMES; SIFT FEATURE; STATE OF THE ART; VISUAL RECOGNITION;

COMPUTER VISION;

OBJECT RECOGNITION;

EID: 77953220593     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCVW.2009.5457542     Document Type: Conference Paper

References (20)

1. A. Andoni and P. Indyk. E2lsh: Exact euclidian locality-sensitive hashing, 2004. http://web.mit.edu/andoni/www/LSH.
2. S. Arya, D. Mount, N. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45:891-923, 1998.
3. O. Chum, J. Philbin, J. Sivic, M. Isard, and A. Zisserman. Total recall: Automatic query expansion with a generative feature model for object retrieval. In ICCV, 2007.
4. O. Chum, J. Philbin, and A. Zisserman. Near duplicate image detection: minhash and tf-idf weighting. In BMVC, 2008.
5. T. Darrell, P. Indyk, and G. Shakhnarovich, editors. Nearest Neighbor Methods in Learning and Vision: Theory and Practice. MIT Press, 2006.
6. J. Friedman, J. Bentley, and R. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Trans. on Mathematical Software, 3:209-226, 1977.
7. P. Indyk and R. Motwani. Approximate nearest neighbor: Towards removing the curse of dimensionality. In Symposium on Theory of Computing, 1998.
8. H. Jegou, M. Douze, and C. Schmid. Hamming embedding and weak geometric consistency for large scale image search. In ECCV, volume I, pages 304-317, oct 2008.
9. H. Jegou, H. Harzallah, and C. Schmid. A contextual dissimilarity measure for accurate and efficient image search. In CVPR, 2007.
10. V. Lepetit, P. Lagger, and P. Fua. Randomized trees for real-time keypoint recognition. In CVPR, pages 775-781, 2005.
11. D. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 60:91-110, 2004.
12. M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In Int. Conf. on Comp. Vision Theory and Applications, 2009.
13. M. Munich, P. Pirjanian, E. Di Bernardo, L. Goncalves, N. Karlsson, and D. Lowe. Application of Visual Pattern Recognition to Robotics and Automation. IEEE Robotics & Automation Magazine, pages 72-77, 2006.
14. D. Nistér and H. Stewénius. Scalable recognition with a vocabulary tree. In CVPR, volume 2, pages 2161-2168, June 2006.
15. J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman. Object retrieval with large vocabularies and fast spatial matching. In CVPR, 2007.
16. 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.
17. G. Schindler, M. Brown, and R. Szeliski. City-scale location recognition. In CVPR, Minneapolis, June 2007.
18. J. Sivic and A. Zisserman. Video Google: A text retrieval approach to object matching in videos. In ICCV, 2003.
19. A. Torralba, R. Fergus, and Y. Weiss. Small codes and large databases for recognition. In CVPR, 2008.
20. A. Vedaldi and B. Fulkerson. VLFeat: An open and portable library of computer vision algorithms. http://www.vlfeat.org/, 2008.