Markov Chain Monte Carlo combined with deterministic methods for Markov random field optimization

Wonsik Kim, Kyoung Mu Lee
2009 2009 IEEE Conference on Computer Vision and Pattern Recognition  
Many vision problems have been formulated as energy minimization problems and there have been significant advances in energy minimization algorithms. The most widely-used energy minimization algorithms include Graph Cuts, Belief Propagation and Tree-Reweighted Message Passing. Although they have obtained good results, they are still unsatisfactory when it comes to more difficult MRF problems such as non-submodular energy functions, highly connected MRFs, and high-order clique potentials. There
more » ... ave also been other approaches, known as stochastic sampling-based algorithms, which include Simulated Annealing, Markov Chain Monte Carlo and Populationbased Markov Chain Monte Carlo. They are applicable to any general energy models but they are usually slower than deterministic methods. In this paper, we propose new algorithms which elegantly combine stochastic and deterministic methods. Sampling-based methods are boosted by deterministic methods so that they can rapidly move to lower energy states and easily jump over energy barriers. In different point of view, the sampling-based method prevents deterministic methods from getting stuck at local minima. Consequently, a combination of both approaches substantially increases the quality of the solutions. We present a thorough analysis of the proposed methods in synthetic MRF problems by controlling the hardness of the problems. We also demonstrate experimental results for the photomontage problem which is the most difficult one among the standard MRF benchmark problems. 1406 978-1-4244-3991-1/09/$25.00 ©2009 IEEE
doi:10.1109/cvprw.2009.5206504 fatcat:ysrjskucpvgoxiyjobb3dd2n7y