Related Experiment Video
Updated: Jul 7, 2026

06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
Methods for reconstruction of 2-D sequences from Fourier transform magnitude
1Lehrstuhl fur Allgemeine und Theor. Elektrotech., Erlangen-Nurnberg Univ.
Summary
This study introduces a novel deautocorrelation algorithm combined with the iterative Fourier transform (IFT) algorithm to enhance phase retrieval success rates. The new method improves reconstruction accuracy, even with noisy data, and highlights the need for solution verification.
Area of Science:
- Optics and Photonics
- Signal Processing
- Computational Imaging
Background:
- The Gerchberg-Saxton (GS) algorithm and its variants are standard for phase retrieval.
- Existing algorithms may fail to converge to the correct solution, even when unique solutions exist.
- Phase retrieval is crucial in various imaging and scientific applications.
Purpose of the Study:
- To propose a new deautocorrelation algorithm and auxiliary techniques to improve phase retrieval.
- To enhance the success rate and robustness of phase retrieval compared to existing methods.
- To investigate the impact of noise on reconstruction quality and explore solution ambiguity.
Main Methods:
- Development of a novel deautocorrelation algorithm.
- Integration of the new algorithm with the iterative Fourier transform (IFT) algorithm.
- Testing the combined approach on challenging reconstruction examples with varying signal-to-noise ratios (SNR).
Main Results:
- The combination of the new deautocorrelation algorithm and IFT significantly improves phase retrieval success.
- Robust and effective reconstructions were achieved even with noisy Fourier modulus data (down to 10 dB SNR).
- Perfect reconstruction is possible with noise-free data.
Conclusions:
- The proposed algorithm combination offers a more reliable approach to phase retrieval.
- The study introduces the concept of intrinsic ambiguity in phase retrieval.
- Verification of retrieved solutions is essential due to potential ambiguities and algorithm limitations.
Related Concept Videos
Trigonometric Fourier series
Fourier series is a foundational mathematical technique that decomposes periodic functions into an infinite series of sinusoidal harmonics. This method enables the representation of complex periodic signals as sums of simple sine and cosine functions, facilitating their analysis and interpretation in various fields, including signal processing, acoustics, and electrical engineering.
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
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...
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...
Convergence of Fourier Series
The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
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...
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...

