Iterative Image Restoration Algorithms

Aggelos K. Katsaggelos

doi:10.1117/12.7977030

1 July 1989 Iterative Image Restoration Algorithms

Aggelos K. Katsaggelos

Author Affiliations +

Optical Engineering, Vol. 28, Issue 7, 287735 (July 1989). https://doi.org/10.1117/12.7977030

Abstract

This tutorial paper discusses the use of successive-approximation-based iterative restoration algorithms for the removal of linear blurs and noise from images. Iterative algorithms are particularly attractive for this application because they allow for the incorporation of prior knowledge about the class of feasible solutions, because they can be used to remove nonstationary blurs, and because they are fairly robust with respect to errors in the approximation of the blurring operator. Regularization is introduced as a means for preventing the excessive noise magnification that is typically associated with ill-posed inverse problems such as the deblurring problem. Iterative algorithms with higher convergence rates and a multistep iterative algorithm are also discussed. A number of examples are presented.

Citation Download Citation

Aggelos K. Katsaggelos "Iterative Image Restoration Algorithms," Optical Engineering 28(7), 287735 (1 July 1989). https://doi.org/10.1117/12.7977030

Published: 1 July 1989

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

Includes PDF, HTML & Video, when available