25 May 2005 Fundamental performance bounds of phase diversity blind deconvolution algorithm for various diversity polynomials, noise statistics, and scene size
Author Affiliations +
Proceedings Volume 5793, Atmospheric Propagation II; (2005); doi: 10.1117/12.606803
Event: Defense and Security, 2005, Orlando, Florida, United States
Abstract
In this paper, we will present information theoretic bounds on the estimated Zernike coefficients for various diversity phase functions. We will show that, in certain cases, defocus diversity may yield higher Cramer-Rao lower bound (CRLB) than some other diversity phase functions. Evaluating the performance of the phase diversity algorithm using simulated images, we find that for an extended scene and defocus diversity, the phase diversity algorithm achieves the CRLB for known objects and approaches the CRLB by about a factor of two for unknown objects.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jean J. Dolne, Harold B. Schall, "Fundamental performance bounds of phase diversity blind deconvolution algorithm for various diversity polynomials, noise statistics, and scene size", Proc. SPIE 5793, Atmospheric Propagation II, (25 May 2005); doi: 10.1117/12.606803; https://doi.org/10.1117/12.606803
PROCEEDINGS
11 PAGES


SHARE
KEYWORDS
Signal to noise ratio

Point spread functions

Monochromatic aberrations

Error analysis

Received signal strength

Deconvolution

Zernike polynomials

Back to Top