Exact Maximum A Posteriori Estimation for Binary Images
- 1 January 1989
- journal article
- research article
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 51 (2) , 271-279
- https://doi.org/10.1111/j.2517-6161.1989.tb01764.x
Abstract
In this paper, for a degraded two‐colour or binary scene, we show how the image with maximum a posteriori (MAP) probability, the MAP estimate, can be evaluated exactly using efficient variants of the Ford–Fulkerson algorithm for finding the maximum flow in a certain capacitated network. Availability of exact estimates allows an assessment of the performance of simulated annealing and of MAP estimation itself in this restricted setting. Unfortunately, the simple network flow algorithm does not extend in any obvious way to multicolour scenes. However, the results of experiments on two‐colour images suggest that, in general, simulated annealing, according to practicable ‘temperature’ schedules, can produce poor approximations to the MAP estimate to which it converges.Keywords
This publication has 4 references indexed in Scilit:
- On the Statistical Analysis of Dirty PicturesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1986
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Optimization by Simulated AnnealingScience, 1983
- Minimum cuts and related problemsNetworks, 1975