Global MAP-optimality by shrinking the combinatorial search area with convex relaxation

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Savchynskyy, Bogdan ^a   Kappes, Jörg ^a   Swoboda, Paul ^a   Schnörr, Christoph ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; MARKOV PROCESSES; OPTIMIZATION; PROBLEM SOLVING; SPEECH RECOGNITION;

COMBINATORIAL METHOD; COMBINATORIAL PROBLEM; COMBINATORIAL SEARCH; ENERGY MINIMIZATION; LARGE-SCALE DATASETS; LINEAR PROGRAMMING RELAXATION; MARKOV RANDOM FIELDS; PROGRAMMING TECHNIQUE;

RELAXATION PROCESSES;

EID: 84898982565     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. D. Koller and N. Friedman. Probabilistic Graphical Models:Principles and Techniques. MIT Press, 2009.
2. T.Werner. A linear programming approach to max-sum problem: A review. IEEE Trans. on PAMI, 29(7), July 2007.
3. M. J. Wainwright and M. I. Jordan. Graphical models, exponential families, and variational inference. Found. Trends Mach. Learn., 1(1-2):1-305, 2008.
4. M. Schlesinger. Syntactic analysis of two-dimensional visual signals in the presence of noise. Kibernetika, (4):113-130, 1976.
5. M. Wainwright, T. Jaakkola, and A. Willsky. MAP estimation via agreement on (hyper)trees: message passing and linear programming approaches. IEEE Trans. on Inf. Th., 51(11), 2005.
6. N. Komodakis, N. Paragios, and G. Tziritas. MRF energy minimization and beyond via dual decomposition. IEEE Trans. on PAMI, 33(3):531-552, march 2011.
7. B. Savchynskyy, J. H. Kappes, S. Schmidt, and C. Schnörr. A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling. In CVPR 2011, 2011.
8. S. Schmidt, B. Savchynskyy, J. H. Kappes, and C. Schnörr. Evaluation of a first-order primal-dual algorithm for MRF energy minimization. In EMMCVPR, pages 89-103, 2011.
9. O. Meshi and A. Globerson. An alternating direction method for dual MAP LP relaxation. In ECML/PKDD (2), pages 470-483, 2011.
10. A. F. T. Martins, M. A. T. Figueiredo, P. M. Q. Aguiar, N. A. Smith, and E. P. Xing. An augmented Lagrangian approach to constrained MAP inference. In ICML, 2011.
11. B. Savchynskyy, S. Schmidt, J. H. Kappes, and C. Schnörr. Efficient MRF energy minimization via adaptive diminishing smoothing. In UAI-2012, pages 746-755.
12. D. V. N. Luong, P. Parpas, D. Rueckert, and B. Rustem. Solving MRF minimization by mirror descent. In Advances in Visual Computing, volume 7431, pages 587-598. Springer Berlin Heidelberg, 2012.
13. J. H. Kappes, B. Savchynskyy, and C. Schnörr. A bundle approach to efficient MAP-inference by Lagrangian relaxation. In CVPR 2012, 2012.
14. B. Savchynskyy and S. Schmidt. Getting feasible variable estimates from infeasible ones: MRF local polytope study. Technical report, arXiv:1210.4081, 2012.
15. J. H. Kappes, B. Andres, F. A. Hamprecht, C. Schnörr, S. Nowozin, D. Batra, S. Kim, B. X. Kausler, J. Lellmann, N. Komodakis, and C. Rother. A comparative study of modern inference techniques for discrete energy minimization problems. In CVPR, 2013.
16. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. IEEE Trans. on PAMI, 28(10):1568-1583, 2006.
17. A. Globerson and T. Jaakkola. Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations. In NIPS, 2007.
18. T. Hazan and A. Shashua. Norm-product belief propagation: Primal-dual message-passing for approximate inference. IEEE Trans. on Inf. Theory,, 56(12):6294-6316, 2010.
19. M. I. Schlesinger and K. V. Antoniuk. Diffusion algorithms and structural recognition optimization problems. Cybernetics and Systems Analysis, 47(2):175-192, 2011.
20. V. Franc, S. Sonnenburg, and T. Werner. Cutting-Plane Methods in Machine Learning, chapter 7, pages 185-218. The MIT Press, Cambridge,USA, 2012.
21. J. H. Kappes, M. Speth, B. Andres, G. Reinelt, and C. Schnörr. Globally optimal image partitioning by multicuts. In EMMCVPR, 2011.
22. M. Bergtholdt, J. H. Kappes, S. Schmidt, and C. Schnörr. A study of parts-based object class detection using complete graphs. IJCV, 87(1-2):93-117, 2010.
23. M. Sun, M. Telaprolu, H. Lee, and S. Savarese. Efficient and exact MAP-MRF inference using branch and bound. In AISTATS-2012.
24. L. Otten and R. Dechter. Anytime AND/OR depth-first search for combinatorial optimization. In Proceedings of the Annual Symposium on Combinatorial Search (SOCS), 2011.
25. M. C. Cooper, S. de Givry, M. Sanchez, T. Schiex, M. Zytnicki, and T. Werner. Soft arc consistency revisited. Artificial Intelligence, 174(7-8):449-478, May 2010.
26. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. A comparative study of energy minimization methods for Markov random fields with smoothness-based priors. IEEE Trans. PAMI., 30:1068-1080, June 2008.
27. ILOG, Inc. ILOG CPLEX: High-performance software for mathematical programming and optimization. See http://www.ilog.com/products/cplex/.
28. B. Andres, T. Beier, and J. H. Kappes. OpenGM: A C++ library for discrete graphical models. ArXiv e-prints, 2012. Projectpage: http://hci.iwr.uni- heidelberg.de/opengm2/.
29. I. Kovtun. Partial optimal labeling search for a NP-hard subclass of (max, +) problems. In Proceedings of the DAGM Symposium, 2003.
30. J. H. Kappes, M. Speth, G. Reinelt, and C. Schnörr. Towards efficient and exact MAP-inference for large scale discrete computer vision problems via combinatorial optimization. In CVPR, 2013.
31. S. Chopra and M. R. Rao. On the multiway cut polyhedron. Networks, 21(1):51-89, 1991.
32. P. Swoboda, B. Savchynskyy, J. H. Kappes, and C. Schnörr. Partial optimality via iterative pruning for the Potts model. In SSVM, 2013.
33. D. Sontag, T. Meltzer, A. Globerson, Y.Weiss, and T. Jaakkola. Tightening LP relaxations for MAP using message-passing. In UAI-2008, pages 503-510.
34. D. Sontag. C++ code for MAP inference in graphical models. See http://cs.nyu.edu/~dsontag/code/mplp-ver2.tgz.