Related Concepts
Definition
Energy minimization is a subtopic of optimization, where we minimize some energy/cost function by suitable algorithms. The type of energy is twofold: continuous and discrete.
Background
In computer vision problems, we often encounter situations of minimizing energy functions (or cost functions) that are designed to estimate, reconstruct, or process something. There are two major categories of energy minimization. One is that the target can be represented as a vector in the N-dimensional Euclidean space, i.e., the case of continuous energy. For example, if the target is a gray scale image and if each pixel value is handled as a real value, then the image can be treated as an N-dimensional vector, where Nis the number of the pixels. The other is that the target takes a discrete value, i.e., the case of discrete energy. A typical example is image segmentation...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aji SM, McEliece RJ (2000) The generalized distributive law. IEEE Trans Inf Theory 46(2):325–343
Bauschke HH, Combettes PL (2017) Convex analysis and monotone operator theory in Hilbert spaces, 2nd edn. Springer
Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci 2:183–202
Boyd S, Parikh N, Chu E, Peleato B, Eckstein J (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn 3(1):1–122
Boykov Y, Veksler O (2006) Graph cuts in vision and graphics: theories and applications, chapter 5. In: Handbook of mathematical models in computer vision. Springer, pp 79–96
Bresson X, Chan TF (2008) Fast dual minimization of the vectorial total variation norm and applications to color image processing. Inverse Probl Imaging 2(4):455–484
Chambolle A, Pock T (2010) A first-order primal-dual algorithm for convex problems with applications to imaging. J Math Imaging Vis 40(1):120–145
Combettes PL, Wajs V (2005) Signal recovery by proximal forward-backward splitting. SIAM J Multi Model Simul 4:1168–1200
Daubechies I, De Friese M, De Mol C (2004) An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun Pure Appl Math 57:1413–1457
Gabay D, Mercier B (1976) A dual algorithm for the solution of nonlinear variational problems via finite elements approximations. Comput Math Appl 2:17–40
Goldluecke B, Strekalovskiy E, Cremers D (2012) The natural vectorial total variation which arises from geometric measure theory. SIAM J Imaging Sci 5(2):537–563
Koller D, Friedman N (2009) Inference as optimization, chapter 11. In: Probabilistic graphical models: principles and techniques. The MIT Press, Cambridge, MA, pp 381–485
Koller D, Friedman N (2009) MAP inference. In: Probabilistic graphical models: principles and techniques. The MIT Press, Cambridge, MA, pp 551–604
Morioka N, Satoh S (2011) Generalized lasso based approximation of sparse coding for visual recognition. In: Advances in neural information processing systems, pp 181–189
Murphy KP (2012) Machine learning: a probabilistic perspective. The MIT Press, Cambridge, MA
Ono S, Yamada I (2014) Decorrelated vectorial total variation. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 4090–4097
Passty GB (1979) Ergodic convergence to a zero of the sum of monotone operators in Hilbert space. J Math Anal Appl (72):383–390
Rudin LI, Osher S, Fatemi E (1992) Nonlinear total variation based noise removal algorithms. Phys D 60(1–4):259–268
Souly N, Shah M (2016) Visual saliency detection using group lasso regularization in videos of natural scenes. Int J Comput Vis 117(1):93–110
Szeliski R (2011) Computer vision: algorithms and applications. Springer
Tibshirani R (1996) Regression shrinkage and selection via the lasso. J R Stat Soc Ser B (Methodol) 58(1):267–288
**n B, Tian Y, Wang Y, Gao W (2015) Background subtraction via generalized fused lasso foreground modeling. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp 4676–4684
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer International Publishing
About this entry
Cite this entry
Ono, S., Saito, M. (2021). Energy Minimization. In: Ikeuchi, K. (eds) Computer Vision. Springer, Cham. https://doi.org/10.1007/978-3-030-63416-2_833
Download citation
DOI: https://doi.org/10.1007/978-3-030-63416-2_833
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-63415-5
Online ISBN: 978-3-030-63416-2
eBook Packages: Computer ScienceReference Module Computer Science and Engineering