Abstract
In this paper, we address the problem of efficient k-NN classification. In particular, in the context of Mahalanobis metric learning. Mahalanobis metric learning recently demonstrated competitive results for a variety of tasks. However, such approaches have two main drawbacks. First, learning metrics requires often to solve complex and thus computationally very expensive optimization problems. Second, as the evaluation time linearly scales with the size of the data k-NN becomes cumbersome for large-scale problems or real-time applications with limited time budget. To overcome these problems, we propose a metric-based hashing strategy, allowing for both, efficient learning and evaluation. In particular, we adopt an efficient metric learning method for local sensitive hashing that recently demonstrated reasonable results for several large-scale benchmarks. In fact, if the intrinsic structure of the data is exploited by the metric in a meaningful way, using hashing we can compact the feature representation still obtaining competitive results. This leads to a drastically reduced evaluation effort. Results on a variety of challenging benchmarks with rather diverse nature demonstrate the power of our method. These include standard machine learning datasets as well as the challenging Public Figures Face Database. On the competitive machine learning benchmarks we obtain results comparable to the state-of-the-art Mahalanobis metric learning and hashing approaches. On the face benchmark we clearly outperform the state-of-the-art in Mahalanobis metric learning. In both cases, however, with drastically reduced evaluation effort.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Campo, T.E., Babu, B.R., Varma, M.: Character Recognition in Natural Images. In: Proc. VISAPP (2009)
Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: ACM Symposium on Theory of Computing (2002)
Crammer, K., Gilad-bachrach, R., Navot, A., Tishby, N.: Margin analysis of the LVQ algorithm. In: Advances NIPS (2002)
Davis, J.V., Kulis, B., Jain, P., Sra, S., Dhillon, I.S.: Information-theoretic metric learning. In: Proc. ICML (2007)
Frank, A., Asuncion, A.: UCI machine learning repository, university of California, Irvine, School of Information and Computer Sciences (2010), http://archive.ics.uci.edu/ml
Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proc. Very Large Data Bases (1999)
Guillaumin, M., Verbeek, J., Schmid, C.: Is that you? Metric learning approaches for face identification. In: Proc. ICCV (2009)
Heo, J.P., Lee, Y., He, J., Chang, S.F., Yoon, S.E.: Spherical hashing. In: Proc. CVPR (2012)
Hirzer, M., Roth, P.M., Köstinger, M., Bischof, H.: Relaxed pairwise learned metric for person re-identification. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part VI. LNCS, vol. 7577, pp. 780–793. Springer, Heidelberg (2012)
Jain, P., Kulis, B., Grauman, K.: Fast image search for learned metrics. In: Proc. CVPR (2008)
Köstinger, M., Hirzer, M., Wohlhart, P., Roth, P.M., Bischof, H.: Large scale metric learning from equivalence constraints. In: Proc. CVPR (2012)
Köstinger, M., Roth, P.M., Bischof, H.: Synergy-based learning of facial identity. In: Pinz, A., Pock, T., Bischof, H., Leberl, F. (eds.) DAGM and OAGM 2012. LNCS, vol. 7476, pp. 195–204. Springer, Heidelberg (2012)
Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing. Trans. PAMI (2012)
Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scalable image search. In: Proc. ICCV (2009)
Kumar, N., Berg, A.C., Belhumeur, P.N., Nayar, S.K.: Attribute and Simile Classifiers for Face Verification. In: Proc. ICCV (2009)
Norouzi, M., Punjani, A., Fleet, D.J.: Fast search in hamming space with multi-index hashing. In: Proc. CVPR (2012)
Shen, C.: Non-sparse linear representations for visual tracking with online reservoir metric learning. In: Proc. CVPR (2012)
Vedaldi, A., Zisserman, A.: Efficient additive kernels via explicit feature maps. Trans. PAMI 34(3) (2011)
Weinberger, K.Q., Blitzer, J., Saul, L.K.: Distance metric learning for large margin nearest neighbor classification. In: Advances NIPS (2006)
Weinberger, K.Q., Saul, L.K.: Fast solvers and efficient implementations for distance metric learning. In: Proc. ICML (2008)
Weiss, Y., Fergus, R., Torralba, A.: Multidimensional spectral hashing. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part V. LNCS, vol. 7576, pp. 340–353. Springer, Heidelberg (2012)
Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: Advances NIPS (2008)
Ye, J., Zhao, Z., Liu, H.: Adaptive distance metric learning for clustering. In: Proc. CVPR (2007)
Zhang, Z., Sturgess, P., Sengupta, S., Crook, N., Torr, P.H.S.: Efficient discriminative learning of parametric nearest neighbor classifiers. In: Proc. CVPR (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Köstinger, M., Roth, P.M., Bischof, H. (2013). Efficient Retrieval for Large Scale Metric Learning. In: Weickert, J., Hein, M., Schiele, B. (eds) Pattern Recognition. GCPR 2013. Lecture Notes in Computer Science, vol 8142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40602-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-40602-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40601-0
Online ISBN: 978-3-642-40602-7
eBook Packages: Computer ScienceComputer Science (R0)