ML Anthology

Efficient Parallel Estimation for Markov Random Fields

Michael J. Swain, Lambert E. Wixson, Paul B. Chou
UAI 1989
/uai/1989/swain1989uai-efficient/

Abstract

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.

PDF UAI Semantic Scholar

Cite

Text

Swain et al. "Efficient Parallel Estimation for Markov Random Fields." Conference on Uncertainty in Artificial Intelligence, 1989.

Markdown

[Swain et al. "Efficient Parallel Estimation for Markov Random Fields." Conference on Uncertainty in Artificial Intelligence, 1989.](https://mlanthology.org/uai/1989/swain1989uai-efficient/)

BibTeX

@inproceedings{swain1989uai-efficient,
  title     = {{Efficient Parallel Estimation for Markov Random Fields}},
  author    = {Swain, Michael J. and Wixson, Lambert E. and Chou, Paul B.},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1989},
  url       = {https://mlanthology.org/uai/1989/swain1989uai-efficient/}
}