Step Size For The General Iterative Image Recovery Algorithm

C. I. Podilchuk; R. J. Mammone

doi:10.1117/12.7976765

1 September 1988 Step Size For The General Iterative Image Recovery Algorithm

C. I. Podilchuk, R. J. Mammone

Author Affiliations +

Optical Engineering, Vol. 27, Issue 9, 279806 (September 1988). https://doi.org/10.1117/12.7976765

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.

Citation Download Citation

C. I. Podilchuk and R. J. Mammone "Step Size For The General Iterative Image Recovery Algorithm," Optical Engineering 27(9), 279806 (1 September 1988). https://doi.org/10.1117/12.7976765

Published: 1 September 1988

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE