Efficient MRF energy minimization via adaptive diminishing smoothing

Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, UAI 2012

Volumn , Issue , 2012, Pages 746-755

  Savchynskyy, Bogdan ^a   Schmidt, Stefan ^a   Kappes, Jorg ^a   Schnörr, Christoph ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SMOOTHING; DUALITY GAP; ENERGY MINIMIZATION; ENERGY MINIMIZATION PROBLEM; LINEAR PROGRAMMING RELAXATION; MARKOV RANDOM FIELDS; NON-SMOOTH FUNCTIONS;

ARTIFICIAL INTELLIGENCE; MARKOV PROCESSES; TREES (MATHEMATICS);

ALGORITHMS;

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

References (27)

1. M. S. Bazaraa and J. J. Jarvis. Linear Programming and Network Flows. Wiley, 1977.
2. V. Franc and B. Savchynskyy. Discriminative learning of max-sum classifiers. Journal of Machine Learning Research, pages 67-104, Jan 2008.
3. A. Globerson and T. Jaakkola. Convergent propagation algorithms via oriented trees. In UAI, 2007.
4. A. Globerson and T. Jaakkola. Fixing max-product: Convergent message passing algorithms for MAP LPrelaxations. In NIPS, 2007.
5. J. Jancsary and G. Matz. Convergent decomposition solvers for tree-reweighted free energies. In 14th International Conference on Artificial Intelligence and Statistics (AISTATS), 2011.
6. J. K. Johnson, D. Malioutov, and A. S. Willsky. Lagrangian relaxation for MAP estimation in graphical models. In 45th Ann. Allerton Conf. on Comm., Control and Comp., 2007.
7. V. Jojic, S. Gould, and D. Koller. Accelerated dual decomposition for MAP inference. In ICML, pages 503-510, 2010.
8. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. IEEE Trans. on PAMI, 28(10):1568-1583, 2006.
9. N. Komodakis, N. Paragios, and G. Tziritas. MRF optimization via dual decomposition: Message-passing revisited. In ICCV, 2007.
10. 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.
11. T. Meltzer, A. Globerson, and Y. Weiss. Convergent message passing algorithms-a unifying view. In UAI 09, 2009.
12. Y. Nesterov. Smooth minimization of non-smooth functions. Math. Prog., A(103):127-152, 2004.
13. Y. Nesterov. Excessive gap technique in nonsmooth convex minimization. SIAM J. on Optimization, 16:235-249, May 2005.
14. P. Ravikumar, A. Agarwal, and M. Wainwright. Message-passing for graph-structured linear programs: Proximal methods and rounding schemes. JMLR, 11:1043-1080, 2010.
15. B. Savchynskyy, J. Kappes, S. Schmidt, and C. Schnorr. A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling. In CVPR 2011, 2011.
16. M. Schlesinger. Syntactic analysis of twodimensional visual signals in the presence of noise. Kibernetika, (4):113-130, 1976.
17. M. Schlesinger and V. Giginyak. Solution to structural recognition (max,+)-problems by their equivalent transformations. In 2 Parts. Control Systems and Computers, (1-2), 2007.
18. M. Schlesinger, E. Vodolazskiy, and N. Lopatka. Stop condition for subgradient minimization in dual relaxed (max,+) problem. In EMMCVPR, 2011.
19. S. Schmidt, B. Savchynskyy, J. H. Kappes, and C. Schnorr. Evaluation of a first-order primal-dual algorithm for MRF energy minimization. In EMMCVPR, pages 89-103. Springer, 2011.
20. 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.
21. 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.
22. M. Wainwright, T. Jaakkola, and A. Willsky. A new class of upper bounds on the log partition function. IEEE Trans. on Information Theory, 51:2313-2335, 2005.
23. M. J. Wainwright and M. I. Jordan. Graphical models, exponential families, and variational inference. Found. Trends Mach. Learn., 1(1-2):1-305, 2008.
24. T. Werner. A linear programming approach to maxsum problem: A review. IEEE Trans. on PAMI, 29(7), July 2007.
25. T. Werner. Revisiting the decomposition approach to inference in exponential families and graphical models. Technical report, CMP, Czech TU, 2009.
26. T.Werner. How to compute primal solution from dual one in MAP inference in MRF? Control Systems and Computers, (2), March-April 2011.
27. J. Yedidia, W. Freeman, and Y. Weiss. Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Trans. on Inf. Th., (7):2282-2312, 2005.