Related Experiment Video
Updated: Apr 30, 2026

10:28
Compact Lens-less Digital Holographic Microscope for MEMS Inspection and Characterization
Published on: July 5, 2016
10.2K
Real-time calculation of Fresnel holograms using the split-Lohmann method
Optics Letters
|April 15, 2025
Summary
We developed a fast, one-step method for computing Fresnel holograms, enabling real-time 3D perception in augmented and virtual reality. This technique significantly speeds up hologram generation for complex scenes using GPU acceleration.
Area of Science:
- Optics and Photonics
- Computer Graphics
- Immersive Technologies
Background:
- Holography is key for realistic 3D perception in augmented reality (AR) and virtual reality (VR).
- Real-time hologram computation for complex 3D scenes remains a significant computational challenge.
- Existing methods struggle with the speed and complexity required for dynamic holographic displays.
Purpose of the Study:
- To introduce a novel, efficient one-step technique for calculating Fresnel diffraction integrals.
- To enable real-time hologram computation for complex 3D scenes.
- To improve the fidelity of 3D perception in holographic applications.
Main Methods:
- A one-step technique based on the split-Lohmann method is proposed.
- The method involves successive operations in both spatial and frequency domains.
- A Graphics Processing Unit (GPU) implementation was utilized for acceleration.
Main Results:
- The proposed technique computes Fresnel holograms of complex scenes in real time.
- The GPU implementation achieved speeds up to 18.1 times faster than layer-based approaches.
- Optical experiments on a 4K full-color holographic display confirmed high-fidelity 3D perception.
Conclusions:
- The developed one-step split-Lohmann method offers a computationally efficient solution for real-time hologram generation.
- This advancement significantly enhances the feasibility of high-fidelity 3D perception in AR/VR.
- The technique paves the way for more immersive and interactive holographic experiences.
Related Concept Videos
Continuous -time Fourier Transform
1.3K
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
1.3K
Fast Fourier Transform
1.3K
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
1.3K

