Submodular decomposition framework for inference in associative Markov networks with global constraints

@article{Osokin2011SubmodularDF,
  title={Submodular decomposition framework for inference in associative Markov networks with global constraints},
  author={A. Osokin and D. Vetrov and V. Kolmogorov},
  journal={CVPR 2011},
  year={2011},
  pages={1889-1896}
}
  • A. Osokin, D. Vetrov, V. Kolmogorov
  • Published 2011
  • Computer Science, Mathematics
  • CVPR 2011
  • In this 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, submod-ular decomposition (SMD). Unlike existing decomposition approaches SMD decomposes the initial problem into sub-problems corresponding to a specific class label while preserving the graph structure of each subproblem. Such… CONTINUE READING

    Figures and Topics from this paper.

    A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems
    • 148
    • PDF
    A Survey and Comparison of Discrete and Continuous Multi-label Optimization Approaches for the Potts Model
    • 63
    • PDF
    Higher-order segmentation via multicuts
    • 38
    • PDF
    Submodular Relaxation for Inference in Markov Random Fields
    • 5
    • PDF
    Submodular Relaxation for MRFs with High-Order Potentials
    • 4
    How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?
    • 5
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 50 REFERENCES
    Probabilistic reasoning in intelligent systems - networks of plausible inference
    • J. Pearl
    • Computer Science, Philosophy
    • 1989
    • 17,403
    • PDF
    Fast approximate energy minimization via graph cuts
    • 2,901
    • PDF
    MAP estimation via agreement on trees: message-passing and linear programming
    • 705
    • PDF
    Graph Cuts and Efficient N-D Image Segmentation
    • 1,941
    • PDF
    Exact Optimization for Markov Random Fields with Convex Priors
    • 593
    • PDF
    What energy functions can be minimized via graph cuts?
    • 1,490
    • PDF
    Convergent Tree-Reweighted Message Passing for Energy Minimization
    • 1,259
    • PDF
    A Linear Programming Approach to Max-Sum Problem: A Review
    • 391
    • PDF
    Graphical Models
    • 2,524
    • PDF