Optical Coherence Tomography 2015
DOI: 10.1007/978-3-319-06419-2_28
|View full text |Cite
|
Sign up to set email alerts
|

Digital Holoscopy

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 27 publications
0
1
0
Order By: Relevance
“…Although the NDFT algorithm provides the most exact reconstruction result, the slow computation speed hinders its real-time application. Non-uniform FFT (NUFFT) is an approximation of the NDFT algorithm with much faster processing speed [11] , and has been recently implemented in FD-OCT. KaiserBessel (KB) kernel [12,13] and Gaussian kernel [14,15] have been independently used as the convolution kernel function for NUFFT. The selection of convolution kernel function is investigated by Chan et al, and the Gaussian kernel function is considered to be a better choice for on-thefly data processing [15] .…”
mentioning
confidence: 99%
“…Although the NDFT algorithm provides the most exact reconstruction result, the slow computation speed hinders its real-time application. Non-uniform FFT (NUFFT) is an approximation of the NDFT algorithm with much faster processing speed [11] , and has been recently implemented in FD-OCT. KaiserBessel (KB) kernel [12,13] and Gaussian kernel [14,15] have been independently used as the convolution kernel function for NUFFT. The selection of convolution kernel function is investigated by Chan et al, and the Gaussian kernel function is considered to be a better choice for on-thefly data processing [15] .…”
mentioning
confidence: 99%