Related Experiment Video
Updated: Jun 6, 2025

10:16
Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects
Published on: February 8, 2014
12.2K
Instant-SFH: Non-Iterative Sparse Fourier Holograms Using Perlin Noise
David Li1, Susmija Jabbireddy1, Yang Zhang2
1Department of Computer Science, University of Maryland, College Park, MD 20742, USA.
Sensors (Basel, Switzerland)
|November 27, 2024
Summary
Researchers developed a faster method for creating sparse holograms for augmented (AR) and virtual reality (VR) displays. This non-iterative technique significantly speeds up image rendering, enabling real-time holographic content.
Area of Science:
- Optics and Photonics
- Computer Graphics
- Display Technology
Background:
- Holographic displays offer realistic 3D visuals for AR/VR by providing accurate depth cues.
- High-fidelity holographic imaging can be achieved using sparse pixel data, enhancing energy efficiency.
- Current methods for calculating sparse hologram layouts are computationally intensive and not real-time.
Purpose of the Study:
- To introduce a novel, non-iterative method for computing sparse Fourier holograms.
- To improve the computational speed of generating holographic displays for real-time applications.
- To enable dynamic content presentation in AR and VR using holographic technology.
Main Methods:
- A non-iterative amplitude and phase computation technique was developed for sparse Fourier holograms.
- Perlin noise was utilized in the image-plane phase for hologram generation.
- Simulated and optical experiments were conducted to validate the method.
Main Results:
- The proposed method achieved a runtime improvement of over 600 times compared to the Gaussian-weighted Gerchberg-Saxton method.
- The new technique produced nearly equivalent Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index Measure (SSIM) quality.
- Real-time performance was demonstrated, crucial for dynamic AR/VR content.
Conclusions:
- The non-iterative sparse hologram computation method offers a significant speed advantage for holographic display generation.
- This advancement facilitates the real-time rendering of complex 3D content, essential for immersive AR and VR experiences.
- The method's efficiency paves the way for practical applications in video streaming and interactive visualization on holographic platforms.
Related Concept Videos
Reconstruction of Signal using Interpolation
173
Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next...
173
Fast Fourier Transform
270
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...
270
Discrete Fourier Transform
219
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
219
Continuous -time Fourier Transform
289
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...
289
Parseval's Theorem for Fourier transform
877
Parseval's theorem is a fundamental principle in signal processing that enables the calculation of a signal's energy in either the time domain or the frequency domain. This theorem is pivotal in demonstrating energy conservation between these two domains, ensuring that the computed energy value remains consistent regardless of the domain of analysis.
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a...
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a...
877
Upsampling
204
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
204

