MRF optimization via dual decomposition: Message-passing revisited

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2007, Pages

  Komodakis, Nikos ^a   Paragios, Nikos ^a   Tziritas, Georgios ^b  

^a ECOLE CENTRALE PARIS   (France)

^b UNIVERSITY OF CRETE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL CONFERENCES;

ARTIFICIAL INTELLIGENCE; COMPUTER NETWORKS; COMPUTER VISION; HIDDEN MARKOV MODELS; IMAGE PROCESSING; OPTIMIZATION; STRUCTURAL FRAMES;

MESSAGE PASSING;

EID: 50649087920     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2007.4408890     Document Type: Conference Paper

References (8)

1. D. Bertsekas. Nonlinear Programming. 1999.
2. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. PAMI, Nov. 2001.
3. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. PAMI, 2006.
4. V. Kolmogorov and M.Wainwright. On the optimality of tree-reweighted max-product message passing. In UAI, 2005.
5. N. Komodakis, G. Tziritas, and N. Paragios. Fast, approximately optimal solutions for single and dynamic MRFs. In CVPR, 2007.
6. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. 1988.
7. M. Wainwright, T. Jaakkola, and A. Willsky. Map estimation via agreement on trees: message-passing and linear programming. IEEE Trans. on Information Theory, 2005.
8. J. Yedidia, W. Freeman, and Y. Weiss. Constructing free energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory, 2005.