title: Approximate nearest neighbor search by residual vector quantization.
abstract: 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.affiliation: Digital Engineering & Simulation Research Center, Huazhong University of Science and Technology, Wuhan 430074, China. chyojn@gmail.com
authors.forename: Yongjian
authors.initials: Y
authors.lastname: Chen
authors.forename: Tao
authors.initials: T
authors.lastname: Guan
authors.forename: Cheng
authors.initials: C
authors.lastname: Wang
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D004526:Efficiency; D007090:Image Interpretation, Computer-Assisted / Q000379:methods; D016247:Information Storage and Retrieval / Q000379:methods / Q000706:statistics & numerical data; D008962:Models, Theoretical; D012680:Sensitivity and Specificity; D013223:Statistics as Topic / Q000379:methods*; D060388:Support Vector Machine