Highly Influenced

# Energy minimization via graph cuts: settling what is possible

@article{Freedman2005EnergyMV, 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)}, year={2005}, volume={2}, pages={939-946 vol. 2} }

- Published 2005 in 2005 IEEE Computer Society Conference on Computerâ€¦
DOI:10.1109/CVPR.2005.143

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

#### Citations

##### Publications citing this paper.

#### Citation Statistics

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