Journal
SENSORS
Volume 10, Issue 12, Pages 11259-11273Publisher
MDPI
DOI: 10.3390/s101211259
Keywords
approximate nearest neighbor search; high-dimensional indexing; residual vector quantization
Funding
- National Natural Science Foundation of China (NSFC) [60903095]
- Postdoctoral Science Foundation Funded Project of China [20080440941]
Ask authors/readers for more resources
A recently proposed product quantization method is efficient for large scale approximate nearest neighbor search, however, its performance on unstructured vectors is limited. This paper introduces residual vector quantization based approaches that are appropriate for unstructured vectors. Database vectors are quantized by residual vector quantizer. The reproductions are represented by short codes composed of their quantization indices. Euclidean distance between query vector and database vector is approximated by asymmetric distance, i.e., the distance between the query vector and the reproduction of the database vector. An efficient exhaustive search approach is proposed by fast computing the asymmetric distance. A straight forward non-exhaustive search approach is proposed for large scale search. Our approaches are compared to two state-of-the-art methods, spectral hashing and product quantization, on both structured and unstructured datasets. Results show that our approaches obtain the best results in terms of the trade-off between search quality and memory usage.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available