Tightening MRF Relaxations with Planar Subproblems

Details Tightening MRF Relaxations with Planar Subproblems Tightening MRF Relaxations with Planar Subproblems

2012-02-14

arxiv.org/abs/1202.3771v1

Computer Science

Learning

Scientific paper

We describe a new technique for computing lower-bounds on the minimum energy configuration of a planar Markov Random Field (MRF). Our method successively adds large numbers of constraints and enforces consistency over binary projections of the original problem state space. These constraints are represented in terms of subproblems in a dual-decomposition framework that is optimized using subgradient techniques. The complete set of constraints we consider enforces cycle consistency over the original graph. In practice we find that the method converges quickly on most problems with the addition of a few subproblems and outperforms existing methods for some interesting classes of hard potentials.

Affiliated with

Also associated with

No associations

Rating

Tightening MRF Relaxations with Planar Subproblems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tightening MRF Relaxations with Planar Subproblems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tightening MRF Relaxations with Planar Subproblems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90737