Related Experiment Video
Updated: Jan 25, 2026

06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
254
Impact of background and modulation on parameter estimation using fractional Fourier transform and its solutions
Applied Optics
|May 3, 2019
Summary
Fractional Fourier Transform (FRFT) analysis of optical fringe patterns is improved by a new normalization technique. This method enhances parameter estimation accuracy, even with varying backgrounds and modulations, for more reliable optical interferometry.
Area of Science:
- Optical Interferometry
- Signal Processing
Background:
- Closed-fringe patterns with quadratic phase are crucial in optical interferometry.
- Fractional Fourier Transform (FRFT) is effective for analyzing these patterns due to spectral separation in the fractional domain, unlike the Fourier domain.
- Existing FRFT-based parameter estimation is sensitive to non-uniform illumination causing varying backgrounds and modulations, lacking theoretical justification.
Purpose of the Study:
- To theoretically analyze the impact of varying background and modulation on FRFT-based parameter estimation in optical interferometry.
- To introduce and evaluate fringe normalization techniques to mitigate these impacts.
- To improve the accuracy of parameter estimation for closed-fringe patterns.
Main Methods:
- Theoretical analysis of the effects of varying background and modulation on FRFT.
- Application of three fringe normalization techniques to preprocess fringe patterns.
- Parameter estimation using the FRFT-based method on the normalized cosine-only term of the fringe pattern.
Main Results:
- Identified key factors for optimal results when using normalization methods.
- Demonstrated that the proposed normalization approach significantly improves parameter estimation accuracy compared to previous FRFT-based methods.
- Validated the feasibility and applicability of the enhanced approach through simulations and experimental results.
Conclusions:
- The developed fringe normalization technique effectively eliminates the detrimental impact of varying backgrounds and modulations on FRFT-based parameter estimation.
- The enhanced FRFT method provides more accurate physical quantity retrieval in optical interferometry.
- The study offers a robust and applicable solution for analyzing challenging fringe patterns.
More Related Videos
Related Concept Videos
Properties of Fourier Transform I
624
The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
624
Properties of Fourier Transform II
758
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
758
Discrete Fourier Transform
876
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...
876
Fast Fourier Transform
931
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...
931
Continuous -time Fourier Transform
856
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...
856
Parseval's Theorem for Fourier transform
2.1K
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...
2.1K

