Bayesian decision feedback for segmentation of binary images

We present real-time algorithms for the segmentation of binary images modeled by Markov mesh random fields (MMRF’s) and corrulpted by independent noise. The goal is to find a recursive algorithm to compute the maximum U posteriori (MAP) estimate of each pixel of the scene using a fixed lookahead of D rows and D columns of the observations. First, this MAP fixed-lag estimation problem is set up and the corresponding optimal recursive (but computationally complex) estimator is derived. Then, both hard and soft (conditional) decision feedbacks are introduced at appropriate stages of the optimal estimator to reduce the complexity. The algorithm is applied to several synthetic and real imaiges. The results demonstrate the viability of the algorithm both complexity-wise and performance-wise, and show its subjective relevance to the image segmentation problem.