Efficient inference of continuous Markov random fields with polynomial potentials

Advances in Neural Information Processing Systems

Volumn 2, Issue January, 2014, Pages 936-944

  Wang, Shenlong ^a   Schwing, Alexander G ^a   Urtasun, Raquel ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE DENOISING; IMAGE RECONSTRUCTION; INFORMATION SCIENCE; MARKOV PROCESSES;

CONCAVE-CONVEX PROCEDURE; CONVEX DECOMPOSITION; MARKOV RANDOM FIELDS; MULTIVARIATE POLYNOMIAL; POLYNOMIAL POTENTIAL; SEMIDEFINITE PROGRAMING; SHAPE FROM SHADING; SUM OF SQUARES OPTIMIZATION;

POLYNOMIALS;

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

References (33)

1. A. A. Ahmadi, A. Olshevsky, P. A. Parrilo, and J. N. Tsitsiklis. Np-hardness of deciding convexity of quartic polynomials and related problems. Mathematical Programming, 2013.
2. A. A. Ahmadi and P. A. Parrilo. A complete characterization of the gap between convexity and sos-convexity. SIAM J. on Optimization, 2013.
3. K. Batselier, P. Dreesen, and B. D. Moor. The geometry of multivariate polynomial division and elimination. SIAM Journal on Matrix Analysis and Applications, 2013.
4. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. PAMI, 2001.
5. A. Ecker and A. D. Jepson. Polynomial shape from shading. In CVPR, 2010.
6. A. T. Ihler and D. A. McAllester. Particle belief propagation. In AISTATS, 2009.
7. N. Komodakis, N. Paragios, and G. Tziritas. Mrf energy minimization and beyond via dual decomposition. PAMI, 2011.
8. Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, 2009.
9. J. B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization, 2001.
10. J. B. Lasserre. Convergent sdp-relaxations in polynomial optimization with sparsity. SIAM Journal on Optimization, 2006.
11. V. Lempitsky, C. Rother, S. Roth, and A. Blake. Fusion moves for markov random field optimization. PAMI, 2010.
12. J. Nocedal and S. J. Wright. Numerical optimization 2ed. Springer-Verlag, 2006.
13. N. Noorshams and M. J. Wainwright. Belief propagation for continuous state spaces: Stochastic messagepassing with quantitative guarantees. JMLR, 2013.
14. A. Papachristodoulou, J. Anderson, G. Valmorbida, S. Prajna, P. Seiler, and P. Parrilo. Sostools version 3.00 sum of squares optimization toolbox for matlab. arXiv: 1310.4716, 2013.
15. P. A. Parrilo. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, Caltech, 2000.
16. J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, 1988.
17. J. Peng, T. Hazan, D. McAllester, and R. Urtasun. Convex max-product algorithms for continuous mrfs with applications to protein folding. In ICML, 2011.
18. S. Roth and M. J. Black. Fields of experts. IJCV, 2009.
19. R. Salakhutdinov, S. Roweis, and Z. Ghahramani. On the convergence of bound optimization algorithms. In UAI, 2002.
20. M. Salzmann. Continuous inference in graphical models with polynomial energies. In CVPR, 2013.
21. A. G. Schwing, T. Hazan, M. Pollefeys, and R. Urtasun. Distributed Message Passing for Large Scale Graphical Models. In CVPR, 2011.
22. A. G. Schwing, T. Hazan, M. Pollefeys, and R. Urtasun. Efficient Structured Prediction with Latent Variables for General Graphical Models. In ICML, 2012.
23. A. Smola, S. Vishwanathan, and T. Hofmann. Kernel methods for missing variables. AISTATS, 2005.
24. L. Song, A. Gretton, D. Bickson, Y. Low, and C. Guestrin. Kernel belief propagation. In AISTATS, 2011.
25. B. Sriperumbudur and G. Lanckriet. On the convergence of the concave-convex procedure. In NIPS'09.
26. B. Sriperumbudur, D. Torres, and G. Lanckriet. Sparse eigen methods by dc programming. In ICML'07.
27. E. B. Sudderth, A. T. Ihler, M. Isard, W. T. Freeman, and A. S. Willsky. Nonparametric belief propagation. Communications of the ACM, 2010.
28. D. J. Uherka and A. M. Sergott. On the continuous dependence of the roots of a polynomial on its coefficients. American Mathematical Monthly, 1977.
29. A. Varol, M. Salzmann, P. Fua, and R. Urtasun. A constrained latent variable model. In CVPR, 2012.
30. S. Vicente and L. Agapito. Soft inextensibility constraints for template-free non-rigid reconstruction. In ECCV, 2012.
31. Y. Weiss and W. T. Freeman. Correctness of belief propagation in gaussian graphical models of arbitrary topology. Neural computation, 2001.
32. C. N. Yu and T. Joachims. Learning structural svms with latent variables. In ICML, 2009.
33. A. L. Yuille and A. Rangarajan. The concave-convex procedure. Neural Computation, 2003.