Generic cuts: An efficient algorithm for optimal inference in higher order MRF-MAP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7576 LNCS, Issue PART 5, 2012, Pages 17-30

  Arora, Chetan ^a   Banerjee, Subhashis ^a   Kalra, Prem ^a   Maheshwari, S N ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Higher Order MRF MAP; Optimal Algorithm; Submodular Function Minimization

Indexed keywords

APPROXIMATE SOLUTION; CLIQUE POTENTIAL; ENERGY FUNCTIONS; FLOW PROBLEMS; HIGHER ORDER MRF-MAP; MIN-CUT; OPTIMAL ALGORITHM; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; POTENTIAL FUNCTION; PRIMAL-DUAL; SUBMODULAR; SUBMODULAR FUNCTION MINIMIZATION; SUBMODULAR FUNCTIONS; SUBMODULARITY;

BOOLEAN FUNCTIONS; COMPUTER VISION; FLOW GRAPHS; GRAPHIC METHODS; OPTIMAL SYSTEMS; OPTIMIZATION;

ALGORITHMS;

EID: 84867844854     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33715-4_2     Document Type: Conference Paper

References (27)

1. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23, 1222-1239 (2001)
2. Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships: metric labeling and markov random fields. J. ACM 49, 616-639 (2002)
3. Komodakis, N., Tziritas, G.: Approximate labeling via graph cuts based on linear programming. IEEE Trans. Pattern Anal. Mach. Intell. 29, 1436-1453 (2007)
4. Ishikawa, H.: Transformation of general binaryMRF minimization to the first-order case. IEEE Trans. Pattern Anal. Mach. Intell. 33, 1234-1249 (2011)
5. Kohli, P., Ladický, L., Torr, P.H.: Robust higher order potentials for enforcing label consistency. International Journal of Computer Vision 82, 302-324 (2009)
6. Roth, S., Black, M.J.: Fields of experts. International Journal of Computer Vision 82, 205-229 (2009)
7. Rother, C., Kohli, P., Feng, W., Jia, J.: Minimizing sparse higher order energy functions of discrete variables. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1382-1389 (2009)
8. Woodford, O., Torr, P., Reid, I., Fitzgibbon, A.: Global stereo reconstruction under second order smoothness priors. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1-8 (2008)
9. Komodakis, N., Paragios, N.: Beyond pairwise energies: Efficient optimization for higher-order MRF's. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2985-2992 (2009)
10. Besag, J.: On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society B-48, 259-302 (1986)
11. Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. In: Adaptive Computation and Machine Learning. MIT Press (2009)
12. Kolmogorov, V., Rother, C.: Minimizing nonsubmodular functions with graph cutsa review. IEEE Trans. Pattern Anal. Mach. Intell. 29, 1274-1279 (2007)
13. Kahl, F., Strandmark, P.: Generalized roof duality for pseudo-boolean optimization. In: IEEE International Conference on Computer Vision, pp. 255-262 (2011)
14. Boros, E., Gruber, A.: On quadratization of pseudo-boolean functions. In: International Symposium on Artificial Intelligence and Mathematics (2012)
15. Fix, A., Gruber, A., Boros, E., Zabih, R.: A graph cut algorithm for higher-order markov random fields. In: IEEE International Conference on Computer Vision, pp. 1020-1027 (2011)
16. Freedman, D., Drineas, P.: Energy minimization via graph cuts: settling what is possible. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 939-946 (2005)
17. Kolmogorov, V., Zabin, R.: What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 147-159 (2004)
18. Živný, S., Jeavons, P.G.: Classes of submodular constraints expressible by graph cuts. Constraints 15, 430-452 (2010)
19. Kolmogorov, V.: Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics 160, 416-426 (2012)
20. Iwata, S., Orlin, J.B.: A simple combinatorial algorithm for submodular function minimization. In: Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1230-1237 (2009)
21. Kolmogorov, V.: Minimizing a sum of submodular functions. CoRR abs/1006.1990 (2010)
22. (Supplementary material)
23. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248-264 (1972)
24. HOCR version 1.02, http://www.f.waseda.jp/hfs/software.html
25. QPBO version 1.3, http://pub.ist.ac.at/~vnk/software.html
26. Darwin framework, version 1.1.2, http://drwn.anu.edu.au/
27. Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell. 28, 1568-1583 (2006)