Planar Cycle Covering Graphs

Details Planar Cycle Covering Graphs Planar Cycle Covering Graphs

2011-04-06

arxiv.org/abs/1104.1204v1

Statistics

Machine Learning

Scientific paper

We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture the effect of unary potentials. A ground state of the resulting approximation can be computed efficiently by reduction to minimum-weight perfect matching. We show that optimization of variational parameters achieves the same lower-bound as dual-decomposition into the set of all cycles of the original graph. We demonstrate that our variational optimization converges quickly and provides high-quality solutions to hard combinatorial problems 10-100x faster than competing algorithms that optimize the same bound.

Affiliated with

Also associated with

No associations

Rating

Planar Cycle Covering Graphs 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 Planar Cycle Covering Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Planar Cycle Covering Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-717630