Related Experiment Video
Updated: May 19, 2026

10:03
Proton Transfer and Protein Conformation Dynamics in Photosensitive Proteins by Time-resolved Step-scan Fourier-transform Infrared Spectroscopy
Published on: June 27, 2014
Windowed Fourier transform profilometry based on improved S-transform
Optics Letters
|September 4, 2012
Summary
This study introduces an improved S-transform for windowed Fourier transform (WFT) profilometry, enhancing phase map accuracy. By correcting deviations in instantaneous frequency, this novel method offers more precise fringe pattern analysis for practical applications.
Area of Science:
- Optics and Photonics
- Signal Processing
- Metrology
Background:
- Windowed Fourier Transform (WFT) profilometry is a key technique for surface measurement.
- Existing WFT methods can be limited by phase deviations affecting accuracy.
- The S-transform offers time-frequency analysis but requires refinement for precise phase retrieval.
Purpose of the Study:
- To develop a novel WFT profilometry method based on an improved S-transform.
- To derive and address the impact of the second-order phase derivative on the S-transform ridge.
- To achieve more accurate instantaneous frequency estimation and phase map generation.
Main Methods:
- Development of an improved S-transform incorporating phase deviation analysis.
- Derivation of the second-order phase derivative's impact (φ''(b)) on the S-transform.
- Estimation and removal of phase deviation for accurate instantaneous frequency calculation.
- Application of WFT using a window size map derived from instantaneous frequency.
Main Results:
- The improved S-transform effectively estimates and corrects for phase deviations.
- Accurate instantaneous frequency is obtained after deviation removal.
- A precise phase map of fringe patterns is generated using the WFT with the derived window size map.
- The novel method demonstrates superior performance compared to WFT based on wavelet transform.
Conclusions:
- The proposed WFT profilometry method based on improved S-transform provides highly accurate phase maps.
- The technique effectively addresses limitations of previous WFT approaches.
- Numerical simulations and experimental results validate the method's practical applicability in metrology and surface analysis.
Related Concept Videos
Continuous -time Fourier Transform
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...
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...
Properties of Fourier Transform I
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...
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...
Properties of Fourier Transform II
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...
Basic signals of Fourier Transform
The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...

