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

Linear Approximation in Frequency Domain01:26

Linear 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.
Distance Problem01:29

Distance Problem

When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...
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...
Application of Linearization and Approximation01:29

Application of Linearization and Approximation

A drone flying through complex terrain often relies on more than one sensing method to estimate small changes in altitude. Along with direct measurements, air pressure provides a useful indirect indicator of vertical movement. Atmospheric pressure decreases as altitude increases, and this relationship is commonly described using an exponential model. Although accurate, converting pressure measurements into altitude values requires calculations that are too complex to perform repeatedly during...
Linearization and Approximation01:26

Linearization and Approximation

Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

You might also read

Related Articles

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

Sort by
Same author

Object-Based Multiple Foreground Video Co-Segmentation via Multi-State Selection Graph.

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

Adaptive classification in a self-paced hybrid brain-computer interface system.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2013
Same author

Automatic artefact removal in a self-paced hybrid brain- computer interface system.

Journal of neuroengineering and rehabilitation·2012
Same author

Learning sparse representations for human action recognition.

IEEE transactions on pattern analysis and machine intelligence·2012
Same author

A new scheme for robust gradient vector estimation in color images.

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

Improved face representation by nonuniform multilevel selection of Gabor convolution features.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2009
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 Videos

A fast approximate nearest neighbor search algorithm in the Hamming space.

Mani Malek Esmaeili1, Rabab Kreidieh Ward, Mehrdad Fatourechi

  • 1Electrical and Computer Engineering Department, University of British Columbia, 5500-2332 Main Mall, Vancouver, BC V6T 1Z4, Canada. manim@ece.ubc.ca

IEEE Transactions on Pattern Analysis and Machine Intelligence
|August 8, 2012
PubMed
Summary
This summary is machine-generated.

A new Error Weighted Hashing (EWH) algorithm offers a faster, more accurate method for approximate nearest neighbor search in binary Hamming space, outperforming Locality Sensitive Hashing (LSH) for multimedia retrieval and copy detection.

Related Experiment Videos

Area of Science:

  • Computer Science
  • Information Retrieval
  • Algorithms

Background:

  • Approximate nearest neighbor search is crucial for large-scale data analysis.
  • Locality Sensitive Hashing (LSH) is a popular but limited method for binary Hamming spaces.
  • Existing methods struggle with large nearest neighbor distances.

Purpose of the Study:

  • To propose a novel, fast, and accurate approximate nearest neighbor search algorithm for binary Hamming spaces.
  • To address the limitations of LSH, particularly for large nearest neighbor distances.
  • To enhance multimedia retrieval and copy detection systems using binary fingerprinting.

Main Methods:

  • Developed the Error Weighted Hashing (EWH) algorithm.
  • EWH weighs candidate neighbors based on the difference between their hash vectors.
  • Evaluated EWH performance against LSH on a large video fingerprint database.

Main Results:

  • EWH is up to 20 times faster than LSH.
  • EWH performs effectively even for large nearest neighbor distances where LSH fails.
  • On a database of over 1,000 videos, EWH demonstrated over 10x speedup for specific detection accuracy.
  • EWH achieved a 15x lower error rate for the same retrieval time compared to LSH.

Conclusions:

  • EWH is a superior algorithm for approximate nearest neighbor search in binary Hamming spaces.
  • EWH offers significant speed and accuracy improvements over LSH for multimedia retrieval and copy detection.
  • The proposed EWH algorithm effectively handles large nearest neighbor distances, expanding its applicability.