Efficient Parallel Estimation for Markov Random Fields

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.

Paper

References (12)

09Steele1987 · "C*: An Extended C Language for Data Parallel Pro­ gramming," Technical Report PL87-5, Thinking Machines Corporation, April
10C*: An Extended C Language for Data Parallel Pro­ gramming1987 · Thinking Machines Corporation
11Probabalistic Solution oflll-Posed 368 Problems in Computational Vision1985 · Proceed­ ings of the Image Understanding Workshop, De­ cember

Similar papers

© 2026 NYSGPT2525 LLC