Solving Markov Random Fields with Spectral Relaxation

Markov Random Fields (MRFs) are used in a large array of computer vision and maching learning applications. Finding the Maximum Aposteriori (MAP) solution of an MRF is in general intractable, and one has to resort to approximate solutions, such as Belief Propagation, Graph Cuts, or more recently, approaches based on quadratic programming. We propose a novel type of approximation, Spectral relaxation to Quadratic Programming (SQP). We show our method offers tighter bounds than recently published work, while at the same time being computationally efficient. We compare our method to other algorithms on random MRFs in various settings.

[1]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  J. Besag.  On the Statistical Analysis of Dirty Pictures , 1986 .

[3]  Michael I. Jordan,et al.  Loopy Belief Propagation for Approximate Inference: An Empirical Study , 1999, UAI.

[4]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[5]  Pradeep Ravikumar,et al.  Quadratic programming relaxations for metric labeling and Markov random field MAP estimation , 2006, ICML.

[6]  William T. Freeman,et al.  Understanding belief propagation and its generalizations , 2003 .

[7]  Philip H. S. Torr,et al.  Solving Markov Random Fields using Semi Definite Programming , 2003, AISTATS.

[8]  Hiroshi Ishikawa,et al.  Exact Optimization for Markov Random Fields with Convex Priors , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Jianbo Shi,et al.  Grouping with Bias , 2001, NIPS.

[10]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[11]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[12]  Andrew Zisserman,et al.  Solving Markov Random Fields using Second Order Cone Programming Relaxations , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[13]  Martin J. Wainwright,et al.  MAP estimation via agreement on (hyper)trees: Message-passing and linear programming , 2005, ArXiv.

[14]  Steven W. Zucker,et al.  On the Foundations of Relaxation Labeling Processes , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Michael I. Jordan,et al.  Variational inference in graphical models: The view from the marginal polytope , 2008 .

[16]  W. Gander,et al.  A Constrained Eigenvalue Problem , 1989 .

[17]  William T. Freeman,et al.  On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs , 2001, IEEE Trans. Inf. Theory.

[18]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[19]  L. Pottier,et al.  Optimization of positive generalized polynomials under constraints. , 1998 .

[20]  Martial Hebert,et al.  Efficient MAP approximation for dense energy functions , 2006, ICML.