Towards efficient and exact map-inference for large scale discrete computer vision problems via combinatorial optimization

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2013, Pages 1752-1758

  Kappes, Jorg Hendrik ^a   Speth, Markus ^a   Reinelt, Gerhard ^a   Schnorr, Christoph ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

discrete optimization; Graphical models; Markov random fields

Indexed keywords

APPROXIMATIVE METHOD; BENCH-MARK PROBLEMS; COMPUTER VISION PROBLEMS; DISCRETE OPTIMIZATION; GRAPHICAL MODEL; MARKOV RANDOM FIELDS; OPTIMIZATION PROBLEMS; PRE-PROCESSING STEP;

MARKOV PROCESSES; PATTERN RECOGNITION;

GRAPHIC METHODS;

EID: 84887373372     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2013.229     Document Type: Conference Paper

References (37)

1. BrainWeb: Simulated brain database. http://brainweb. bic. mni. mcgill. ca/brainweb/.
2. The probabilistic inference challenge (PIC 2011). http://www. cs. huji. ac. il/project/PASCAL/.
3. K. Alahari, P. Kohli, and P. H. S. Torr. Dynamic hybrid algorithms for MAP inference in discrete MRFs. TPAMI, 32(10):1846-1857, 2010.
4. B. Andres, T. Beier, and J. H. Kappes. OpenGM: A C++ library for discrete graphical models, 2012. http://arxiv. org/abs/1206. 0111.
5. T. Bonato. Contraction-based Separation and Lifting for Solving the Max-Cut Problem. Optimus Verlag, 2011.
6. E. Boros and P. L. Hammer. Pseudo-Boolean optimization. Discrete Applied Mathematics, 123(1-3):155-225, 2002.
7. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. TPAMI, 26(9):1124-1137, 2004.
8. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. TPAMI, 23(11):1222-1239, 2001.
9. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
10. V. Franc, S. Sonnenburg, and T. Werner. Cutting plane methods in machine learning. In Optimization for Machine Learning. MIT Press, 2011.
11. P. Hammer. Some network flow problems solved with pseudo-Boolean programming. Operations Research, 13(3):388-399, 1965.
12. T. Hazan and A. Shashua. Convergent message-passing algorithms for inference over general graphs with convex free energies. In UAI, 2008.
13. J. K. Johnson, D. M. Malioutov, and A. S. Willsky. Lagrangian relaxation for MAP estimation in graphical models. In Proceedings of the Annual Allerton Conference on Communication, Control, and Computing, 2007.
14. F. Kahl and P. Strandmark. Generalized roof duality for pseudo-Boolean optimization. In ICCV, 2011.
15. J. H. Kappes, B. Savchynskyy, and C. Schn?r. A bundle approach to efficient MAP-inference by Lagrangian relaxation. In CVPR, 2012.
16. J. H. Kappes, M. Speth, B. Andres, G. Reinelt, and C. Schn?r. Globally optimal image partitioning by multicuts. In EMMCVPR, 2011.
17. P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, and P. H. S. Torr. On partial optimality in multi-label MRFs. In ICML, 2008.
18. D. Koller and N. Friedman. Probabilistic Graphical Models: Principles and Techniques. MIT Press, 2009.
19. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. TPAMI, 28(10):1568-1583, 2006.
20. N. Komodakis, N. Paragios, and G. Tziritas. MRF energy minimization and beyond via dual decomposition. TPAMI, 33(3):531-552, 2011.
21. N. Komodakis and G. Tziritas. Approximate labeling via graph cuts based on linear programming. TPAMI, 29(8):1436-1453, 2007.
22. I. Kovtun. Partial optimal labeling search for a NP-hard subclass of (max, +) problems. In Proceedings of the DAGM Symposium, 2003.
23. V. Lempitsky, C. Rother, S. Roth, and A. Blake. Fusion moves for Markov random field optimization. TPAMI, 32(8):1392-1405, 2010.
24. S. Nowozin, C. Rother, S. Bagon, T. Sharp, B. Yao, and P. Kohli. Decision tree fields. In ICCV, 2011.
25. J. B. Orlin. A faster strongly polynomial time algorithm for submodular function minimization. In IPCO, 2007.
26. L. Otten and R. Dechter. Anytime AND/OR depth-first search for combinatorial optimization. In SOCS, 2011.
27. C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer. Optimizing binary MRFs via extended roof duality. In CVPR, 2007.
28. B. Savchynskyy, S. Schmidt, J. H. Kappes, and C. Schn?r. A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling. In CVPR, 2011.
29. B. Savchynskyy, S. Schmidt, J. H. Kappes, and C. Schn?r. Efficient MRF energy minimization via adaptive diminishing smoothing. In UAI, 2012.
30. M. I. Schlesinger. Syntactic analysis of two-dimensional visual signals in noisy conditions. Kibernetika, 4:113-130, 1976.
31. N. N. Schraudolph. Polynomial-time exact inference in NP-hard binary MRFs via reweighted perfect matching. In AISTATS, 2010.
32. N. N. Schraudolph and D. Kamenetsky. Efficient exact inference in planar Ising models. In NIPS, 2009.
33. A. Shekhovtsov and V. Hlav. On partial optimality by auxiliary submodular problems. In Control Systems and Computers, 2011. 3
34. M. Sun, M. Telaprolu, H. Lee, and S. Savarese. Efficient and exact MAP-MRF inference using branch and bound. In AISTATS, 2012.
35. P. Swoboda, B. Savchynskyy, J. H. Kappes, and C. Schn?r. Partial optimality via iterative pruning for the Potts model. In SSVM, 2013.
36. M. J. Wainwright and M. I. Jordan. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1(1-2):1-305, 2008.
37. T. Werner. Revisiting the linear programming relaxation approach to Gibbs energy minimization and weighted constraint satisfaction. TPAMI, 32(8):1474-1488, 2010.