Accelerated Nearest Neighbor Search with Quick ADC - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Accelerated Nearest Neighbor Search with Quick ADC


Efficient Nearest Neighbor (NN) search in high-dimensional spaces is a foundation of many multimedia retrieval systems. Because it offers low responses times, Product Quantization (PQ) is a popular solution. PQ compresses high-dimensional vectors into short codes using several sub-quantizers, which enables in-RAM storage of large databases. This allows fast answers to NN queries, without accessing the SSD or HDD. The key feature of PQ is that it can compute distances between short codes and high-dimensional vectors using cache-resident lookup tables. The efficiency of this technique, named Asymmetric Distance Computation (ADC), remains limited because it performs many cache accesses. In this paper, we introduce Quick ADC, a novel technique that achieves a 3 to 6 times speedup over ADC by exploiting Single Instruction Multiple Data (SIMD) units available in current CPUs. Efficiently exploiting SIMD requires algorithmic changes to the ADC procedure. Namely, Quick ADC relies on two key modifications of ADC: (i) the use 4-bit sub-quantizers instead of the standard 8-bit sub-quantizers and (ii) the quantization of floating-point distances. This allows Quick ADC to exceed the performance of state-of-the-art systems, e.g., it achieves a Recall@100 of 0.94 in 3.4 ms on 1 billion SIFT descriptors (128-bit codes).

Dates and versions

hal-01660730 , version 1 (11-12-2017)



Fabien André, Anne-Marie Kermarrec, Nicolas Le Scouarnec. Accelerated Nearest Neighbor Search with Quick ADC. ICMR 2017 - ACM International Conference on Multimedia Retrieval, Jun 2017, Bucarest, Romania. pp.159-166, ⟨10.1145/3078971.3078992⟩. ⟨hal-01660730⟩
275 View
0 Download



Gmail Facebook Twitter LinkedIn More