A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling

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

Volumn , Issue , 2011, Pages 1817-1823

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

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; GRAPHIC METHODS; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; LEARNING SYSTEMS;

COMPUTER GENERATED; CONVEX PROGRAMS; DYNAMIC ESTIMATION; GRAPHICAL MODEL; LAGRANGIAN DECOMPOSITION; RUN TIME COMPLEXITY; STATE-OF-THE-ART METHODS; STOPPING CRITERIA;

COMPUTER VISION;

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

References (23)

1. B. Andres, J. Kappes, U. Köthe, C. Schnörr, and F. Hamprecht. An empirical comparison of inference algorithms for graphical models with higher order factors using opengm. In Pattern Recognition, Proc. 32th DAGM Symposium, 2010.
2. A. Beck and M. Teboulle. A fast iterative shrinkagethresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2:183-202, 2009.
3. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, New York, USA, 2004.
4. A. Chambolle and T. Pock. A first-order primal-dual algorithm for convex problems with applications to imaging. Journal of Math. Imaging and Vision, to appear, 2011.
5. 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.
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 energy minimization and beyond via dual decomposition. IEEE Trans. PAMI (in press).
10. N. Komodakis, N. Paragios, and G. Tziritas. MRF optimization via dual decomposition: Message-passing revisited. In ICCV, 2007.
11. Y. Nesterov. Gradient methods for minimizing composite objective function. CORE Discussion Paper 2007/76.
12. 2 . Soviet Math. Dokl., 27(2):372-376, 1983.
13. Y. Nesterov. Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, 2004.
14. Y. Nesterov. Smooth minimization of non-smooth functions. Math. Program., Ser. A (103):127-152, 2004.
15. P. Ravikumar, A. Agarwal, and M. Wainwright. Messagepassing for graph-structured linear programs: Proximal methods and rounding schemes. JMLR, 11:1043-1080, 2010.
16. R. Rockafellar and R. J.-B. Wets. Variational Analysis. Springer, 2nd edition, 2004.
17. M. Schlesinger. Syntactic analysis of two-dimensional visual signals in the presence of noise. Kibernetika, (4):113-130, 1976.
18. 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.
19. 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. Pattern Anal. Mach. Intell., 30:1068-1080, June 2008.
20. M. Wainwright, T. Jaakkola, and A. Willsky. MAP estimation via agreement on (hyper) trees: message passing and linear programming approaches. In Allerton Conf. on Communication, Control and Computing, 2002.
21. M. J. Wainwright and M. I. Jordan. Graphical models, exponential families, and variational inference. Found. Trends Mach. Learn., 1(1-2):1-305, 2008.
22. T. Werner. A linear programming approach to max-sum problem: A review. IEEE Trans. on PAMI, 29(7), July 2007.
23. T. Werner. Revisiting the decomposition approach to inference in exponential families and graphical models. Technical report, CMP, Czech TU, 2009.