The minimal solution is usually defined as the global one or one of them when there are multiple global minima. Finding a global minimum is nontrivial if the energy function contains many local minima. Whereas methods for local minimization are quite mature, with commercial software on the market, the study of global minimization is still young. There are no efficient algorithms that guarantee finding globally minimal solutions as there are for local minimization.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag London
About this chapter
Cite this chapter
Li, S. (2009). Minimization – Global Methods. In: Markov Random Field Modeling in Image Analysis. Advances in Pattern Recognition. Springer, London. https://doi.org/10.1007/978-1-84800-279-1_10
Download citation
DOI: https://doi.org/10.1007/978-1-84800-279-1_10
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84800-278-4
Online ISBN: 978-1-84800-279-1
eBook Packages: Computer ScienceComputer Science (R0)