The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2012 vol.34)
pp: 1092-1104
Brian Kulis , University of California at Berkeley, Berkeley
Kristen Grauman , University of Texas at Austin, Austin
ABSTRACT
Fast retrieval methods are critical for many large-scale and data-driven vision applications. Recent work has explored ways to embed high-dimensional features or complex distance functions into a low-dimensional Hamming space where items can be efficiently searched. However, existing methods do not apply for high-dimensional kernelized data when the underlying feature embedding for the kernel is unknown. We show how to generalize locality-sensitive hashing to accommodate arbitrary kernel functions, making it possible to preserve the algorithm's sublinear time similarity search guarantees for a wide class of useful similarity functions. Since a number of successful image-based kernels have unknown or incomputable embeddings, this is especially valuable for image retrieval tasks. We validate our technique on several data sets, and show that it enables accurate and fast performance for several vision problems, including example-based object classification, local feature matching, and content-based retrieval.
INDEX TERMS
Similarity search, locality-sensitive hashing, central limit theorem, Kernel methods, image search.
CITATION
Brian Kulis, Kristen Grauman, "Kernelized Locality-Sensitive Hashing", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.34, no. 6, pp. 1092-1104, June 2012, doi:10.1109/TPAMI.2011.219
REFERENCES
[1] G. Shakhnarovich, P. Viola, and T. Darrell, "Fast Pose Estimation with Parameter-Sensitive Hashing," Proc. IEEE Int'l Conf. Computer Vision, 2003.
[2] Nearest-Neighbor Methods in Learning and Vision: Theory and Practice, G. Shakhnarovich, T. Darrell, and P. Indyk, eds. The MIT Press, 2006.
[3] K. Grauman and T. Darrell, "Pyramid Match Hashing: Sub-Linear Time Indexing over Partial Correspondences," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2007.
[4] P. Jain, B. Kulis, and K. Grauman, "Fast Image Search for Learned Metrics," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2008.
[5] O. Chum, J. Philbin, and A. Zisserman, "Near Duplicate Image Detection: Min-Hash and tf-idf Weighting," Proc. British Machine Vision Conf., 2008.
[6] A. Gionis, P. Indyk, and R. Motwani, "Similarity Search in High Dimensions via Hashing," Proc. 25th Int'l Conf. Very Large Data Bases, 1999.
[7] M. Charikar, "Similarity Estimation Techniques from Rounding Algorithms," Proc. ACM Symp. Theory of Computing, 2002.
[8] V. Athitsos, J. Alon, S. Sclaroff, and G. Kollios, "BoostMap: A Method for Efficient Approximate Similarity Rankings," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2004.
[9] A. Torralba, R. Fergus, and Y. Weiss, "Small Codes and Large Image Databases for Recognition," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2008.
[10] R. Salakhutdinov and G. Hinton, "Semantic Hashing," Proc. Int'l ACM SIGIR Conf. Research and Development in Information Retrieval, 2007.
[11] Y. Weiss, A. Torralba, and R. Fergus, "Spectral Hashing," Proc. Advances in Neural Information Processing Systems, 2009.
[12] H. Zhang, A. Berg, M. Maire, and J. Malik, "SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2006.
[13] J. Zhang, M. Marszalek, S. Lazebnik, and C. Schmid, "Local Features and Kernels for Classification of Texture and Object Categories: A Comprehensive Study," Int'l J. Computer Vision, vol. 73, no. 2, pp. 213-238, 2007.
[14] M. Varma and D. Ray, "Learning the Discriminative Power-Invariance Trade-Off," Proc. IEEE Int'l Conf. Computer Vision, 2007.
[15] J. Rice, Mathematical Statistics and Data Analysis. Duxbury Press, 2001.
[16] L. Fei-Fei, R. Fergus, and P. Perona, "Learning Generative Visual Models from Few Training Examples: An Incremental Bayesian Approach Tested on 101 Object Categories," Proc. Workshop Generative Model Based Vision, June 2004.
[17] N. Snavely, S. Seitz, and R. Szeliski, "Photo Tourism: Exploring Photo Collections in 3D," Proc. Siggraph, 2006.
[18] G. Hua, M. Brown, and S. Winder, "Discriminant Embedding for Local Image Descriptors," Proc. IEEE Int'l Conf. Computer Vision, 2007.
[19] A. Torralba, R. Fergus, and W.T. Freeman, "80 Million Tiny Images: A Large Data Set for Nonparametric Object and Scene Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 30, no. 11, pp. 1958-1970, Nov. 2008.
[20] M. Raginsky and S. Lazebnik, "Locality Sensitive Binary Codes from Shift-Invariant Kernels," Proc. Advances in Neural Information Processing Systems, 2009.
[21] J. Freidman, J. Bentley, and A. Finkel, "An Algorithm for Finding Best Matches in Logarithmic Expected Time," ACM Trans. Math. Software, vol. 3, no. 3, pp. 209-226, Sept. 1977.
[22] D. Nister and H. Stewenius, "Scalable Recognition with a Vocabulary Tree," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2006.
[23] S. Obdrzalek and J. Matas, "Sub-Linear Indexing for Large Scale Object Recognition," Proc. British Machine Vision Conf., 2005.
[24] J. Beis and D. Lowe, "Shape Indexing Using Approximate Nearest-Neighbour Search in High Dimensional Spaces," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 1997.
[25] J. Uhlmann, "Satisfying General Proximity/Similarity Queries with Metric Trees," Information Processing Letters, vol. 40, pp. 175-179, 1991.
[26] P. Ciaccia, M. Patella, and P. Zezula, "M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces," Proc. Int'l Conf. Very Large Data Bases, Aug. 1997.
[27] P. Indyk and R. Motwani, "Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality," Proc. 30th Symp. Theory of Computing, 1998.
[28] M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni, "Locality-Sensitive Hashing Scheme Based on p-Stable Distributions," Proc. Symp. Computational Geometry, 2004.
[29] A. Andoni, "Nearest Neighbor Search: The Old, the New, and the Impossible," PhD dissertation, MIT, 2009.
[30] A. Broder, "On the Resemblance and Containment of Documents," Proc. Compression and Complexity of Sequences, 1997.
[31] A. Rahimi and B. Recht, "Random Features for Large-Scale Kernel Machines," Proc. Advances in Neural Information Processing Systems, 2007.
[32] M. Balcan, A. Blum, and S. Vempala, "Kernels as Features: On Kernels, Margins, and Low-Dimensional Mappings," Machine Learning, vol. 65, no. 1, pp. 79-94, 2006.
[33] M. Goemans and D. Williamson, "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming," J. ACM, vol. 42, no. 6, pp. 1115-1145, 1995.
[34] B. Schölkopf, A. Smola, and K.-R. Müller, "Nonlinear Component Analysis as a Kernel Eigenvalue Problem," Neural Computation, vol. 10, pp. 1299-1319, 1998.
[35] J. Hoffmann-Jorgensen and G. Pisier, "The Law of Large Numbers and the Central Limit Theorem in Banach Spaces," Ann. Probability, vol. 4, pp. 587-599, 1976.
[36] J. Yang, X. Gao, D. Zhang, and J. Yang, "Kernel ICA: An Alternative Formulation and Its Application to Face Recognition," Pattern Recognition, vol. 38, no. 10, pp. 1784-1787, Oct. 2005.
[37] K. Grauman and T. Darrell, "The Pyramid Match Kernel: Discriminative Classification with Sets of Image Features," Proc. IEEE Int'l Conf. Computer Vision, 2005.
[38] H. Ling and S. Soatto, "Proximity Distribution Kernels for Geometric Context in Category Recognition," Proc. IEEE Int'l Conf. Computer Vision, 2007.
[39] B. Kulis, P. Jain, and K. Grauman, "Fast Similarity Search for Learned Metrics," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 12, pp. 2143-2157, Dec. 2009.
[40] J. Davis, B. Kulis, P. Jain, S. Sra, and I. Dhillon, "Information-Theoretic Metric Learning," Proc. Int'l Conf. Machine Learning, 2007.
[41] L.W. Renninger and J. Malik, "When Is Scene Recognition Just Texture Recognition?" Vision Research, vol. 44, pp. 2301-2311, 2004.
[42] J. Zhang, M. Marszalek, S. Lazebnik, and C. Schmid, "Local Features and Kernels for Classification of Texture and Object Categories: A Comprehensive Study," Int'l J. Computer Vision, vol. 73, no. 2, pp. 213-238, 2007.
[43] I. Laptev, M. Marszalek, C. Schmid, and B. Rozenfeld, "Learning Realistic Human Actions from Movies," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2008.
[44] K. Mikolajczyk and C. Schmid, "Scale and Affine Invariant Interest Point Detectors," Int'l J. Computer Vision, vol. 1, no. 60, pp. 63-86, Oct. 2004.
[45] J. Matas, O. Chum, M. Urban, and T. Pajdla, "Robust Wide Baseline Stereo from Maximally Stable Extremal Regions," Proc. British Machine Vision Conf., 2002.
[46] D. Lowe, "Distinctive Image Features from Scale-Invariant Keypoints," Int'l J. Computer Vision, vol. 60, no. 2, pp. 91-110, 2004.
[47] B. Kulis and K. Grauman, "Kernelized Locality-Sensitive Hashing for Scalable Image Search," Proc. IEEE Int'l Conf. Computer Vision, 2009.
[48] T. Anderson and D. Darling, "Asymptotic Theory of Certain "Goodness-of-Fit" Criteria Based on Stochastic Processes," Annals of Math. Statistics, vol. 23, no. 2, pp. 193-212, 1952.
[49] B. Kulis and T. Darrell, "Learning to Hash with Binary Reconstructive Embeddings," Proc. Advances in Neural Information Processing Systems, 2009.
76 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool