Higher-order gradient descent by fusion-move graph cut

Hiroshi Ishikawa*

*Corresponding author for this work

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

26 Citations (Scopus)


Markov Random Field is now ubiquitous in many formulations of various vision problems. Recently, optimization of higher-order potentials became practical using higher-order graph cuts: the combination of i) the fusion move algorithm, ii) the reduction of higher-order binary energy minimization to first-order, and iii) the QPBO algorithm. In the fusion move, it is crucial for the success and efficiency of the optimization to provide proposals that fits the energies being optimized. For higher-order energies, it is even more so because they have richer class of null potentials. In this paper, we focus on the efficiency of the higher-order graph cuts and present a simple technique for generating proposal labelings that makes the algorithm much more efficient, which we empirically show using examples in stereo and image denoising.

Original languageEnglish
Title of host publication2009 IEEE 12th International Conference on Computer Vision, ICCV 2009
Number of pages7
Publication statusPublished - 2009 Dec 1
Externally publishedYes
Event12th International Conference on Computer Vision, ICCV 2009 - Kyoto, Japan
Duration: 2009 Sept 292009 Oct 2

Publication series

NameProceedings of the IEEE International Conference on Computer Vision


Conference12th International Conference on Computer Vision, ICCV 2009

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition


Dive into the research topics of 'Higher-order gradient descent by fusion-move graph cut'. Together they form a unique fingerprint.

Cite this