Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints

Details Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints

2011-03-05

arxiv.org/abs/1103.1077v1

Computer Science

Computer Vision and Pattern Recognition

17 pages. Shorter version to appear in CVPR 2011

Scientific paper

In the paper we address the problem of finding the most probable state of discrete Markov random field (MRF) with associative pairwise terms. Although of practical importance, this problem is known to be NP-hard in general. We propose a new type of MRF decomposition, submodular decomposition (SMD). Unlike existing decomposition approaches SMD decomposes the initial problem into subproblems corresponding to a specific class label while preserving the graph structure of each subproblem. Such decomposition enables us to take into account several types of global constraints in an efficient manner. We study theoretical properties of the proposed approach and demonstrate its applicability on a number of problems.

Affiliated with

Also associated with

No associations

Rating

Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints 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 Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8979