Fast Approximate Energy Minimization via Graph Cuts

@inproceedings{Boykov1999FastAE,
  title={Fast Approximate Energy Minimization via Graph Cuts},
  author={Yuri Boykov and Olga Veksler and Ramin Zabih},
  booktitle={ICCV},
  year={1999}
}
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when very large moves are allowed. The first move we consider is an α-βswap: for a pair of labels α, β, this move exchanges the labels between an arbitrary set of pixels labeled α and another arbitrary set… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 5,036 CITATIONS, ESTIMATED 28% COVERAGE

Illumination-Invariant Robust Multiview 3D Human Motion Capture

  • 2018 IEEE Winter Conference on Applications of Computer Vision (WACV)
  • 2018
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Fast Partitioning of Vector-Valued Images

  • SIAM J. Imaging Sciences
  • 2014
VIEW 11 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

MAP Inference with MRF by Graduated Non-Convexity and Concavity Procedure

VIEW 5 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1999
2019

CITATION STATISTICS

  • 703 Highly Influenced Citations

  • Averaged 386 Citations per year over the last 3 years

Similar Papers

Loading similar papers…