Abstract
A generalized iterative restoration algorithm for linearly degraded images is presented, based on the singular value decomposition of the degradation operator. Covergence of the algorithm is accelerated by imposing constraints on the solution. Realizations of the restoration algorithm for various types of degradation are presented, and the analogy to a modified version of the method by Gerchberg [ Opt. Acta 21, 709 ( 1974)] and Papoulis [ IEEE Trans. Circuits Syst. CAS-22, 735 ( 1975)] is discussed. Results from computer-simulated images are given, and the effects of noise on the restored images are considered. The performance of the algorithm is found to be superior to that of pseudoinverse techniques.
© 1987 Optical Society of America
Full Article | PDF ArticleMore Like This
W. Duane Montgomery
Opt. Lett. 7(1) 1-3 (1982)
David O. Walsh and Pamela A. Nielsen-Delaney
J. Opt. Soc. Am. A 11(2) 572-579 (1994)
Satoshi Kawata and Yoshiki Ichioka
J. Opt. Soc. Am. 70(7) 762-768 (1980)