Journal
OPTICS EXPRESS
Volume 26, Issue 2, Pages 1461-1473Publisher
OPTICAL SOC AMER
DOI: 10.1364/OE.26.001461
Keywords
-
Categories
Funding
- European Research Council under the European Union's Seventh Framework Programme (FP7)/ERC Grant [617779]
Ask authors/readers for more resources
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. (C) 2018 Optical Society of America under the terms of the OSA Open Access Publishing Agreement
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available