Related Experiment Video
Updated: Jul 12, 2026

10:16
Digital Inline Holographic Microscopy (DIHM) of Weakly-scattering Subjects
Published on: February 9, 2014
Fourier algorithm method for reconstruction of large-aperture digital holograms based on phase compensation
Xiaoxu Lu1, Yimo Zhang, Liyun Zhong
1College of Precision Instrument and Opto-electronic Engineering, Tianjin University, Tianjin 300072, China.
Optics Letters
|March 24, 2004
Summary
A new Fourier-transformation algorithm simplifies digital hologram reconstruction. This method compensates for higher-order phase terms, improving accuracy in large-aperture holography applications.
Area of Science:
- Optics and Photonics
- Digital Holography
- Wavefront Reconstruction
Background:
- Digital holography enables 3D reconstruction of objects.
- Large-aperture systems present computational challenges in reconstruction.
- Accurate phase term compensation is crucial for high-fidelity holograms.
Purpose of the Study:
- To develop a simplified and efficient reconstruction algorithm for large-aperture digital holograms.
- To address the computational complexity associated with traditional reconstruction methods.
- To analyze the impact of higher-order phase terms on reconstruction accuracy.
Main Methods:
- A novel Fourier-transformation based reconstruction algorithm is proposed.
- The algorithm compensates for higher-order phase terms when the reconstructed wave matches the reference wave.
- Analysis of the variation between higher-order phase terms and aperture angle in in-line phase-shifting digital holography.
Main Results:
- The proposed algorithm simplifies the reconstruction calculation for large-aperture digital holograms.
- Effective compensation of higher-order phase terms is demonstrated.
- The analysis provides insights into the behavior of phase terms across different fields of view.
Conclusions:
- The novel Fourier-transformation algorithm offers a more efficient approach to digital hologram reconstruction.
- This method enhances the accuracy and practicality of large-aperture digital holography.
- The findings are particularly relevant for in-line phase-shifting digital holography systems.
Related Concept Videos
Properties of Fourier series II
Time scaling of signals is a crucial concept in signal processing that affects the Fourier series representation without altering its coefficients. The process modifies the fundamental frequency, thereby changing how the series represents the signal over time. This principle is essential in various applications, including audio and image processing, where signal manipulation is frequent. Understanding function symmetries is fundamental to simplifying the Fourier series.
A function f(t) is...
A function f(t) is...
Parseval's Theorem for Fourier transform
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 signal's...
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a signal's...
Discrete Fourier Transform
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...
Fast Fourier Transform
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...
Reconstruction of Signal using Interpolation
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 sampling...
Aliasing
Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...

