Computer Vision

2014 Edition
| Editors: Katsushi Ikeuchi

Variational Method

  • Bastian Goldluecke
Reference work entry

Related Concepts


The variational method is a way to solve problems given in the form of a variational model, i.e., as an energy minimization problem on an infinite-dimensional space which is typically a function space. It employs tools from the mathematical framework of variational analysis.


Ikeuchi and Horn's shape-from-shading paper and Horn and Schunck's optical flow paper, which appeared in AIJ simultaneously, are the earliest representative works to introduce a variational method to computer vision [7]. Inspired by the extraordinary success of the idea, variational methods have been extensively studied in computer vision and become a very popular tool for a wide variety of problems. They are particularly successful in mathematical image processing, where they are used to describe fundamental low-level problems, like image segmentation [9, 11], denoising [15], and deblurring [3], but have also been employed for...

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


  1. 1.
    Ambrosio L, Fusco N, Pallara D (2000) Functions of bounded variation and free discontinuity problems. Oxford University Press, Oxford/New YorkzbMATHGoogle Scholar
  2. 2.
    Attouch H, Buttazzo G, Michaille G (2006) Variational analysis in Sobolev and BV spaces. MPS-SIAM series on optimization. Society for Industrial and Applied Mathematics, PhiladelphiaGoogle Scholar
  3. 3.
    Chan T, Wong C (1998) Total variation blind deconvolution. IEEE Trans Image Process 7(3):370–375CrossRefGoogle Scholar
  4. 4.
    Faugeras O, Keriven R (1998) Variational principles, surface evolution, PDE's, level set methods, and the stereo problem. IEEE Trans Image Process 7(3):336–344MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Gelfand IM, Fomin SV (2003) Calculus of variations. Dover publications reprint of the 1963 edn. Dover Publications Inc., Mineola, NYGoogle Scholar
  6. 6.
    Goldluecke B, Ihrke I, Linz C, Magnor M (2007) Weighted minimal hypersurface reconstruction. IEEE Trans Pattern Anal Mach Intell 29(7):1194–1208CrossRefGoogle Scholar
  7. 7.
    Ikeuchi K, Horn BKP (1981) Numerical shape from shading and occluding boundaries. Artif Intell 17: 141–184CrossRefGoogle Scholar
  8. 8.
    Horn B, Schunck B (1981) Determining optical flow. Artif Intell 17:185–203CrossRefGoogle Scholar
  9. 9.
    Kass M, Witkin A, Terzopoulos D (1987) Snakes: active contour models. Int J Comput Vis 1:321–331CrossRefGoogle Scholar
  10. 10.
    Kolev K, Klodt M, Brox T, Cremers D (2009) Continuous global optimization in multiview 3D reconstruction. Int J Comput Vis 84(1):80–96CrossRefGoogle Scholar
  11. 11.
    Mumford D, Shah J (1989) Optimal approximation by piecewise smooth functions and associated variational problems. Commun Pure Appl Math 42:577–685MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Nikolova M, Esedoglu S, Chan T (2006) Algorithms for finding global minimizers of image segmentation and denoising models. SIAM J Appl Math 66(5): 1632–1648MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Osher S, Fedkiw R (2003) Level set methods and dynamic implicit surfaces. Volume 153 of applied mathematical sciences. Springer, New YorkGoogle Scholar
  14. 14.
    . Overgaard N, Solem J (2007) The variational origin of motion by gaussian curvature. In: Proceedings of the 1st international conference on Scale space and variational methods in computer vision (SSVM)Google Scholar
  15. 15.
    Rudin LI, Osher S, Fatemi E (1992) Nonlinear total variation based noise removal algorithms. Physica D 60(1–4):259–268MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Sharpe RW (1997) Differential geometry. Volume 166 of graduate texts in mathematics. Springer, New YorkGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Bastian Goldluecke
    • 1
  1. 1.Department of Computer Science, Technische universität München, MünchenMünchenGermany