Maximum Persistency in Energy Minimization

We consider discrete pairwise energy minimization problem (weighted constraint satisfaction, max-sum labeling) and methods that identify a globally optimal partial assignment of variables. When finding a complete optimal assignment is intractable, determining optimal values for a part of variables is an interesting possibility. Existing methods are based on different sufficient conditions. We propose a new sufficient condition for partial optimality which is: (1) verifiable in polynomial time (2) invariant to reparametrization of the problem and permutation of labels and (3) includes many existing sufficient conditions as special cases. %It is derived by using a relaxation technique coherent with the relaxation for energy minimization. We pose the problem of finding the maximum optimal partial assignment identifiable by the new sufficient condition. A polynomial method is proposed which is guaranteed to assign same or larger part of variables %find the same or larger part of optimal assignment than several existing approaches. The core of the method is a specially constructed linear program that identifies persistent assignments in an arbitrary multi-label setting.

[1]  Sebastian Nowozin,et al.  A Comparative Study of Modern Inference Techniques for Discrete Energy Minimization Problems , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[2]  A. Shekhovtsov.  Exact and Partial Energy Minimization in Computer Vision , 2013 .

[3]  Fredrik Kahl,et al.  Generalized roof duality , 2012, Discret. Appl. Math..

[4]  P. Orponen,et al.  On Approximation Preserving Reductions: Complete Problems and Robust Measures (Revised Version) , 1987 .

[5]  Vladimir Kolmogorov,et al.  Potts Model, Parametric Maxflow and K-Submodular Functions , 2013, 2013 IEEE International Conference on Computer Vision.

[6]  Endre Boros,et al.  A graph cut algorithm for higher-order Markov Random Fields , 2011, 2011 International Conference on Computer Vision.

[7]  Tomás Werner,et al.  A Linear Programming Approach to Max-Sum Problem: A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Christoph Schnörr,et al.  Partial Optimality by Pruning for MAP-Inference with General Graphical Models , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Vladimir Kolmogorov,et al.  Optimizing Binary MRFs via Extended Roof Duality , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  Bruce Randall Donald,et al.  Improved Pruning algorithms and Divide-and-Conquer strategies for Dead-End Elimination, with application to protein design , 2006, ISMB.

[11]  Michael I. Jordan,et al.  Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..

[12]  I Lasters,et al.  Enhanced dead-end elimination in the search for the global minimum energy conformation of a collection of protein side chains. , 1995, Protein engineering.

[13]  Vladimir Kolmogorov,et al.  Generalized roof duality and bisubmodular functions , 2010, Discret. Appl. Math..

[14]  S. L. Mayo,et al.  Conformational splitting: A more powerful criterion for dead‐end elimination , 2000, J. Comput. Chem..

[15]  Václav Hlavác,et al.  On Partial Opimality by Auxiliary Submodular Problems , 2011, ArXiv.

[16]  Christoph Schnörr,et al.  Partial Optimality via Iterative Pruning for the Potts Model , 2013, SSVM.

[17]  Hiroshi Ishikawa,et al.  Transformation of General Binary MRF Minimization to the First-Order Case , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Daniel Cremers,et al.  Generalized Roof Duality for Multi-Label Optimization: Optimal Lower Bounds and Persistency , 2012, ECCV.

[19]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[20]  Joseph Naor,et al.  Approximation algorithms for the metric labeling problem via a new linear programming formulation , 2001, SODA '01.

[21]  Pierre Hansen,et al.  Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..

[22]  Ivan Kovtun,et al.  Partial Optimal Labeling Search for a NP-Hard Subclass of (max, +) Problems , 2003, DAGM-Symposium.

[23]  Johan Desmet,et al.  The dead-end elimination theorem and its use in protein side-chain positioning , 1992, Nature.

[24]  R. Goldstein.  Efficient rotamer elimination applied to protein side-chains and related spin glasses. , 1994, Biophysical journal.

[25]  Vladimir Kolmogorov,et al.  On partial optimality in multi-label MRFs , 2008, ICML '08.

[26]  S. H. Lu,et al.  Roof duality for polynomial 0–1 optimization , 1987, Math. Program..

[27]  M. Shlezinger.  Syntactic analysis of two-dimensional visual signals in the presence of noise , 1976 .

[28]  Endre Boros,et al.  Preprocessing of unconstrained quadratic binary optimization , 2006 .

[29]  J. C. Picard,et al.  On the integer-valued variables in the linear vertex packing problem , 1977, Math. Program..

[30]  Endre Boros,et al.  Pseudo-Boolean optimization , 2002, Discret. Appl. Math..

[31]  Arie M. C. A. Koster,et al.  The partial constraint satisfaction problem: Facets and lifting theorems , 1998, Oper. Res. Lett..

[32]  Philip H. S. Torr,et al.  LP-relaxation of Binarized Energy Minimization ( Version 1 . 50 ) , 2008 .

[33]  Vladimir Kolmogorov,et al.  Minimizing Nonsubmodular Functions with Graph Cuts-A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[34]  Hanif D. Sherali,et al.  Persistency in 0-1 Polynomial Programming , 1998, Math. Oper. Res..

[35]  Pushmeet Kohli,et al.  Reduce, reuse & recycle: Efficiently solving multi-label MRFs , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.