Skip to content

Fast approximate energy minimization via graph cuts

Yuri Y. Boykov, Olga Veksler, Ramin Zabih

IEEE Transactions on Pattern Analysis and Machine Intelligence · 2001 · 7,114 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Boykov, Y. Y., Veksler, O., & Zabih, R. (2001). Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11), 1222–1239. https://doi.org/10.1109/34.969114

In text: (Boykov et al., 2001)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. A common constraint is that the labels should vary smoothly almost everywhere while preserving sharp discontinuities that may exist, e.g., at object boundaries. These tasks are naturally stated in terms of energy minimization. The authors consider a wide class of energies with various smoothness constraints. Global minimization of these energy functions is NP-hard even in the simplest discontinuity-preserving case. Therefore, our focus is on efficient approximation algorithms. We present two algorithms based on graph cuts that efficiently find a local minimum with respect to two types of large moves, namely expansion moves and swap moves. These moves can simultaneously change the labels of arbitrarily large sets of pixels. In contrast, many standard algorithms (including simulated annealing) use small moves where only one pixel changes its label at a time. Our expansion algorithm finds a labeling within a known factor of the global minimum, while our swap algorithm handles more general energy functions. Both of these algorithms allow important cases of discontinuity preserving energies. We experimentally demonstrate the effectiveness of our approach for image restoration, stereo and motion. On real data with ground truth, we achieve 98 percent accuracy.

  1. A Computational Approach to Edge Detection1986
  2. Compressed sensing2006
  3. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images1984
  4. Scale-space and edge detection using anisotropic diffusion1990
  5. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems2009

Metadata from OpenAlex (CC0). Citations are generated from the published record.