MAP Estimation of Semi-Metric MRFs via Hierarchical Graph Cuts

by   M. Pawan Kumar, et al.

We consider the task of obtaining the maximum a posteriori estimate of discrete pairwise random fields with arbitrary unary potentials and semimetric pairwise potentials. For this problem, we propose an accurate hierarchical move making strategy where each move is computed efficiently by solving an st-MINCUT problem. Unlike previous move making approaches, e.g. the widely used a-expansion algorithm, our method obtains the guarantees of the standard linear programming (LP) relaxation for the important special case of metric labeling. Unlike the existing LP relaxation solvers, e.g. interior-point algorithms or tree-reweighted message passing, our method is significantly faster as it uses only the efficient st-MINCUT algorithm in its design. Using both synthetic and real data experiments, we show that our technique outperforms several commonly used algorithms.


An Efficient Message-Passing Algorithm for the M-Best MAP Problem

Much effort has been directed at algorithms for obtaining the highest pr...

Continuous Multiclass Labeling Approaches and Algorithms

We study convex relaxations of the image labeling problem on a continuou...

Accelerated Message Passing for Entropy-Regularized MAP Inference

Maximum a posteriori (MAP) inference in discrete-valued Markov random fi...

Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation

Computing maximum a posteriori (MAP) estimation in graphical models is a...

Truncated Max-of-Convex Models

Truncated convex models (TCM) are a special case of pairwise random fiel...

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

Label assignment problems with large state spaces are important tasks es...

Efficient Linear Programming for Dense CRFs

The fully connected conditional random field (CRF) with Gaussian pairwis...

Please sign up or login with your details

Forgot password? Click here to reset