NDLI: Optimized Product Quantization for Approximate Nearest Neighbor Search

Content Provider	IEEE Xplore Digital Library
Author	Tiezheng Ge Kaiming He Qifa Ke Jian Sun
Copyright Year	2013
Description	Author affiliation: Univ. of Sci. & Technol. of China, Hefei, China (Tiezheng Ge)
Abstract	Product quantization is an effective vector quantization approach to compactly encode high-dimensional vectors for fast approximate nearest neighbor (ANN) search. The essence of product quantization is to decompose the original high-dimensional space into the Cartesian product of a finite number of low-dimensional subspaces that are then quantized separately. Optimal space decomposition is important for the performance of ANN search, but still remains unaddressed. In this paper, we optimize product quantization by minimizing quantization distortions w.r.t. the space decomposition and the quantization codebooks. We present two novel methods for optimization: a non-parametric method that alternatively solves two smaller sub-problems, and a parametric method that is guaranteed to achieve the optimal solution if the input data follows some Gaussian distribution. We show by experiments that our optimized approach substantially improves the accuracy of product quantization for ANN search.
Starting Page	2946
Ending Page	2953
File Size	413945
Page Count	8
File Format	PDF
ISBN	9780769549897
ISSN	10636919
DOI	10.1109/CVPR.2013.379
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-06-23
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Quantization (signal) Artificial neural networks Vectors Eigenvalues and eigenfunctions Linear programming Encoding Optimization product quantization nearest neighbor search
Content Type	Text
Resource Type	Article
Subject	Computer Vision and Pattern Recognition Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Locally Optimized Product Quantization for Approximate Nearest Neighbor Search

Cartesian K-Means

Optimized Product Quantization

Efficient approximate nearest neighbor search by optimized residual vector quantization

Complementary hashing for approximate nearest neighbor search

Quantization-Based Approximate Nearest Neighbor Search with Optimized Multiple Residual Codebooks

Product tree quantization for approximate nearest neighbor search

What is the Most EfficientWay to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search?

Constructing optimized prototypes for nearest neighbor classifiers

Optimized Product Quantization for Approximate Nearest Neighbor Search

Similar Documents

Locally Optimized Product Quantization for Approximate Nearest Neighbor Search

Cartesian K-Means

Optimized Product Quantization

Efficient approximate nearest neighbor search by optimized residual vector quantization

Complementary hashing for approximate nearest neighbor search

Quantization-Based Approximate Nearest Neighbor Search with Optimized Multiple Residual Codebooks

Product tree quantization for approximate nearest neighbor search

What is the Most EfficientWay to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search?

Constructing optimized prototypes for nearest neighbor classifiers

Optimized Product Quantization for Approximate Nearest Neighbor Search