Efficient algorithms for the accurate propagation of extreme-resolution holograms.

David Blinder,Tomoyoshi Shimobaba

doi:10.1364/oe.27.029905

David Blinder, Tomoyoshi Shimobaba

Open Access

https://doi.org/10.1364/oe.27.029905

Copy DOI

Journal: Optics express	Publication Date: Oct 2, 2019
Citations: 16	License type: cc-by

Affiliation: Chiba University, Vrije Universiteit Brussel

Abstract

Display-sized full-parallax holograms with large viewing angles require resolutions surpassing tens of Gigapixels. Unfortunately, computer-generated holography is computationally intensive, particularly for these huge display resolutions. Existing algorithms designed for diffraction of typical Megapixel-sized holograms do not scale well for these large resolutions. Furthermore, since the holograms will not fit in the RAM of most of today's computers, the algorithms should be modified to minimize disk access. We propose two novel algorithms respectively for short-distance and long-distance propagation, and accurately compute the diffraction of a 17.2 Gigapixel hologram on a standard desktop machine. We report a 500-fold speedup over the reference rectangular tiling algorithm for the short-distance version, and a 50-fold speedup for the long-distance version.

Highlights

Computer-generated holography (CGH) is concerned with efficient and accurate algorithms for simulating numerical diffraction of coherent light through free space, and its interaction with materials
We report a 500-fold speedup over the reference rectangular tiling algorithm for the short-distance version, and a 50-fold speedup for the long-distance version
We focus on holograms with extreme resolutions for display purposes [5]

Summary

Introduction

Computer-generated holography (CGH) is concerned with efficient and accurate algorithms for simulating numerical diffraction of coherent light through free space, and its interaction with materials. This principle was used for polygonal CGH to calculate a 4 Gigapixel hologram [13] This approach will have significantly larger computational complexity than a conventional propagation because of the many-to-many mapping of numerically diffracting all tiles. This becomes orders of magnitude slower than a single propagation of the entire hologram as k increases, if the hologram would have fit in RAM in its entirety; the latter would only have O(N log N) complexity, indicating that the former approach is sub-optimal This problem was recently addressed in [19], where the authors proposed to use a raywavefront conversion technique to calculate a realistic ≈10 Gigapixel hologram computing a set of orthographic image projections of a 3D scene.

Proposed diffraction algorithms

Short-distance tiling-based diffraction

Long-distance strip-based diffraction

Implementation

Experiments

Conclusion