Minimizing Nonsubmodular Functions with Graph Cuts-A Review

@article{Kolmogorov2007MinimizingNF,
  title={Minimizing Nonsubmodular Functions with Graph Cuts-A Review},
  author={Vladimir Kolmogorov and Carsten Rother},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={2007},
  volume={29}
}
Optimization techniques based on graph cuts have become a standard tool for many vision applications. These techniques allow to minimize efficiently certain energy functions corresponding to pairwise Markov random fields (MRFs). Currently, there is an accepted view within the computer vision community that graph cuts can only be used for optimizing a limited class of MRF energies (e.g., submodular functions). In this survey, we review some results that show that graph cuts can be applied to a… CONTINUE READING
Highly Influential
This paper has highly influenced 54 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 438 citations. REVIEW CITATIONS

Citations

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

A graph cut algorithm for higher-order Markov Random Fields

2011 International Conference on Computer Vision • 2011
View 9 Excerpts
Highly Influenced

Interacting Tracklets for Multi-Object Tracking

IEEE Transactions on Image Processing • 2018
View 12 Excerpts
Highly Influenced

Discrete Energy Minimization with Global Constraints Valerii Ulitin

Valerii Ulitin
2017
View 9 Excerpts
Highly Influenced

Higher Order Maximum Persistency and Comparison Theorems

Computer Vision and Image Understanding • 2016
View 19 Excerpts
Highly Influenced

A Hypergraph-Based Reduction for Higher-Order Binary Markov Random Fields

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2015
View 19 Excerpts
Highly Influenced

Context-Aware CNNs for Person Head Detection

2015 IEEE International Conference on Computer Vision (ICCV) • 2015
View 4 Excerpts
Highly Influenced

438 Citations

0204060'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 438 citations based on the available data.

See our FAQ for additional information.

References

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

Digital tapestry

C. Rother, S. Kumar, V. Kolmogorov, A. Blake
CVPR, • 2005
View 7 Excerpts
Highly Influenced

Fast Approximate Energy Minimization via Graph Cuts

IEEE Trans. Pattern Anal. Mach. Intell. • 2001
View 5 Excerpts
Highly Influenced

Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

IEEE Transactions on Pattern Analysis and Machine Intelligence • 1984
View 5 Excerpts
Highly Influenced

Network flows and minimization of quadratic pseudo-Boolean functions

E. Boros, P. L. Hammer, X. Sun
Technical Report RRR 17-1991, RUTCOR Research Report, May • 1991
View 4 Excerpts
Highly Influenced

A Linear Programming Approach to Max-Sum Problem: A Review

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2007
View 2 Excerpts

Minimizing non-submodular functions with graph cuts a review

V. Kolmogorov, C. Rother
Technical Report MSR-TR-2006- 100, Microsoft Research, July • 2006

Similar Papers

Loading similar papers…