Multilabel partition moves for MRF optimization

This paper presents new graph-cut based optimization algorithms for image processing problems. Popular graph-cut based algorithms give approximate solutions and are based on the concept of partition move. The main contribution of this work consists in proposing novel partition moves called multilabel moves to minimize Markov random field (MRF) energies with convex prior and any likelihood energy functions. These moves improve the optimum quality of the state-of-the-art approximate minimization algorithms while controlling the memory need of the algorithm at the same time. Thus, the two challenging problems, improving local optimum quality and reducing required memory for graph construction are handled with our approach. These new performances are illustrated on some image processing experiments, such as image restoration and InSAR phase unwrapping.

[1]  Nikos Komodakis,et al.  Approximate Labeling via Graph Cuts Based on Linear Programming , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  R. Zabih,et al.  Efficient Graph-Based Energy Minimization Methods in Computer Vision , 1999 .

[4]  Nikos Komodakis,et al.  Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual strategies , 2008, Comput. Vis. Image Underst..

[5]  Richard Szeliski,et al.  A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Jérôme Darbon,et al.  A graph-cut based algorithm for approximate MRF optimization , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

[7]  Jérôme Darbon,et al.  Image Restoration with Discrete Constrained Total Variation Part II: Levelable Functions, Convex Priors and Non-Convex Cases , 2006, Journal of Mathematical Imaging and Vision.

[8]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[9]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Olga Veksler.  Multi-label Moves for MRFs with Truncated Convex Priors , 2009, EMMCVPR.

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

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

[13]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

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

[15]  Andrew Blake,et al.  Fusion Moves for Markov Random Field Optimization , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  K Itoh,et al.  Analysis of the phase unwrapping algorithm. , 1982, Applied optics.

[18]  Jérôme Darbon,et al.  SAR IMAGE REGULARIZATION WITH GRAPH-CUTS BASED FAST APPROXIMATE DISCRETE MINIMIZATION , 2009 .

[19]  Giampaolo Ferraioli,et al.  Multichannel Phase Unwrapping With Graph Cuts , 2009, IEEE Geoscience and Remote Sensing Letters.

[20]  Peter Carr,et al.  Solving Multilabel Graph Cut Problems with Multilabel Swap , 2009, 2009 Digital Image Computing: Techniques and Applications.

[21]  Fuk K. Li,et al.  Synthetic aperture radar interferometry , 2000, Proceedings of the IEEE.

[22]  José M. Bioucas-Dias,et al.  Phase Unwrapping via Graph Cuts , 2007, IEEE Trans. Image Process..

[23]  Jérôme Darbon.  Composants logiciels et algorithmes de minimisation exacte d'énergies dédiées au traitement des images , 2005 .

[24]  Pushmeet Kohli,et al.  Exact inference in multi-label CRFs with higher order cliques , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[25]  Jérôme Darbon,et al.  Global optimization for first order Markov Random Fields with submodular priors , 2008, Discret. Appl. Math..

[26]  Vito Pascazio,et al.  Maximum a posteriori estimation of height profiles in InSAR imaging , 2004, IEEE Geoscience and Remote Sensing Letters.

[27]  Vito Pascazio,et al.  Maximum a posteriori height estimation in InSAR imaging , 2002, IEEE International Geoscience and Remote Sensing Symposium.

[28]  Stochastic Relaxation , 2014, Computer Vision, A Reference Guide.

[29]  P. L. Ivanescu.  Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .

[30]  Jérôme Darbon,et al.  Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization , 2006, Journal of Mathematical Imaging and Vision.

[31]  Olga Veksler.  Graph Cut Based Optimization for MRFs with Truncated Convex Priors , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[32]  G. B. Smith,et al.  Preface to S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images” , 1987 .