An efficient algorithm used for full-field optical coherence tomography

An efficient algorithm for computing optical coherence tomography is presented, which is based on the discrete differences of a time/depth sequence of interferograms. The existing multiple-step phase-shift algorithms, including those solved from Carré and Hariharan equations as well as circular-step algorithm proposed by Dubois et al., are analyzed and compared with the proposed algorithm. The analytical and experimental results show the computational efficiency of the new algorithm outperforms others. The simulations also demonstrate that the algorithm based on derivatives of four phase-shifted images is less sensitive to the phase-shift noise comparing to traditional 4-step phase-shift-based algorithm.