z-logo
open-access-imgOpen Access
Accelerated computer generated holography using sparse bases in the STFT domain
Author(s) -
David Blinder,
Peter Schelkens
Publication year - 2018
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.26.001461
Subject(s) - computer science , holography , wavefront , speedup , fourier transform , holographic display , artificial intelligence , digital holography , algorithm , computer vision , optics , mathematics , parallel computing , mathematical analysis , physics
Computer-generated holography at high resolutions is a computationally intensive task. Efficient algorithms are needed to generate holograms at acceptable speeds, especially for real-time and interactive applications such as holographic displays. We propose a novel technique to generate holograms using a sparse basis representation in the short-time Fourier space combined with a wavefront-recording plane placed in the middle of the 3D object. By computing the point spread functions in the transform domain, we update only a small subset of the precomputed largest-magnitude coefficients to significantly accelerate the algorithm over conventional look-up table methods. We implement the algorithm on a GPU, and report a speedup factor of over 30. We show that this transform is superior over wavelet-based approaches, and show quantitative and qualitative improvements over the state-of-the-art WASABI method; we report accuracy gains of 2dB PSNR, as well improved view preservation.

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