z-logo
open-access-imgOpen Access
Algorithm for reconstructing wide space-bandwidth information in parallel two-step phase-shifting digital holography
Author(s) -
Tatsuki Tahara,
Yuki Shimozato,
Peng Xia,
Yasunori Ito,
Yasuhiro Awatsuji,
K. Nishio,
Shogo Ura,
Osamu Matoba,
Toshihiro Kubota
Publication year - 2012
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.20.019806
Subject(s) - fourier transform , optics , digital holography , holography , interferometry , bandwidth (computing) , computer science , pixel , holographic interferometry , spatial light modulator , spatial frequency , frequency domain , electronic speckle pattern interferometry , diffraction , fast fourier transform , digital holographic microscopy , algorithm , physics , computer vision , telecommunications , quantum mechanics
We propose an image-reconstruction algorithm of parallel phase-shifting digital holography (PPSDH) which is a technique of single-shot phase-shifting interferometry. In the conventional algorithms in PPSDH, the residual 0th-order diffraction wave and the conjugate images cannot be removed completely and a part of space-bandwidth information is discarded. The proposed algorithm can remove these residual images by modifying the calculation of phase-shifting interferometry and by using Fourier transform technique, respectively. Then, several types of complex amplitudes are derived from a recorded hologram according to the directions in which the neighboring pixels used for carrying out the spatial phase-shifting interferometry are aligned. Several distributions are Fourier-transformed and wide space-bandwidth information of the object wave is obtained by selecting the spectrum among the Fourier-transformed images in each region of the spatial frequency domain and synthesizing a Fourier-transformed image from the spectrum.

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