Efficient algorithms for the accurate propagation of extreme-resolution holograms
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 Megap...
Gespeichert in:
| Veröffentlicht in: | Optics express Jg. 27; H. 21; S. 29905 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
14.10.2019
|
| ISSN: | 1094-4087, 1094-4087 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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.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. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 1094-4087 1094-4087 |
| DOI: | 10.1364/OE.27.029905 |