Distribution Sensitive Product Quantization

Product quantization (PQ) seems to have become the most efficient framework of performing approximate nearest neighbor (ANN) search for high-dimensional data. However, almost all existing PQ-based ANN techniques uniformly allocate precious bit budget to each subspace. This is not optimal, because data are often not evenly distributed among different subspaces. A better strategy is to achieve an improved balance between data distribution and bit budget within each subspace. Motivated by this observation, we propose to develop an optimized PQ (OPQ) technique, named distribution sensitive PQ (DSPQ) in this paper. The DSPQ dynamically analyzes and compares the data distribution based on a newly defined aggregate degree for high-dimensional data; whenever further optimization is feasible, resources such as memory and bits can be dynamically rearranged from one subspace to another. Our experimental results have shown that the strategy of bit rearrangement based on aggregate degree achieves modest improvements on most datasets. Moreover, our approach is orthogonal to the existing optimization strategy for PQ; therefore, it has been found that distribution sensitive OPQ can even outperform previous OPQ in the literature.

[1]  Xuelong Li,et al.  Dayside aurora classification via BIFs-based sparse representation using manifold learning , 2014, Int. J. Comput. Math..

[2]  Haifeng Hu,et al.  Enhanced Gabor Feature Based Classification Using a Regularized Locally Tensor Discriminant Model for Multiview Gait Recognition , 2013, IEEE Transactions on Circuits and Systems for Video Technology.

[3]  David L. Neuhoff,et al.  Quantization , 2022, IEEE Trans. Inf. Theory.

[4]  Shiguang Shan,et al.  Semisupervised Hashing via Kernel Hyperplane Learning for Scalable Image Search , 2014, IEEE Transactions on Circuits and Systems for Video Technology.

[5]  Changhu Wang,et al.  Indexing billions of images for sketch-based retrieval , 2013, ACM Multimedia.

[6]  Jonathan Brandt,et al.  Transform coding for fast approximate nearest neighbor search in high dimensions , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Hong Cheng,et al.  Sparsity-Induced Similarity Measure and Its Applications , 2016, IEEE Transactions on Circuits and Systems for Video Technology.

[8]  Svetlana Lazebnik,et al.  Iterative quantization: A procrustean approach to learning binary codes , 2011, CVPR 2011.

[9]  Eckehard G. Steinbach,et al.  A Novel Rate Control Framework for SIFT/SURF Feature Preservation in H.264/AVC Video Compression , 2015, IEEE Transactions on Circuits and Systems for Video Technology.

[10]  Yao Hu,et al.  A Unified Approximate Nearest Neighbor Search Scheme by Combining Data Structure and Hashing , 2013, IJCAI.

[11]  Cordelia Schmid,et al.  Product Quantization for Nearest Neighbor Search , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Koichi Shinoda,et al.  Neighbor-to-Neighbor Search for Fast Coding of Feature Vectors , 2013, 2013 IEEE International Conference on Computer Vision.

[13]  Jian Sun,et al.  Optimized Product Quantization , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Xianglong Liu,et al.  Structure Sensitive Hashing With Adaptive Product Quantization , 2016, IEEE Transactions on Cybernetics.

[15]  Hongsheng Xi,et al.  Linear Distance Coding for Image Classification , 2013, IEEE Transactions on Image Processing.

[16]  Eli Shechtman,et al.  In defense of Nearest-Neighbor based image classification , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[17]  Andrew Zisserman,et al.  Video Google: a text retrieval approach to object matching in videos , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[18]  Do-Kyoung Kwon,et al.  Dependent R/D Modeling Techniques and Joint T-Q Layer Bit Allocation for H.264/SVC , 2013, IEEE Transactions on Circuits and Systems for Video Technology.

[19]  Nenghai Yu,et al.  Order preserving hashing for approximate nearest neighbor search , 2013, ACM Multimedia.

[20]  Cordelia Schmid,et al.  Event Retrieval in Large Video Collections with Circulant Temporal Encoding , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[21]  Gary J. Sullivan,et al.  Overview of the High Efficiency Video Coding (HEVC) Standard , 2012, IEEE Transactions on Circuits and Systems for Video Technology.

[22]  Jiajun Wang,et al.  VCDB: A Large-Scale Database for Partial Copy Detection in Videos , 2014, ECCV.

[23]  Matthijs Douze,et al.  Polysemous Codes , 2016, ECCV.

[24]  Antonio Torralba,et al.  Ieee Transactions on Pattern Analysis and Machine Intelligence 1 80 Million Tiny Images: a Large Dataset for Non-parametric Object and Scene Recognition , 2022 .

[25]  Yannis Avrithis,et al.  Locally Optimized Product Quantization for Approximate Nearest Neighbor Search , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[26]  Qi Tian,et al.  Scalable Feature Matching by Dual Cascaded Scalar Quantization for Image Retrieval , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  Kunio Kashino,et al.  Second-Order Configuration of Local Features for Geometrically Stable Image Matching and Retrieval , 2015, IEEE Transactions on Circuits and Systems for Video Technology.

[28]  Qi Tian,et al.  Statistical modeling of complex backgrounds for foreground object detection , 2004, IEEE Transactions on Image Processing.

[29]  Wen Gao,et al.  Location Discriminative Vocabulary Coding for Mobile Landmark Search , 2011, International Journal of Computer Vision.

[30]  Jian Sun,et al.  Optimized Product Quantization for Approximate Nearest Neighbor Search , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[31]  Antonio Torralba,et al.  Multidimensional Spectral Hashing , 2012, ECCV.

[32]  Trevor Darrell,et al.  Learning to Hash with Binary Reconstructive Embeddings , 2009, NIPS.

[33]  David J. Fleet,et al.  Minimal Loss Hashing for Compact Binary Codes , 2011, ICML.

[34]  Josep Lladós,et al.  Efficient segmentation-free keyword spotting in historical document collections , 2015, Pattern Recognit..

[35]  David J. Fleet,et al.  Cartesian K-Means , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[36]  Rongrong Ji,et al.  Supervised hashing with kernels , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[37]  Marwan Mattar,et al.  Labeled Faces in the Wild: A Database forStudying Face Recognition in Unconstrained Environments , 2008 .

[38]  Jingdong Wang,et al.  Composite Quantization for Approximate Nearest Neighbor Search , 2014, ICML.

[39]  Zhe L. Lin,et al.  Distance Encoded Product Quantization , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[40]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[41]  Qi Tian,et al.  Task-Dependent Visual-Codebook Compression , 2012, IEEE Transactions on Image Processing.

[42]  Antonio Torralba,et al.  Spectral Hashing , 2008, NIPS.

[43]  Victor Lempitsky,et al.  The inverted multi-index , 2012, CVPR.