Related Experiment Video
Updated: Apr 12, 2026
13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
43.9K
Analyzing closed-fringe images using two-dimensional Fan wavelets
Applied Optics
|May 14, 2015
Summary
This study introduces a fast and noise-resistant algorithm using 2D Fan wavelets for analyzing fringe images. It efficiently extracts local phase and frequency information, outperforming existing wavelet and Fourier transform methods.
Area of Science:
- Image Processing
- Wavelet Analysis
- Optical Metrology
Background:
- Analyzing closed-fringe images is crucial for various scientific and engineering applications.
- Current methods for extracting phase and frequency information can be slow and susceptible to noise.
Purpose of the Study:
- To develop a novel algorithm for analyzing closed-fringe images.
- To achieve high speed and exceptional noise resistance in phase and frequency extraction.
- To improve upon existing wavelet and Fourier transform techniques.
Main Methods:
- Utilized two-dimensional (2D) Fan wavelets for image analysis.
- Implemented an efficient scale-space discretization strategy.
- Proposed three methods to resolve phase sign ambiguity.
Main Results:
- The developed algorithm is up to 10 times faster than state-of-the-art wavelet methods.
- It is up to 30 times faster than windowed Fourier transform programs.
- Achieved a precision of 1/30th of a fringe even with noise levels up to 1/5th of the input contrast.
Conclusions:
- 2D Fan wavelets offer a significant speed and noise-resistance advantage over Morlet wavelets.
- The proposed algorithm provides a fast, accurate, and robust solution for fringe image analysis.
- The method demonstrates high precision in extracting phase and frequency information from noisy images.
Related Concept Videos
01:21Convergence of Fourier Series
544
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...
544
01:11Continuous -time Fourier Transform
1.2K
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...
1.2K
01:15Discrete Fourier Transform
1.2K
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...
1.2K
01:24Properties of Fourier Transform II
942
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...
942
01:10Fast Fourier Transform
1.2K
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...
1.2K
01:07Basic signals of Fourier Transform
1.3K
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...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
1.3K