DeepAI AI Chat
Log In Sign Up

Efficient Energy Minimization for Enforcing Statistics

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

Energy minimization algorithms, such as graph cuts, enable the computation of the MAP solution under certain probabilistic models such as Markov random fields. However, for many computer vision problems, the MAP solution under the model is not the ground truth solution. In many problem scenarios, the system has access to certain statistics of the ground truth. For instance, in image segmentation, the area and boundary length of the object may be known. In these cases, we want to estimate the most probable solution that is consistent with such statistics, i.e., satisfies certain equality or inequality constraints. The above constrained energy minimization problem is NP-hard in general, and is usually solved using Linear Programming formulations, which relax the integrality constraints. This paper proposes a novel method that finds the discrete optimal solution of such problems by maximizing the corresponding Lagrangian dual. This method can be applied to any constrained energy minimization problem whose unconstrained version is polynomial time solvable, and can handle multiple, equality or inequality, and linear or non-linear constraints. We demonstrate the efficacy of our method on the foreground/background image segmentation problem, and show that it produces impressive segmentation results with less error, and runs more than 20 times faster than the state-of-the-art LP relaxation based approaches.


page 8

page 9

page 10

page 11

page 15

page 16


Multi-dimensional Parametric Mincuts for Constrained MAP Inference

In this paper, we propose novel algorithms for inferring the Maximum a P...

Complexity of Discrete Energy Minimization Problems

Discrete energy minimization is widely-used in computer vision and machi...

Self-supervised Equality Embedded Deep Lagrange Dual for Approximate Constrained Optimization

Conventional solvers are often computationally expensive for constrained...

Guaranteed Parameter Estimation for Discrete Energy Minimization

Structural learning, a method to estimate the parameters for discrete en...

Submodular relaxation for inference in Markov random fields

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

Partial Optimality by Pruning for MAP-Inference with General Graphical Models

We consider the energy minimization problem for undirected graphical mod...