Skip to main content

Correspondence Problems

  • Chapter
  • First Online:
Book cover Optimization for Computer Vision

Part of the book series: Advances in Computer Vision and Pattern Recognition ((ACVPR))

  • 3528 Accesses

Abstract

Quite numerous computer vision applications require an assignment of the elements of a set of some extracted salient positions/descriptors to their corresponding counterpart in a model set, at some point of their proceeding. Examples are object recognition or image registration schemes. Because an exhaustive evaluation of all possible combinations of individual assignments is infeasible in terms of runtime, more sophisticated approaches are required, and some of them will be presented in this chapter. Possible ways of speeding up the search are applying heuristics, as done in the so-called search tree, or iterative approaches like the iterative closest point method. A typical challenge when trying to find the correct correspondences is the existence of a quite large number of outliers, e.g., positions being spoiled by gross errors. The straightforward approach of minimizing total deviations runs into difficulties in that cases, and consequently, methods being more robust to outliers are required. Examples of robust schemes are the random sample consensus (RANSAC) or methods transforming the problem into a graph representation, such as spectral graph matching or bipartite graph matching as done in the so-called Hungarian algorithm.

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Belongie S, Malik J, Puzicha J (2002) Shape matching and object recognition using shape contexts. IEEE Trans Pattern Anal Mach Intell 24(4):509–522

    Article  Google Scholar 

  2. Besl PJ, McKay ND (1992) A method for registration of 3-D shapes. IEEE Trans Pattern Anal Mach Intell 14(2):239–256

    Article  Google Scholar 

  3. Choi S, Kim T, Yu W (2009) Performance evaluation of RANSAC family. In: Proceedings of the British machine vision conference, London, pp 81.1–81.12

    Google Scholar 

  4. Duchenne O, Bach F, Kweon I-S, Ponce J (2011) A tensor-based algorithm for high-order graph matching. IEEE Trans Pattern Anal Mach Intell 33:2383–2395

    Article  Google Scholar 

  5. Egozi A, Keller Y, Guterman H (2013) A probabilistic approach to spectral graph matching. IEEE Trans Pattern Anal Mach Intell 35(1):18–27

    Article  Google Scholar 

  6. Fishler MA, Bolles RC (1981) Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Mag Commun ACM 24(6):381–395

    Article  Google Scholar 

  7. Fitzgibbon AW (2003) Robust registration of 2D and 3D point sets. Image Vis Comput 21(13–14):1145–1153

    Article  Google Scholar 

  8. Harris C, Stephens M (1988) A combined corner and edge detector. In: Alvey vision conference, Manchester, pp 147–151

    Google Scholar 

  9. Hartley R, Zisserman A (2004) Multiple view geometry in computer vision, 2nd edn. Cambridge University Press, Cambridge. ISBN 978–0521540513

    Book  MATH  Google Scholar 

  10. Jain V, Zhang H (2006) Robust 3D shape correspondence in the spectral domain. IEEE Int Conf Shape Model Appl 118–129

    Google Scholar 

  11. Jonker R, Volgenant A (1987) A shortest augmenting path algorithm for dense and sparse linear assignment problems. J Comput 38:325–340

    Article  MathSciNet  MATH  Google Scholar 

  12. Kuhn HW (1955) The Hungarian method for the assignment problem. Nav Res Logist Q 2:83–87

    Article  Google Scholar 

  13. Leordeanu M, Herbert M (2005) A spectral technique for correspondence problems using pairwise constraints. In: Proceedings of the 10th IEEE international conference on computer vision, vol 2, Beijing, pp 1482–1489

    Google Scholar 

  14. Lowe DG (2004) Distinctive image features from scale-invariant viewpoints. Int J Comput Vis 60:91–111

    Article  Google Scholar 

  15. Marquardt D (1963) An algorithm for least-squares estimation of nonlinear parameters. SIAM J Appl Math 11(2):431–441

    Article  MathSciNet  MATH  Google Scholar 

  16. Mikolajczyk K, Schmid C (2005) A performance evaluation of local descriptors. IEEE Trans Pattern Anal Mach Intell 27(10):1615–1630

    Article  Google Scholar 

  17. Mikolajczyk K, Tuytelaars T, Schmid C, Zisserman A, Matas J, Schaffalitzky F, Kadir T, Van Gool L (2005) A comparison of affine region detectors. Int J Comput Vis 65:43–72

    Article  Google Scholar 

  18. Munkres J (1957) Algorithms for assignment and transportation problems. J Soc Ind Appl Math 5(1):32–38

    Article  MathSciNet  MATH  Google Scholar 

  19. Rubner Y, Tomasi C, Leonidas JG (2000) The earth mover’s distance as a metric for image retrieval. Int J Comput Vis 40(2):99–121

    Article  MATH  Google Scholar 

  20. Rummel P, Beutel W (1984) Workpiece recognition and inspection by a model-based scene analysis system. Pattern Recognit 17(1):141–148

    Article  Google Scholar 

  21. Sahilloglu Y, Yemez Y (2012) Minimum-distortion isometric shape correspondence using EM algorithm. IEEE Trans Pattern Anal Mach Intell 34(11):2203–2215

    Article  Google Scholar 

  22. Schmid C, Mohr R (1997) Local grey value invariants for image retrieval. IEEE Trans Pattern Anal Mach Intell 19:530–535

    Article  Google Scholar 

  23. Trefethen LN, Bau D (1997) Numerical linear algebra. Society for Industrial and Applied Mathematics, Philadelphia. ISBN 978-0898713619

    Book  MATH  Google Scholar 

  24. Treiber M (2010) An introduction to object recognition – selected algorithms for a wide variety of applications. Springer, London. ISBN 978–1849962346

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Treiber, M.A. (2013). Correspondence Problems. In: Optimization for Computer Vision. Advances in Computer Vision and Pattern Recognition. Springer, London. https://doi.org/10.1007/978-1-4471-5283-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-5283-5_5

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-5282-8

  • Online ISBN: 978-1-4471-5283-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics