Abstract
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 non-trivial if the energy function contains many local minima. Whereas methods for local minimization are quite mature with commercial software on market, the study of global minimization is still young. There are no efficient algorithms which guarantee to find globally minimal solutions as are there for local minimization.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Japan
About this chapter
Cite this chapter
Li, S.Z. (1995). Minimization — Global Methods. In: Markov Random Field Modeling in Computer Vision. Computer Science Workbench. Springer, Tokyo. https://doi.org/10.1007/978-4-431-66933-3_9
Download citation
DOI: https://doi.org/10.1007/978-4-431-66933-3_9
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-66935-7
Online ISBN: 978-4-431-66933-3
eBook Packages: Springer Book Archive