Blind image deconvolution for symmetric blurs by polynomial factorization

Edmund Yin-mun Lam; Joseph W. Goodman

doi:10.1117/12.355064

19 July 1999 Blind image deconvolution for symmetric blurs by polynomial factorization

Proceedings Volume 3749, 18th Congress of the International Commission for Optics; (1999) https://doi.org/10.1117/12.355064
Event: ICO XVIII 18th Congress of the International Commission for Optics, 1999, San Francisco, CA, United States

Abstract

In image acquisition, the captured image is often the result of the object being convolved with a blur. Deconvolution is necessary to undo the effects of the blur. However, in reality we often know very little of its exact structure, and therefore we have to perform blind deconvolution. Most existing methods are computationally intensive, Here, we show that if the blur is symmetric, we have an efficient algorithm for deconvolution based on polynomial factorization in the z-domain.

Citation Download Citation

Edmund Yin-mun Lam and Joseph W. Goodman "Blind image deconvolution for symmetric blurs by polynomial factorization", Proc. SPIE 3749, 18th Congress of the International Commission for Optics, (19 July 1999); https://doi.org/10.1117/12.355064

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