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

Fast Fourier Transform01:10

Fast 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)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
1.2K
Properties of Fourier series II01:21

Properties of Fourier series II

745
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...
745
Orthogonal Trajectories01:26

Orthogonal Trajectories

251
Orthogonal trajectories describe the geometric relationship between two families of curves that intersect each other at right angles. One illustrative case involves a family of parabolas that open sideways along the x-axis. These curves share a common shape but differ by a scaling parameter, resulting in a set of curves that all pass through the origin and widen at different rates.Determining Orthogonal TrajectoriesTo identify the orthogonal trajectories for these parabolas, the first step...
251
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

470
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...
470
Basic signals of Fourier Transform01:07

Basic signals of Fourier Transform

1.2K
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...
1.2K

You might also read

Related Articles

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

Sort by
Same author

Genomic distribution characteristics and interspecific differences of microsatellite landscapes in Felidae.

BMC genomics·2026
Same author

Broadband reflective wavefront manipulation enabled by a polarization-twisting design method.

Optics express·2026
Same author

[The Impact of Donor Sex and Age on the Efficacy of Red Blood Cell Transfusion in Patients with Chronic Hematological Diseases].

Zhongguo shi yan xue ye xue za zhi·2026
Same author

Yeast surface display-based screening and preliminary characterization of nectin-4-targeting nanobodies for bladder cancer.

BMC biotechnology·2026
Same author

Vibrational Spectroscopy of Ionic Liquids Electrochemically Intercalated into Multilayer Graphene.

ACS applied materials & interfaces·2026
Same author

Effect of Molecular Weight and Protein Content on the Air-Water Interfacial and Foaming Properties of Soybean Soluble Polysaccharides.

Foods (Basel, Switzerland)·2026
Same journal

Benchmarking the Robustness of Autonomous Driving to Environmental Illusions: A Lane Perception Perspective.

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

Learning Topology-Aware Representations via Test-Time Adaptation for Anomaly Segmentation.

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

TraGraph-GS: Trajectory Graph-based Gaussian Splatting for Arbitrary Large-Scale Scene Rendering.

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

SWIFT: A Small-World Interaction Framework for Flow-Aware Trajectory Prediction in Autonomous Driving.

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

HardFlow: Hard-Constrained Sampling for Flow-Matching Models Via Trajectory Optimization.

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

Industrial Brain: Self-Evolving Neuro-Symbolic Autonomy with Causal Resilience for Cyber-Physical Systems.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

Related Experiment Video

Updated: Apr 4, 2026

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

43.9K

Fast Orthogonal Haar Transform Pattern Matching via Image Square Sum.

Yujian Li, Houjun Li, Zhi Cai

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |September 10, 2015
    PubMed
    Summary
    This summary is machine-generated.

    A new fast orthogonal Haar transform (FOHT) pattern matching algorithm reduces computations from three to one subtraction per projection value. This significantly speeds up pattern matching while maintaining accuracy.

    More Related Videos

    Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
    06:25

    Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

    Published on: February 12, 2014

    8.9K
    A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors
    11:15

    A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

    Published on: May 30, 2016

    26.5K

    Related Experiment Videos

    Last Updated: Apr 4, 2026

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
    13:44

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

    Published on: August 30, 2013

    43.9K
    Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
    06:25

    Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

    Published on: February 12, 2014

    8.9K
    A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors
    11:15

    A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

    Published on: May 30, 2016

    26.5K

    Area of Science:

    • Computer Vision
    • Image Processing
    • Pattern Recognition

    Background:

    • Orthogonal Haar Transform (OHT) pattern matching offers good performance but is computationally intensive.
    • Existing OHT methods require three subtractions per Haar projection value calculation on sliding windows.

    Purpose of the Study:

    • To propose a novel Fast Orthogonal Haar Transform (FOHT) pattern matching algorithm.
    • To enhance computational efficiency by reducing the number of subtractions required for Haar projection values.

    Main Methods:

    • Developed a new mathematical foundation for OHT based on the concept of image square sum.
    • Introduced the FOHT algorithm, enabling Haar projection value calculation with a single subtraction.
    • Utilized full search pattern matching for comparison and validation.

    Main Results:

    • FOHT achieves the same results as standard OHT and full search pattern matching.
    • FOHT demonstrates competitive speed-ups compared to OHT for single pattern matching.
    • FOHT generally achieves higher speed-ups than OHT when matching multiple patterns.

    Conclusions:

    • The proposed FOHT algorithm offers significant speed improvements over OHT.
    • FOHT provides a more efficient approach to pattern matching, especially for multiple patterns.
    • FOHT outperforms other high-level full search equivalent algorithms in terms of speed.