Sciweavers

Share
ECCV
2008
Springer

Toward Global Minimum through Combined Local Minima

11 years 1 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local minima solutions can be obtained with simple implementations and usually require smaller computational time than global algorithms. Also, methods such as ICM can be readily implemented in a various difficult problems that may involve larger than pairwise clique MRFs. However, their short comings are evident in comparison to newer methods such as graph cut and belief propagation. The local minimum depends largely on the initial state, which is the fundamental problem of its kind. In this paper, disadvantages of local minima techniques are addressed by proposing ways to combine multiple local solutions. First, multiple ICM solutions are obtained using different initial states. The solutions are combined with random partitioning based greedy algorithm called Combined Local Minima (CLM). There are numerous MRF pr...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
Added 02 Feb 2010
Updated 02 Apr 2010
Type Conference
Year 2008
Where ECCV
Authors Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
Comments (0)
books