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

Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in value between...
Routh-Hurwitz Criterion I01:15

Routh-Hurwitz Criterion I

Consider an electrical power grid, where stability is essential to prevent blackouts. The Routh-Hurwitz criterion is a valuable tool for assessing system stability under varying load conditions or faults. By analyzing the closed-loop transfer function, the Routh-Hurwitz criterion helps determine whether the system remains stable.
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
Mismatch Repair01:20

Mismatch Repair

Organisms are capable of detecting and fixing nucleotide mismatches that occur during DNA replication. This sophisticated process requires identifying the new strand and replacing the erroneous bases with correct nucleotides. Mismatch repair is coordinated by many proteins in both prokaryotes and eukaryotes.
The Mutator Protein Family Plays a Key Role in DNA Mismatch Repair
The human genome has more than 3 billion base pairs of DNA per cell. Prior to cell division, that vast amount of genetic...
Mismatch Repair01:36

Mismatch Repair

Overview

You might also read

Related Articles

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

Sort by
Same journal

UniNDM: A Unified Noise-driven Detection and Mitigation Framework Against Sexual Content in Text-to-Image Generation.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Prototype-Anchored Generalized Manifold Regression for Unknown-Domain Object Detection.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

STPP: Efficient and Progressive Structured Pruning Via Enhanced Sparsification Paradigm.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Incomplete Multimodal Probability Flow Recovery for Emotion Recognition.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

MIDAS: Mutual Information Disentanglement With Uncertainty-Aware Fusion for Incomplete Multimodal Sentiment Analysis.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

How Relation Enrichment Improves Clustering Ensemble Performance: A Second Order Induced Relation View.

IEEE transactions on pattern analysis and machine intelligence·2026

Related Experiment Video

Updated: Jun 13, 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

A dual-bound algorithm for very fast and exact template matching.

Haim Schweitzer1, Rui April Deng, Robert Finis Anderson

  • 1Department of Computer Science, The University of Texas at Dallas, Richardson, 75080-3021, USA. hschweitzer@utdallas.edu

IEEE Transactions on Pattern Analysis and Machine Intelligence
|May 19, 2010
PubMed
Summary

This study introduces a dual-bound algorithm for faster image template matching. By using both lower and upper bounds, it efficiently finds the best matches, outperforming existing methods.

More Related Videos

A Protocol for Computer-Based Protein Structure and Function Prediction
16:41

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

Mapping the Binding Site of an Aptamer on ATP Using MicroScale Thermophoresis
08:09

Mapping the Binding Site of an Aptamer on ATP Using MicroScale Thermophoresis

Published on: January 7, 2017

Related Experiment Videos

Last Updated: Jun 13, 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

A Protocol for Computer-Based Protein Structure and Function Prediction
16:41

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

Mapping the Binding Site of an Aptamer on ATP Using MicroScale Thermophoresis
08:09

Mapping the Binding Site of an Aptamer on ATP Using MicroScale Thermophoresis

Published on: January 7, 2017

Area of Science:

  • Computer Vision
  • Image Processing
  • Pattern Recognition

Background:

  • Template matching is crucial for image analysis.
  • Existing fast methods use lower bounds for rejection.
  • Accelerating search while guaranteeing accuracy remains a challenge.

Purpose of the Study:

  • To generalize rejection schemes using bounds.
  • To develop a dual-bound algorithm for accelerated template matching.
  • To guarantee the detection of the k-best matches.

Main Methods:

  • Generalizing rejection schemes using both lower and upper bounds.
  • Developing a novel algorithm that integrates dual bounds.
  • Implementing and analyzing the dual-bound algorithm for k-best match detection.

Main Results:

  • The proposed dual-bound algorithm effectively accelerates image search.
  • The algorithm guarantees the detection of the k-best matches.
  • Experimental results demonstrate competitive runtime performance.

Conclusions:

  • Dual bounds offer a powerful approach to accelerate template matching.
  • The proposed algorithm provides a guaranteed and efficient solution for finding k-best matches.
  • This method shows favorable performance compared to existing real-time techniques.