Higher-order clique reduction in binary graph cut

Research output: Chapter in Book/Report/Conference proceedingConference contribution

93 Citations (Scopus)

Abstract

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 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 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.

Original languageEnglish
Title of host publication2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2009
PublisherIEEE Computer Society
Pages2993-3000
Number of pages8
ISBN (Print)9781424439935
DOIs
Publication statusPublished - 2009 Jan 1
Event2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Miami, FL, United States
Duration: 2009 Jun 202009 Jun 25

Publication series

Name2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2009
Volume2009 IEEE Computer Society Conference on Computer Vision and ...

Conference

Conference2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
CountryUnited States
CityMiami, FL
Period09/6/2009/6/25

    Fingerprint

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Biomedical Engineering

Cite this

Ishikawa, H. (2009). Higher-order clique reduction in binary graph cut. In 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2009 (pp. 2993-3000). [5206689] (2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2009; Vol. 2009 IEEE Computer Society Conference on Computer Vision and ...). IEEE Computer Society. https://doi.org/10.1109/CVPRW.2009.5206689