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

Interpreting ¹H NMR Signal Splitting: The (n + 1) Rule01:10

Interpreting ¹H NMR Signal Splitting: The (n + 1) Rule

In the AX proton spin system, proton A can sense the two spin states of a coupled proton X, resulting in a doublet NMR signal with two peaks of equal (1:1) intensity. When proton A is coupled to two equivalent protons (AX2 spin system), the spin states of each X can be aligned with or against the external field, creating three possible scenarios. This results in a 1:2:1  triplet signal, where the central peak corresponds to the chemical shift of A and is twice as large or intense as the others.
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This number is...
The Dot Product01:26

The Dot Product

Measuring how one directional quantity affects another along a specific path involves comparing their orientation and strength. When two such quantities are represented using direction and amount, a numerical result is computed to show how much one acts along the path of the other. This result comes from a rule combining both inputs' horizontal and vertical parts and adding the results.This calculation gives a single value that grows larger when both inputs point in similar directions and...
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.
Cluster Sampling Method01:20

Cluster Sampling Method

Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Detection of Gross Error: The Q Test01:00

Detection of Gross Error: The Q Test

When one or more data points appear far from the rest of the data, there is a need to determine whether they are outliers and whether they should be eliminated from the data set to ensure an accurate representation of the measured value. In many cases, outliers arise from gross errors (or human errors) and do not accurately reflect the underlying phenomenon. In some cases, however, these apparent outliers reflect true phenomenological differences. In these cases, we can use statistical methods...

You might also read

Related Articles

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

Sort by
Same author

CoVR-2: Automatic Data Construction for Composed Video Retrieval.

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

ResMLP: Feedforward Networks for Image Classification With Data-Efficient Training.

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

Learning to Answer Visual Questions From Web Videos.

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

Generalized Few-Shot Video Classification With Video Retrieval and Feature Generation.

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

On the Importance of Visual Context for Data Augmentation in Scene Understanding.

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

LCR-Net++: Multi-Person 2D and 3D Pose Detection in Natural Images.

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

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

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

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

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

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

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

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

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

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

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

Learning Shape Anchors for Holistic Indoor Scene Understanding.

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

Related Experiment Video

Updated: Jun 6, 2026

Whole-cell Super-Resolution Imaging via DNA-PAINT on a Spinning Disk Confocal with Optical Photon Reassignment
07:12

Whole-cell Super-Resolution Imaging via DNA-PAINT on a Spinning Disk Confocal with Optical Photon Reassignment

Published on: January 6, 2026

Product quantization for nearest neighbor search.

Hervé Jégou1, Matthijs Douze, Cordelia Schmid

  • 1INRIA Rennes, Campus de Beaulieu, 263 Avenue du Général Leclerc, 35042 Rennes, France. herve.jegou@inria.fr

IEEE Transactions on Pattern Analysis and Machine Intelligence
|November 20, 2010
PubMed
Summary
This summary is machine-generated.

This study presents a product quantization method for efficient approximate nearest neighbor search. It achieves high accuracy and scalability, outperforming existing methods on large datasets.

Related Experiment Videos

Last Updated: Jun 6, 2026

Whole-cell Super-Resolution Imaging via DNA-PAINT on a Spinning Disk Confocal with Optical Photon Reassignment
07:12

Whole-cell Super-Resolution Imaging via DNA-PAINT on a Spinning Disk Confocal with Optical Photon Reassignment

Published on: January 6, 2026

Area of Science:

  • Computer Science
  • Machine Learning
  • Data Mining

Background:

  • Approximate Nearest Neighbor (ANN) search is crucial for large-scale data analysis.
  • Existing methods face challenges in efficiency and accuracy for high-dimensional data.
  • Product quantization offers a promising direction for compressing vector representations.

Purpose of the Study:

  • To introduce a novel product quantization approach for efficient ANN search.
  • To demonstrate the effectiveness of subspace decomposition and quantization for vector representation.
  • To evaluate the performance against state-of-the-art methods.

Main Methods:

  • Decomposing high-dimensional space into a Cartesian product of low-dimensional subspaces.
  • Quantizing each subspace independently and representing vectors by short codes.
  • Estimating Euclidean distance efficiently from these codes.
  • Implementing an asymmetric version for improved precision.

Main Results:

  • The proposed method achieves efficient nearest neighbor search, especially with inverted file systems.
  • Excellent search accuracy was observed for SIFT and GIST image descriptors.
  • The approach outperforms three state-of-the-art methods in search accuracy.
  • Scalability was validated on a dataset comprising two billion vectors.

Conclusions:

  • Product quantization provides an efficient and accurate solution for approximate nearest neighbor search.
  • The method demonstrates strong performance and scalability for large-scale image descriptor datasets.
  • This approach offers a significant advancement in efficient similarity search for high-dimensional data.