Efficient Algorithms for Least-Squares Restoration

Cheung Auyeung; Russell M. Mersereau

doi:10.1117/12.970162

1 November 1989 Efficient Algorithms for Least-Squares Restoration

Cheung Auyeung, Russell M. Mersereau

Proceedings Volume 1199, Visual Communications and Image Processing IV; (1989) https://doi.org/10.1117/12.970162
Event: 1989 Symposium on Visual Communications, Image Processing, and Intelligent Robotics Systems, 1989, Philadelphia, PA, United States

Abstract

This paper introduces a new algorithm for the restoration of black and white photographic images that have been distorted by linear blurs and additive noise. The algorithm is iterative and particularly efficient for one-dimensional causal distortions, such as motion blur, and one- and two-dimensional symmetric distortions, such as out-of-focus blurs. It involves solving sets of Toeplitz or block Toeplitz linear equations. The algorithm is illustrated using an example involving motion blur.

Citation Download Citation

Cheung Auyeung and Russell M. Mersereau "Efficient Algorithms for Least-Squares Restoration", Proc. SPIE 1199, Visual Communications and Image Processing IV, (1 November 1989); https://doi.org/10.1117/12.970162

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