Kernelized locality-sensitive hashing for scalable image search

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2009, Pages 2130-2137

  Kulis, Brian ^a   Grauman, Kristen ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA-DRIVEN; DISTANCE FUNCTIONS; EMBEDDINGS; EXISTING METHOD; FEATURE EMBEDDING; FEATURE MATCHING; HAMMING SPACE; HIGH-DIMENSIONAL; IMAGE-BASED; KERNEL FUNCTION; LARGE-SCALE DATASETS; LINEAR TIME; LOCALITY SENSITIVE HASHING; OBJECT CLASSIFICATION; RETRIEVAL METHODS; SCALABLE IMAGE; SIMILARITY FUNCTIONS; SIMILARITY SEARCH; VISION APPLICATIONS;

CLASSIFICATION (OF INFORMATION); COMPUTER VISION; CONTENT BASED RETRIEVAL; HAMMING DISTANCE;

INFORMATION RETRIEVAL;

EID: 77953184849     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2009.5459466     Document Type: Conference Paper

References (34)

1. V. Athitsos, J. Alon, S. Sclaroff, and G. Kollios. BoostMap: A Method for Efficient Approximate Similarity Rankings. In CVPR, 2004.
2. J. Beis and D. Lowe. Shape Indexing Using Approximate Nearest-Neighbour Search in High Dimensional Spaces. In CVPR, 1997.
3. M. Charikar. Similarity Estimation Techniques from Rounding Algorithms. In ACM Symposium on Theory of Computing, 2002.
4. O. Chum, J. Philbin, and A. Zisserman. Near Duplicate Image Detection: minhash and tf-idf Weighting. In BMVC, 2008.
5. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In Proc Int'l Conf on Very Large Data Bases, Aug. 1997.
6. M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni. Locality-Sensitive Hashing Scheme Based on p-Stable Distributions. In Symposium on Computational Geometry (SOCG), 2004.
7. J. Davis, B. Kulis, P. Jain, S. Sra, and I. Dhillon. Information- Theoretic Metric Learning. In ICML, 2007.
8. L. Fei-Fei, R. Fergus, and P. Perona. Learning Generative Visual Models from Few Training Examples: an Incremental Bayesian Approach Tested on 101 Object Cateories. In Workshop on Generative Model Based Vision, Washington, D.C., June 2004.
9. J. Freidman, J. Bentley, and A. Finkel. An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Transactions on Mathematical Software, 3(3):209-226, September 1977.
10. A. Gionis, P. Indyk, and R.Motwani. Similarity Search in High Dimensions via Hashing. In Proceedings of the 25th International Conference on Very Large Data Bases, 1999.
11. M. Goemans and D. Williamson. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. JACM, 42(6):1115-1145, 1995.
12. K. Grauman and T. Darrell. Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences. In CVPR, 2007.
13. J. Hoffmann-Jorgensen and G. Pisier. The Law of Large Numbers and the Central Limit Theorem in Banach Spaces. Ann. Probability, 4:587-599, 1976.
14. G. Hua, M. Brown, and S. Winder. Discriminant Embedding for Local Image Descriptors. In ICCV, 2007.
15. P. Indyk and R. Motwani. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In 30th Symposium on Theory of Computing (STOC), 1998.
16. P. Jain, B. Kulis, and K. Grauman. Fast Image Search for Learned Metrics. In CVPR, 2008.
17. H. Ling and S. Soatto. Proximity Distribution Kernels for Geometric Context in Category Recognition. In ICCV, 2007.
18. D. Nister and H. Stewenius. Scalable Recognition with a Vocabulary Tree. In CVPR, 2006.
19. S. Obdrzalek and J. Matas. Sub-linear Indexing for Large Scale Object Recognition. In BMVC, 2005.
20. A. Rahimi and B. Recht. Random Features for Large-Scale Kernel Machines. In NIPS, 2007.
21. J. Rice. Mathematical Statistics and Data Aanalysis. Duxbury Press, 2001.
22. R. Salakhutdinov and G. Hinton. Semantic Hashing. In ACM SIGIR, 2007.
23. B. Schölkopf, A. Smola, and K.-R. Müller. Nonlinear Component Analysis as a Kernel Eigenvalue Problem. Neural Computation, 10:1299-1319, 1998. (Pubitemid 128463674)
24. G. Shakhnarovich, T. Darrell, and P. Indyk, editors. Nearest-Neighbor Methods in Learning and Vision: Theory and Practice. The MIT Press, 2006.
25. G. Shakhnarovich, P. Viola, and T. Darrell. Fast Pose Estimation with Parameter-Sensitive Hashing. In ICCV, 2003.
26. N. Snavely, S. Seitz, and R. Szeliski. Photo Tourism: Exploring Photo Collections in 3D. In SIGGRAPH, 2006.
27. A. Torralba, R. Fergus, and W. T. Freeman. 80 Million Tiny Images: A Large Dataset for Non-Parametric Object and Scene Recognition. TPAMI, 30(11):1958-1970, 2008.
28. A. Torralba, R. Fergus, and Y. Weiss. Small Codes and Large Image Databases for Recognition. In CVPR, 2008.
29. J. Uhlmann. Satisfying General Proximity / Similarity Queries with Metric Trees. Information Processing Letters, 40:175-179, 1991.
30. M. Varma and D. Ray. Learning the Discriminative Power-Invariance Trade-Off. In ICCV, 2007.
31. Y. Weiss, A. Torralba, and R. Fergus. Spectral Hashing. In NIPS, 2009.
32. J. Yang, X. Gao, D. Zhang, and J. Yang. Kernel ICA: An Alternative Formulation and its Application to Face Recognition. Pattern Recognition, 38(10):1784-1787, October 2005.
33. H. Zhang, A. Berg, M. Maire, and J. Malik. SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition. In CVPR, 2006.
34. J. Zhang, M. Marszalek, S. Lazebnik, and C. Schmid. Local Features and Kernels for Classification of Texture and Object Categories: A Comprehensive Study. IJCV, 73(2):213-238, 2007.