Energy minimization via graph cuts: settling what is possible

  title={Energy minimization via graph cuts: settling what is possible},
  author={Daniel Freedman and Petros Drineas},
  journal={2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)},
  pages={939-946 vol. 2}
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was first attacked by two papers of Kolmogorov and Zabih, in which they dealt with functions with pair-wise and triplewise pixel interactions. In this work, we extend their results in two directions. First, we examine the case of k-wise pixel interactions; the results are derived from a purely algebraic approach. Second, we… CONTINUE READING
Highly Cited
This paper has 180 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
104 Citations
27 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 104 extracted citations

181 Citations

Citations per Year
Semantic Scholar estimates that this publication has 181 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 27 references

An algorithmic theory of numbers, graphs, and convexity

  • C. Papadimitriou, K. Steiglitz
  • Soc for Industrial and Applied Math,
  • 1986
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…