z-logo
open-access-imgOpen Access
Relation of joint spectral and time domain optical coherence tomography (jSTdOCT) and phase-resolved Doppler OCT
Author(s) -
Julia Walther,
Edmund Koch
Publication year - 2014
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.22.023129
Subject(s) - optical coherence tomography , optics , doppler effect , physics , fourier transform , time domain , spectral density , signal (programming language) , signal to noise ratio (imaging) , noise (video) , coherence (philosophical gambling strategy) , computer science , telecommunications , quantum mechanics , astronomy , artificial intelligence , image (mathematics) , computer vision , programming language
A variety of promising approaches for quantitative flow velocity measurement in OCT have been proposed in recent years. The question is: Which method gets the most precise flow velocity out of the interference signals detected. We have compared the promising joint spectral and time domain optical coherence tomography (jSTdOCT) and the commonly used phase-resolved Doppler OCT (DOCT) and describe the link between these two proven methods for OCT in the Fourier domain (FD OCT). First, we show that jSTdOCT can be significantly improved by calculating the center of gravity via an unbiased complex algorithm instead of detecting the maximum intensity signal of the broadened Doppler frequency spectrum. Secondly, we introduce a unified mathematical description for DOCT and jSTdOCT that differs only in one exponent and call it enhjSTdOCT. Third, we present that enhjSTdOCT has the potential to significantly reduce the noise of the velocity measurement by choosing an exponent depending on the transverse sample velocity component and the signal-to-noise ratio. EnhjSTdOCT is verified numerically and experimentally to find the optimal parameters for maximal velocity noise reduction.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here