Fast 3D blind deconvolution of even point spread functions

Andrew E. Yagle; Siddharth Shah

doi:10.1117/12.529337

13 July 2004 Fast 3D blind deconvolution of even point spread functions

Andrew E. Yagle, Siddharth Shah

Proceedings Volume 5324, Three-Dimensional and Multidimensional Microscopy: Image Acquisition and Processing XI; (2004) https://doi.org/10.1117/12.529337
Event: Biomedical Optics 2004, 2004, San Jose, CA, United States

Abstract

3-D images obtained from optical sectioning microscopy are usually degraded by a point-spread function that is known to be an even function but is otherwise only approximately known, or even entirely unknown. We present a new algorithm for 3-D blind deconvolution of even point-spread functions that is both fast and (in the absence of noise) exact. Fourier transforms decouple the problem into 2-D, then 1-D blind deconvolution problems, greatly increasing computational speed. Numerical simulations demonstrate that the blind algorithm seems to perform both faster and more accurately than the non-blind iterative Lucy-Richardson algorithm.

Citation Download Citation

Andrew E. Yagle and Siddharth Shah "Fast 3D blind deconvolution of even point spread functions", Proc. SPIE 5324, Three-Dimensional and Multidimensional Microscopy: Image Acquisition and Processing XI, (13 July 2004); https://doi.org/10.1117/12.529337

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