A fast image restoration algorithm based on simulated annealing

A fast algorithm is proposed for image restoration based on simulated annealing. In the SA based method, the image restoration is modeled as an optimization problem, whose cost function is to be minimized by the SA. The advantage of the SA based method is that the complicated a priori constraints can be easily incorporated by the appropriate modification of the cost function in SA and that it can be used to solve ill-posed restoration problems. The disadvantage is it takes a large computation cost. The fast algorithm is proposed to reduce the large computation cost.

[1]  Ramakrishna Kakarala,et al.  High resolution image reconstruction by simulated annealing , 1994 .

[2]  Yen-Wei Chen,et al.  A hybrid GA/SA approach to blind deconvolution , 1998, 1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111).

[3]  Yen-Wei Chen,et al.  Restoration of gray images based on a genetic algorithm with Laplacian constraint , 1999, Fuzzy Sets Syst..

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  B. C. McCallum Blind deconvolution by simulated annealing , 1990 .