Timezone: »

 
Poster
Angular Quantization based Binary Codes for Fast Similarity Search
Yunchao Gong · Sanjiv Kumar · Vishal Verma · Svetlana Lazebnik

Mon Dec 03 07:00 PM -- 12:00 AM (PST) @ Harrah’s Special Events Center 2nd Floor
in Poster Session and Reception »

This paper focuses on the problem of learning binary embeddings for efficient retrieval of high-dimensional non-negative data. Such data typically arises in a large number of vision and text applications where counts or frequencies are used as features. Also, cosine distance is commonly used as a measure of dissimilarity between such vectors. In this work, we introduce a novel spherical quantization scheme to generate binary embedding of such data and analyze its properties. The number of quantization landmarks in this scheme grows exponentially with data dimensionality resulting in low-distortion quantization. We propose a very efficient method for computing the binary embedding using such large number of landmarks. Further, a linear transformation is learned to minimize the quantization error by adapting the method to the input data resulting in improved embedding. Experiments on image and text retrieval applications show superior performance of the proposed method over other existing state-of-the-art methods.

[ PDF] 

Author Information

Yunchao Gong (UNC Chapel Hill)
Sanjiv Kumar (Google Research)
Vishal Verma (UNC Chapel Hill)
Svetlana Lazebnik (UIUC)

More from the Same Authors