A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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. Theredoi:10.1109/cvprw.2009.5206504 fatcat:ysrjskucpvgoxiyjobb3dd2n7y