MRF model-based algorithms for image segmentation
The authors empirically compare three algorithms for segmenting simple, noisy images: simulated annealing (SA), iterated conditional modes (ICM), and maximizer of the posterior marginals (MPM). All use Markov random field (MRF) models to include prior contextual information. The comparison is based on artificial binary images which are degraded by Gaussian noise. Robustness is tested with correlated noise and with object and background textured. The ICM algorithm is evaluated when the degradation and model parameters must be estimated, in both supervised and unsupervised modes and on two real images. The results are assessed by visual inspection and through a numerical criterion. It is concluded that contextual information from MRF models improves segmentation when the number of categories and the degradation model are known and that parameters can be effectively estimated. None of the three algorithms is consistently best, but the ICM algorithm is the most robust. The energy of the a posteriori distribution is not always minimized at the best segmentation.<<ETX>>