Image restoration by parallel simulated annealing using compound Gauss-Markov models
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. it 36 (15206149) , 2961-2964 vol.4
- https://doi.org/10.1109/icassp.1991.151024
Abstract
A parallel simulated annealing algorithm is presented for image restoration using a compound Gauss-Markov field model for the image. Results are provided for its implementation on a distributed array processor (DAP510) which is a single instruction multiple data (SIMD) machine with 1024(32*32) mesh-connected processor elements, and a clock rate of 10 MHz. The total time required for restoring a monochrome blurred and noisy image with continuous range of intensities is reduced to about 10 minutes as compared to 20 hours for its sequential implementation (VAX11/785). Both the maximum a posteriori (MAP) and minimum mean square error (MMSE) estimates of the original image are obtained. The parallel estimates are shown, as well as the sequential estimate and the classical Wiener filter estimate.<>Keywords
This publication has 5 references indexed in Scilit:
- Parallel algorithms for 2D Kalman filteringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Simulated annealing in compound Gaussian random fields (image processing)IEEE Transactions on Information Theory, 1990
- A parallel approach to the picture restoration algorithm of Geman and Geman on an SIMD machineImage and Vision Computing, 1986
- Non-Convex OptimizationPublished by SPIE-Intl Soc Optical Eng ,1986
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984