Abstract

Simulated annealing (SA) is a robust, stable, but computationally costly method for solving ill-posed image-restoration problems. We describe the use of a backprojection operator that identifies those regions of an object estimate that have the greatest likelihood of being in error at each step of the SA process. This reduces computational time by concentrating the computing effort of SA on those pixels most effective in reducing the reconstruction error. The performance of an area-adaptive SA algorithm is evaluated for the restoration of images blurred by a simple pillbox space-invariant and a biconical space-variant point-spread function typical of a depth-measuring optical system.

© 1994 Optical Society of America

Analysis of the cost function used in simulated annealing for CT image reconstruction

Hideaki Haneishi, Tadaaki Masuda, Nagaaki Ohyama, Toshio Honda, and Jumpei Tsujiuchi
Appl. Opt. 29(2) 259-265 (1990)

Image restoration by adaptive-neighborhood noise subtraction

Raman B. Paranjape, Tamer F. Rabie, and Rangaraj M. Rangayyan
Appl. Opt. 33(14) 2861-2869 (1994)

Phase optimization of a kinoform by simulated annealing

Nobukazu Yoshikawa and Toyohiko Yatagai
Appl. Opt. 33(5) 863-868 (1994)

Numerical simulations and restorations of laser droplet-slicing images

Jingyi Zhang and Lynn A. Melton
Appl. Opt. 33(2) 192-200 (1994)

Restoration of images of partially obscured objects

Peter F. Jones and George J. M. Aitken
J. Opt. Soc. Am. A 14(5) 1015-1023 (1997)