CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2011 vol.33 Issue No.06 - June

Subscribe

Issue No.06 - June (2011 vol.33)

pp: 1234-1249

Hiroshi Ishikawa , Waseda University, Tokyo

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2010.91

ABSTRACT

We introduce a transformation of general higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, we formalize a framework for approximately minimizing higher-order multilabel MRF energies that combines the new reduction with the fusion-move and QPBO algorithms. While many computer 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 exceptions 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 higher-order energies can be used to capture the rich statistics of natural scenes. We also show that some minimization methods can be considered special cases of the present framework, as well as comparing the new method experimentally with other such techniques.

INDEX TERMS

Energy minimization, pseudo-Boolean function, higher-order MRFs, graph cuts.

CITATION

Hiroshi Ishikawa, "Transformation of General Binary MRF Minimization to the First-Order Case",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol.33, no. 6, pp. 1234-1249, June 2011, doi:10.1109/TPAMI.2010.91REFERENCES