Approximate recursive algorithm for finding MAP of binary Markov random fields
MetadataVis full innførsel
The purpose of this study was to develop a recursive algorithm for computing a maximum a posteriori (MAP) estimate of a binary Markov random field (MRF) by using the MAP-MRF framework. We also discuss how to include an approximation in the recursive scheme, so that the algorithm becomes computationally feasible also for larger problems. In particular, we discuss how our algorithm can be used in an image analysis setting. We consider a situation where an unobserved latent field is assumed to follow a Markov random field prior model, a Gaussian noise-corrupted version of the latent field is observed, and we estimate the unobserved field by the MAP estimator.