Abstract
After the energy function E(f), including both the functional form and the involved parameters, is given and thus the optimal solution f* = min f E(f) is entirely defined, the remaining problem is to find the solution. It is most desirable to express the solution in closed-form but generally, this is very difficult in vision problems due to the complexity caused by interactions between labels. Therefore, optimal solutions are usually computed by using some iterative search techniques. This chapter describes techniques for finding local minima and discusses related issues.
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 — Local Methods. In: Markov Random Field Modeling in Computer Vision. Computer Science Workbench. Springer, Tokyo. https://doi.org/10.1007/978-4-431-66933-3_8
Download citation
DOI: https://doi.org/10.1007/978-4-431-66933-3_8
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-66935-7
Online ISBN: 978-4-431-66933-3
eBook Packages: Springer Book Archive