Share Email Print

Proceedings Paper

On the computation of the coherent point-spread function using a low-complexity representation
Author(s): Saeed Bagheri; Daniela Pucci de Farias; George Barbastathis; Mark A. Neifeld
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Computation of the coherent point-spread function (PSF) involves evaluation of the diffraction integral, which is an integration of a highly oscillating function. This oscillation becomes severe as the value of defocus increases and thus makes PSF computation a costly task. We present a novel algorithm for computing the PSF, which works efficiently for any arbitrarily large value of defocus. It is theoretically proved that the complexity of our new algorithm does not depend on the value of defocus. We also develop an implementation scheme for the new algorithm. Using this implementation we experimentally demonstrate the low complexity of our method. We quantify the rapid convergence and numerical stability of this method over all ranges of defocus. Finally, we compare the computational cost of this method, in terms of time and memory, with other numerical methods such as direct numerical integration and the Fast Fourier Transform.

Paper Details

Date Published: 30 August 2006
PDF: 15 pages
Proc. SPIE 6311, Optical Information Systems IV, 631108 (30 August 2006); doi: 10.1117/12.680632
Show Author Affiliations
Saeed Bagheri, Massachusetts Institute of Technology (United States)
Daniela Pucci de Farias, Massachusetts Institute of Technology (United States)
George Barbastathis, Massachusetts Institute of Technology (United States)
Mark A. Neifeld, Univ. of Arizona (United States)

Published in SPIE Proceedings Vol. 6311:
Optical Information Systems IV
Bahram Javidi; Demetri Psaltis; H. John Caulfield, Editor(s)

© SPIE. Terms of Use
Back to Top