Higher-order clique reduction in binary graph cut

Hiroshi Ishikawa
2009 2009 IEEE Conference on Computer Vision and Pattern Recognition  
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, we combine the reduction with the fusion-move and QPBO algorithms to optimize higher-order multi-label problems. While many vision problems today are formulated as energy minimization problems, they have mostly been limited to using first-order energies, which consist of unary and pairwise clique potentials, with a few
more » ... eptions that consider triples. This is because of the lack of efficient algorithms to optimize energies with higher-order interactions. Our algorithm challenges this restriction that limits the representational power of the models, so that higherorder energies can be used to capture the rich statistics of natural scenes. To demonstrate the algorithm, we minimize a third-order energy, which allows clique potentials with up to four pixels, in an image restoration problem. The problem uses the Fields of Experts model, a learned spatial prior of natural images that has been used to test two belief propagation algorithms capable of optimizing higher-order energies. The results show that the algorithm exceeds the BP algorithms in both optimization performance and speed. 2993 978-1-4244-3991-1/09/$25.00 ©2009 IEEE
doi:10.1109/cvpr.2009.5206689 dblp:conf/cvpr/Ishikawa09 fatcat:rng4csnxkjhnpomrlio2vrryga