DeepAI AI Chat
Log In Sign Up

Compact Relaxations for MAP Inference in Pairwise MRFs with Piecewise Linear Priors

by   Christopher Zach, et al.

Label assignment problems with large state spaces are important tasks especially in computer vision. Often the pairwise interaction (or smoothness prior) between labels assigned at adjacent nodes (or pixels) can be described as a function of the label difference. Exact inference in such labeling tasks is still difficult, and therefore approximate inference methods based on a linear programming (LP) relaxation are commonly used in practice. In this work we study how compact linear programs can be constructed for general piecwise linear smoothness priors. The number of unknowns is O(LK) per pairwise clique in terms of the state space size L and the number of linear segments K. This compares to an O(L^2) size complexity of the standard LP relaxation if the piecewise linear structure is ignored. Our compact construction and the standard LP relaxation are equivalent and lead to the same (approximate) label assignment.


page 19

page 20


LPQP for MAP: Putting LP Solvers to Better Use

MAP inference for general energy functions remains a challenging problem...

MAP Inference via L2-Sphere Linear Program Reformulation

Maximum a posteriori (MAP) inference is an important task for graphical ...

MAP Estimation of Semi-Metric MRFs via Hierarchical Graph Cuts

We consider the task of obtaining the maximum a posteriori estimate of d...

On Partial Opimality by Auxiliary Submodular Problems

In this work, we prove several relations between three different energy ...

Train and Test Tightness of LP Relaxations in Structured Prediction

Structured prediction is used in areas such as computer vision and natur...

Block Stability for MAP Inference

To understand the empirical success of approximate MAP inference, recent...

Finding Structure and Causality in Linear Programs

Linear Programs (LP) are celebrated widely, particularly so in machine l...