Skip to main content

Introduction

  • Chapter
  • First Online:

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

Abstract

The vast majority of computer vision algorithms use some form of optimization, as they intend to find some solution which is “best” according to some criterion. Consequently, the field of optimization is worth studying for everyone being seriously interested in computer vision. In this chapter, some expressions being of widespread use in literature dealing with optimization are clarified first. Furthermore, a classification framework is presented, which intends to categorize optimization methods into the four categories continuous, discrete, combinatorial, and variational, according to the nature of the set from which they select their solution. This categorization helps to obtain an overview of the topic and serves as a basis for the structure of the remaining chapters at the same time. Additionally, some concepts being quite common in optimization and therefore being used in diverse applications are presented. Especially to mention are so-called energy functionals measuring the quality of a particular solution by calculating a quantity called “energy”, graphs, and last but not least Markov Random Fields.

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

Learn about institutional subscriptions

References

  1. Blake A, Kohli P, Rother C (2011) Markov random fields for vision and image processing. MIT Press, Cambridge, MA. ISBN 978-0262015776

    MATH  Google Scholar 

  2. Boykov J, Veksler O, Zabih R (2001) Fast approximate energy minimization via graph cuts. IEEE Trans Pattern Anal Mach Intell 23(11):1222–1239

    Article  Google Scholar 

  3. Geman S, Geman D (1984) Stochastic relaxation, Gibbs distributions, and the Bayesian restoration if images. IEEE Trans Pattern Anal Mach Intell 6(6):721–741

    Article  MATH  Google Scholar 

  4. Gross JL, Yellen J (2005) Graph theory and its applications, 2nd edn. Chapman & Hall/CRC, Boca Raton. ISBN 978-1584885054

    Google Scholar 

  5. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  MathSciNet  MATH  Google Scholar 

  6. Rangarajan A, Vemuri B, Yuille A (eds) (2005) Energy minimization methods in computer vision and pattern recognition: 5th international workshop (proceedings). Springer, Berlin. ISBN 978-3540302872

    Google Scholar 

  7. Velho L, Gomes J, Pinto Carvalho PC (2008) Mathematical optimization in computer graphics and vision. Morgan Kaufmann, Amsterdam. ISBN 978-0127159515

    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). Introduction. In: Optimization for Computer Vision. Advances in Computer Vision and Pattern Recognition. Springer, London. https://doi.org/10.1007/978-1-4471-5283-5_1

Download citation

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

  • 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