Skip to main content

Pixel-to-Pixel Matching for Image Recognition Using Hungarian Graph Matching

  • Conference paper
Pattern Recognition (DAGM 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3175))

Included in the following conference series:

Abstract

A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suitable constraints. In this paper, we present an extension of a zero-order matching model called the image distortion model that yields state-of-the-art classification results for different tasks. We include the constraint that in the matching process each pixel of both compared images must be matched at least once. The optimal matching under this constraint can be determined using the Hungarian algorithm. The additional constraint leads to more homogeneous displacement fields in the matching. The method reduces the error rate of a nearest neighbor classifier on the well known USPS handwritten digit recognition task from 2.4% to 2.2%.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Belongie, S., Malik, J., Puzicha, J.: Shape Matching and Object Recognition Using Shape Contexts. IEEE Trans. Pattern Analysis and Machine Intelligence 24(4), 509–522 (2002)

    Article  Google Scholar 

  2. Dong, J.X., Krzyzak, A., Suen, C.Y.: A Practical SMO Algorithm. In: Proc. Int. Conf. on Pattern Recognition, Quebec City, Canada (August 2002)

    Google Scholar 

  3. Keijsper, J., Pendavingh, R.: An Efficient Algorithm for Minimum-Weight Bibranching. Technical Report 96-12, Amsterdam Univ., Amsterdam, The Netherlands (1996)

    Google Scholar 

  4. Keysers, D., Paredes, R., Ney, H., Vidal, E.: Combination of Tangent Vectors and Local Representations for Handwritten Digit Recognition. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol. 2396, pp. 538–547. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Keysers, D., Gollan, C., Ney, H.: Classification of Medical Images using Non-linear Distortion Models. In: Proc. BVM 2004, Bildverarbeitung für die Medizin, Berlin, Germany, March 2004, pp. 366–370 (2004)

    Google Scholar 

  6. Keysers, D., Gollan, C., Ney, H.: Local Context in Non-linear Deformation Models for Handwritten Character Recognition. In: ICPR 2004, 17th Int. Conf. on Pattern Recognition, Cambridge, UK (August 2004) (in press)

    Google Scholar 

  7. Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  8. Schölkopf, B., Simard, P., Smola, A., Vapnik, V.: Prior Knowledge in Support Vector Kernels. In: Advances in Neural Information Processing Systems 10, pp. 640–646. MIT Press, Cambridge (1998)

    Google Scholar 

  9. Wiskott, L., Fellous, J., Krüger, N., Malsburg, C.v.d.: Face Recognition by Elastic Bunch Graph Matching. IEEE Trans. Pattern Analysis and Machine Intelligence 19(7), 775–779 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Keysers, D., Deselaers, T., Ney, H. (2004). Pixel-to-Pixel Matching for Image Recognition Using Hungarian Graph Matching. In: Rasmussen, C.E., Bülthoff, H.H., Schölkopf, B., Giese, M.A. (eds) Pattern Recognition. DAGM 2004. Lecture Notes in Computer Science, vol 3175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28649-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28649-3_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22945-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics