Multi-dimensional Parametric Mincuts for Constrained MAP Inference

by   Yongsub Lim, et al.
KAIST 수리과학과

In this paper, we propose novel algorithms for inferring the Maximum a Posteriori (MAP) solution of discrete pairwise random field models under multiple constraints. We show how this constrained discrete optimization problem can be formulated as a multi-dimensional parametric mincut problem via its Lagrangian dual, and prove that our algorithm isolates all constraint instances for which the problem can be solved exactly. These multiple solutions enable us to even deal with `soft constraints' (higher order penalty functions). Moreover, we propose two practical variants of our algorithm to solve problems with hard constraints. We also show how our method can be applied to solve various constrained discrete optimization problems such as submodular minimization and shortest path computation. Experimental evaluation using the foreground-background image segmentation problem with statistic constraints reveals that our method is faster and its results are closer to the ground truth labellings compared with the popular continuous relaxation based methods.


page 11

page 13

page 19


Efficient Energy Minimization for Enforcing Statistics

Energy minimization algorithms, such as graph cuts, enable the computati...

Constrained Shortest-Path Reformulations for Discrete Bilevel and Robust Optimization

Many discrete optimization problems are amenable to constrained shortest...

Reliability based-design optimization using the directional bat algorithm

Reliability based design optimization (RBDO) problems are important in e...

Submodular relaxation for inference in Markov random fields

In this paper we address the problem of finding the most probable state ...

Soft and Hard Constrained Parametric Generative Schemes for Encoding and Synthesizing Airfoils

Traditional airfoil parametric technique has significant limitation in m...

MAP inference via Block-Coordinate Frank-Wolfe Algorithm

We present a new proximal bundle method for Maximum-A-Posteriori (MAP) i...

A convex formulation for Discrete Tomography

Discrete tomography is concerned with the recovery of binary images from...

Please sign up or login with your details

Forgot password? Click here to reset