Share Email Print

Optical Engineering

Step Size For The General Iterative Image Recovery Algorithm
Author(s): C. I. Podilchuk; R. J. Mammone
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A general iterative method of restoring linearly degraded images [R. J. Mammone and R. J. Rothacker, J. Opt. Soc. Am. A4(1), 208-215 (1987)] has been reformulated into a more tractable fixed point iterative procedure. The new formulation is an implementation of the steepest descent algorithm. The slow convergence of the original method is found to be due to its inherent step size. A new method is presented whose increased step size offers accelerated convergence. The realization of the accelerated method is shown to require only a minor modification of the original algorithm. A new stopping criterion is also introduced. Computer simulations demonstrate a significant improvement in the rate of convergence of the new method.

Paper Details

Date Published: 1 September 1988
PDF: 6 pages
Opt. Eng. 27(9) 279806 doi: 10.1117/12.7976765
Published in: Optical Engineering Volume 27, Issue 9
Show Author Affiliations
C. I. Podilchuk, Rutgers University (United States)
R. J. Mammone, Rutgers University (United States)

© SPIE. Terms of Use
Back to Top