Efficient Parallel Estimation for Markov Random Fields

03/27/2013

∙

We present a new, deterministic, distributed MAP estimation algorithm for Markov Random Fields called Local Highest Confidence First (Local HCF). The algorithm has been applied to segmentation problems in computer vision and its performance compared with stochastic algorithms. The experiments show that Local HCF finds better estimates than stochastic algorithms with much less computation.

READ FULL TEXT

Efficient Parallel Estimation for Markov Random Fields

Linear and Parallel Learning of Markov Random Fields

Subset Selection for Gaussian Markov Random Fields

Tree-based iterated local search for Markov random fields with applications in image analysis

Learning Combinatorial Structures via Markov Random Fields with Sampling through Lovász Local Lemma

Improving confidence while predicting trends in temporal disease networks

Stochastic Learning for Sparse Discrete Markov Random Fields with Controlled Gradient Approximation Error

Newton-type Methods for Inference in Higher-Order Markov Random Fields

Efficient Parallel Estimation for Markov Random Fields

Related Research

Linear and Parallel Learning of Markov Random Fields

Subset Selection for Gaussian Markov Random Fields

Tree-based iterated local search for Markov random fields with applications in image analysis

Learning Combinatorial Structures via Markov Random Fields with Sampling through Lovász Local Lemma

Improving confidence while predicting trends in temporal disease networks

Stochastic Learning for Sparse Discrete Markov Random Fields with Controlled Gradient Approximation Error

Newton-type Methods for Inference in Higher-Order Markov Random Fields