Related Experiment Video
Updated: Feb 5, 2026

06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
396
Computation of the normalized cross-correlation by fast Fourier transform
1Department of Diagnostic Radiology and Nuclear Medicine, University of Maryland, Baltimore, MD, United States of America.
Plos One
|September 21, 2018
Summary
This study introduces a fast Fourier transform method for computing normalized cross-correlation (NCC). This technique offers a speed-efficient alternative for template matching applications like facial recognition and medical imaging.
Area of Science:
- Computer Vision
- Image Processing
- Signal Processing
Background:
- Normalized cross-correlation (NCC) is crucial for template matching in various applications.
- Rapid computation of NCC is essential for real-time systems.
- Existing NCC computation methods have limitations in speed efficiency.
Purpose of the Study:
- To develop a novel scheme for computing normalized cross-correlation (NCC).
- To enhance the speed efficiency of NCC computation using the fast Fourier transform (FFT).
- To provide a competitive alternative to existing NCC computation techniques.
Main Methods:
- Development of a computational scheme utilizing the fast Fourier transform (FFT).
- Application of the FFT-based scheme to normalized cross-correlation (NCC) computation.
- Comparative analysis of the proposed method against existing techniques for speed.
Main Results:
- The proposed FFT-based NCC computation scheme demonstrates significant speed advantages.
- The method shows favorable speed efficiency compared to traditional techniques.
- Performance may exceed existing methods under specific search conditions.
Conclusions:
- The FFT-based approach offers a highly efficient method for NCC computation.
- This technique is particularly beneficial for time-sensitive template matching applications.
- The developed scheme presents a viable and potentially superior alternative for NCC calculations.
Related Concept Videos
Fast Fourier Transform
950
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...
950
Properties of Fourier Transform I
662
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...
662
Properties of Fourier Transform II
779
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...
779
Discrete Fourier Transform
901
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...
901
Basic signals of Fourier Transform
943
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...
943
Continuous -time Fourier Transform
910
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...
910

