Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Expected Frequencies in Goodness-of-Fit Tests01:19

Expected Frequencies in Goodness-of-Fit Tests

A goodness-of-fit test is conducted to determine whether the observed frequency values are statistically similar to the frequencies expected for the dataset. Suppose the expected frequencies for a dataset are equal such as when predicting the frequency of any number appearing when casting a die. In that case, the expected frequency is the ratio of the total number of observations (n) to the number of categories (k).
Relative Frequency Histogram01:14

Relative Frequency Histogram

The relative frequency depicts the proportion of data points that have each value. The frequency tells the number of data points that have each value. Like the histogram, a relative frequency histogram also has the same shape with a horizontal scale (the x-axis), but the vertical scale (the y-axis) is marked with relative frequencies (percentages of the whole) instead of actual frequencies. A relative frequency histogram is a graphical representation of a frequency distribution where the...
Determination of Expected Frequency01:08

Determination of Expected Frequency

Suppose one wants to test independence between the two variables of a contingency table. The values in the table constitute the observed frequencies of the dataset. But how does one determine the expected frequency of the dataset? One of the important assumptions is that the two variables are independent, which means the variables do not influence each other. For independent variables, the statistical probability of any event involving both variables is calculated by multiplying the individual...
Fast Fourier Transform01:10

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)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Sampling Theorem01:15

Sampling Theorem

In signal processing, the analysis of continuous-time signals, denoted as x(t), often involves sampling techniques to convert these signals into discrete-time signals. This process is essential for digital representation and manipulation. A critical component in sampling is the train of impulses, characterized by the sampling interval and the sampling frequency. The relationship between these parameters and the original signal's properties dictates the success of the sampling process.
Relative Frequency Distribution00:55

Relative Frequency Distribution

A relative frequency distribution is the proportion or fraction of times a value occurs in a data set. To find the relative frequencies, one can divide each frequency by the total number of data points in the sample. It is very similar to a regular frequency distribution, except that instead of reporting how many data values fall in a class, a relative frequency distribution reports the fraction of data values that fall in a class. These fractions or proportions are called relative frequencies...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Low-Rankness Transfer for Realistic Denoising.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2017
Same author

A corroborative study on improving pitch determination by time-frequency cepstrum decomposition using wavelets.

SpringerPlus·2016
Same author

Fast Edge-Aware Processing via First Order Proximal Approximation.

IEEE transactions on visualization and computer graphics·2015
Same author

Unsupervised approach data analysis based on fuzzy possibilistic clustering: application to medical image MRI.

Computational intelligence and neuroscience·2014
Same author

HOS-based image sequence noise removal.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2006
Same journal

Style-Aware Contrastive Test-Time Adaptation: A Dual-Cache Model for Robust Vision-Language Alignment.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Semantic Frame Interpolation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Physics-Guided Cross-Modal Decoupling with Test-Time Adaptation for Hyperspectral Image Restoration.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Change-Prior-Guided Unsupervised Change Detection of Heterogeneous Remote Sensing Images.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

AgonicDreamer: Enhancing Multi-View Consistency in Text-to-3D Generation via Rectified Score Distillation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

BiCM-Prompt: Bidirectional Cross-Modal Prompt Tuning for Class-Incremental Learning on Multisource Remote Sensing Images.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
See all related articles

Related Experiment Video

Updated: Jun 18, 2026

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography
10:14

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography

Published on: September 2, 2020

Fast frequency template matching using higher order statistics.

Fedwa Essannouni1, Driss Aboutajdine

  • 1Faculty of Sciences, Mohamed V Agdal University LRIT, laboratoire associé au CNRST, France. essannouni@hotmail.fr

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|November 26, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces a new template matching method using the fourth central moment, enhancing robustness against Gaussian noise. This novel approach offers improved performance with negligible computational overhead compared to existing techniques.

More Related Videos

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps
11:52

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

Published on: February 9, 2017

Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions
11:22

Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions

Published on: January 30, 2018

Related Experiment Videos

Last Updated: Jun 18, 2026

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography
10:14

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography

Published on: September 2, 2020

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps
11:52

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

Published on: February 9, 2017

Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions
11:22

Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions

Published on: January 30, 2018

Area of Science:

  • Signal processing
  • Image analysis
  • Statistical modeling

Background:

  • Template matching is crucial for image analysis and pattern recognition.
  • Additive Gaussian noise significantly degrades the performance of classical estimators.
  • Higher-order statistics offer potential for improved robustness in noisy environments.

Purpose of the Study:

  • To propose a novel template matching technique robust to additive Gaussian noise.
  • To leverage the properties of the fourth central moment for enhanced estimation.
  • To demonstrate the computational efficiency of the proposed method.

Main Methods:

  • Utilizing the fourth central moment, an estimator from higher-order statistics theory.
  • Deriving the computation of the fourth central moment from correlation functions via substitutions and complex arithmetic.
  • Implementing the computation using the fast Fourier transform (FFT) approach.

Main Results:

  • The proposed fourth central moment-based template matching algorithm demonstrates superior robustness compared to classical estimators.
  • Simulation results validate the effectiveness of the technique in the presence of Gaussian noise.
  • The additional computational cost associated with the proposed method is negligible.

Conclusions:

  • The novel template matching technique using the fourth central moment provides a robust and computationally efficient solution for signal and image processing tasks.
  • This method offers a significant advantage in applications where robustness against Gaussian noise is critical.
  • The FFT-based computation makes the technique practical for real-world applications.