Related Experiment Video
Updated: Jun 6, 2026
13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
Distortion-invariant pattern recognition with Fourier-plane nonlinear filters.
Applied Optics
|November 12, 2010
Summary
Nonlinear techniques enhance pattern recognition correlators for sharper peaks and better noise resistance. Combining these with distortion-invariant filters improves performance in optical and electronic systems.
Area of Science:
- Optics and Photonics
- Signal Processing
- Computer Vision
Background:
- Pattern recognition correlators traditionally use linear techniques.
- Existing correlator filters offer distortion and rotation invariance.
- Nonlinear techniques can improve correlator performance metrics.
Purpose of the Study:
- To integrate nonlinear techniques into distortion-invariant correlator filters.
- To enable existing filter designs for nonlinear correlator architectures.
- To demonstrate performance enhancements through this unification.
Main Methods:
- Modification of known distortion-invariant correlator filters.
- Application of these modified filters within a nonlinear correlator architecture.
- Implementation in both electronic and optical (nonlinear joint transform correlator) systems.
Main Results:
- Improved discrimination against similar objects.
- Enhanced correlation-peak sharpness.
- Increased robustness against correlation noise.
Conclusions:
- Unifying nonlinear techniques with distortion-invariant filters significantly enhances correlator performance.
- The proposed nonlinear Fourier-plane filters are versatile and implementable.
- This approach offers a powerful method for advanced pattern recognition.
Related Concept Videos
01:10Fast 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...
01:20Properties of Fourier series I
The Fourier series is a powerful tool in signal processing and communications, allowing periodic signals to be expressed as sums of sine and cosine functions. A foundational property of the Fourier series is linearity. If we consider two periodic signals, their linear combination results in a new signal whose Fourier coefficients are simply the corresponding linear combinations of the original signals' coefficients. This property is crucial in applications like frequency modulation (FM) radio,...
01:11Continuous -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...
01:21Properties 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...
01:26Linear Approximation in Frequency Domain
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
01:15Discrete 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...