On the computation of the coherent point-spread function using a low-complexity representation

Saeed Bagheri, Daniela Pucci De Parias, George Barbastathis, Mark A Neifeld

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish (US)
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
Volume6311
DOIs
StatePublished - 2006
EventOptical Information Systems IV - San Diego, CA, United States
Duration: Aug 16 2006Aug 17 2006

Other

OtherOptical Information Systems IV
CountryUnited States
CitySan Diego, CA
Period8/16/068/17/06

Fingerprint

Optical transfer function
point spread functions
numerical stability
Function evaluation
Convergence of numerical methods
numerical integration
Fast Fourier transforms
Numerical methods
Diffraction
costs
Data storage equipment
oscillations
evaluation
diffraction
Costs

Keywords

  • Diffraction
  • Fourier transforms
  • Numerical approximation and analysis
  • Point-spread function

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Bagheri, S., Pucci De Parias, D., Barbastathis, G., & Neifeld, M. A. (2006). On the computation of the coherent point-spread function using a low-complexity representation. In Proceedings of SPIE - The International Society for Optical Engineering (Vol. 6311). [631108] https://doi.org/10.1117/12.680632

On the computation of the coherent point-spread function using a low-complexity representation. / Bagheri, Saeed; Pucci De Parias, Daniela; Barbastathis, George; Neifeld, Mark A.

Proceedings of SPIE - The International Society for Optical Engineering. Vol. 6311 2006. 631108.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bagheri, S, Pucci De Parias, D, Barbastathis, G & Neifeld, MA 2006, On the computation of the coherent point-spread function using a low-complexity representation. in Proceedings of SPIE - The International Society for Optical Engineering. vol. 6311, 631108, Optical Information Systems IV, San Diego, CA, United States, 8/16/06. https://doi.org/10.1117/12.680632
Bagheri S, Pucci De Parias D, Barbastathis G, Neifeld MA. On the computation of the coherent point-spread function using a low-complexity representation. In Proceedings of SPIE - The International Society for Optical Engineering. Vol. 6311. 2006. 631108 https://doi.org/10.1117/12.680632
Bagheri, Saeed ; Pucci De Parias, Daniela ; Barbastathis, George ; Neifeld, Mark A. / On the computation of the coherent point-spread function using a low-complexity representation. Proceedings of SPIE - The International Society for Optical Engineering. Vol. 6311 2006.
@inproceedings{85bae60e308344a792a20850bb6bf1cc,
title = "On the computation of the coherent point-spread function using a low-complexity representation",
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.",
keywords = "Diffraction, Fourier transforms, Numerical approximation and analysis, Point-spread function",
author = "Saeed Bagheri and {Pucci De Parias}, Daniela and George Barbastathis and Neifeld, {Mark A}",
year = "2006",
doi = "10.1117/12.680632",
language = "English (US)",
isbn = "0819463906",
volume = "6311",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",

}

TY - GEN

T1 - On the computation of the coherent point-spread function using a low-complexity representation

AU - Bagheri, Saeed

AU - Pucci De Parias, Daniela

AU - Barbastathis, George

AU - Neifeld, Mark A

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - Diffraction

KW - Fourier transforms

KW - Numerical approximation and analysis

KW - Point-spread function

UR - http://www.scopus.com/inward/record.url?scp=33750685661&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750685661&partnerID=8YFLogxK

U2 - 10.1117/12.680632

DO - 10.1117/12.680632

M3 - Conference contribution

AN - SCOPUS:33750685661

SN - 0819463906

SN - 9780819463906

VL - 6311

BT - Proceedings of SPIE - The International Society for Optical Engineering

ER -