After the energy function E(f), including both the functional form and the parameters involved, 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 this is generally 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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 – Local 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_9
Download citation
DOI: https://doi.org/10.1007/978-1-84800-279-1_9
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)