Skip to main content

Scaling Up a Metric Learning Algorithm for Image Recognition and Representation

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 5359))

Abstract

Maximally Collapsing Metric Learning is a recently proposed algorithm to estimate a metric matrix from labelled data. The purpose of this work is to extend this approach by considering a set of landmark points which can in principle reduce the cost per iteration in one order of magnitude. The proposal is in fact a generalized version of the original algorithm that can be applied to larger amounts of higher dimensional data. Exhaustive experimentation shows that very similar behavior at a lower cost is obtained for a wide range of the number of landmark points used.

This work has been partially funded by FEDER and Spanish MEC through projects DPI2006-15542-C04-04 and Consolider Ingenio 2010 CSD2007-00018.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. John Wiley and Sons, Chichester (2001)

    MATH  Google Scholar 

  2. Jain, A.K., Duin, R.P.W., Mao, J.: Statistical pattern recognition: A review. IEEE Trans. Pattern Anal. Mach. Intell. 22, 4–37 (2000)

    Article  Google Scholar 

  3. Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, London (1990)

    MATH  Google Scholar 

  4. Turk, M., Pentland, A.: Eigenfaces for recognition. Journal of Cognitive Neuroscience 3, 71–86 (1991)

    Article  Google Scholar 

  5. Belhumeur, P.N., Hespanha, J.P., Kriegman, D.J.: Eigenfaces vs. fisherfaces: Recognition using class specific linear projection. IEEE Trans. Pattern Anal. Mach. Intell. 19, 711–720 (1997)

    Article  Google Scholar 

  6. Chen, L., Liao, H.M., Ko, M., Lin, J., Yu, G.: A new LDA-based face recognition system which can solve the small sample size problem. Pattern Recognition 33, 1713–1726 (2000)

    Article  Google Scholar 

  7. Cevikalp, H., Neamtu, M., Wilkes, M., Barkana, A.: Discriminative common vectors for face recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 27, 4–13 (2005)

    Article  Google Scholar 

  8. Scholkopf, B., Smola, A.: Learning with Kernels. MIT Press, Cambridge (2002)

    MATH  Google Scholar 

  9. Cevikalp, H., Neamtu, M., Wilkes, M.: Discriminative common vector method with kernels. IEEE Transactions on Neural Networks 17, 1550–1565 (2006)

    Article  Google Scholar 

  10. Xing, E.P., Ng, A.Y., Jordan, M.I., Russell, S.J.: Distance metric learning with application to clustering with side-information. In: NIPS, pp. 505–512 (2002)

    Google Scholar 

  11. Paredes, R., Vidal, E.: Learning weighted metrics to minimize nearest-neighbor classification error. IEEE Trans. Pattern Anal. Mach. Intell. 28, 1100–1110 (2006)

    Article  Google Scholar 

  12. Yu, J., Amores, J., Sebe, N., Radeva, P., Tian, Q.: Distance learning for similarity estimation. IEEE Trans. Pattern Anal. Mach. Intell. 30, 451–462 (2008)

    Article  Google Scholar 

  13. Globerson, A., Roweis, S.: Metric learning by collapsing classes. Neural Information Processing Systems (NIPS 2005) 18, 451–458 (2005)

    Google Scholar 

  14. Woznica, A., Kalousis, A., Hilario, M.: Learning to combine distances for complex representations. In: ICML, pp. 1031–1038 (2007)

    Google Scholar 

  15. Micó, L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating search algorithm (aesa) with linear preprocessing time and memory requirements. Pattern Recognition Letters 15, 9–17 (1994)

    Article  Google Scholar 

  16. Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2323 (2000)

    Article  Google Scholar 

  17. Asuncion, D.N.A.: UCI machine learning repository (2007)

    Google Scholar 

  18. Martinez, A., Benavente, R.: The AR face database. Technical Report 24, Computer Vision Center, Barcelona (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perez-Suay, A., Ferri, F.J. (2008). Scaling Up a Metric Learning Algorithm for Image Recognition and Representation. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2008. Lecture Notes in Computer Science, vol 5359. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89646-3_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89646-3_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89645-6

  • Online ISBN: 978-3-540-89646-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics