Skip to main content
SpringerLink
Log in

Effective product quantization-based indexing for nearest neighbor search

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Product quantization is a widely used lossy compression technique that can generate high quantization levels by a compact codebook set. It has been conducted in cluster-based index structures, termed as product quantization-based indexing. In this paper, we propose a novel product quantization-based indexing method for approximate nearest neighbor search. Inspired by the study for learning to rank, a ranking scheme is presented to learn the weighting relation between query-dependent features. The clusters in an index table are ranked by the relevance scores derived from the weighted features with respect to the query. We then present an approximate nearest neighbor search algorithm integrating the proposed ranking scheme with the product quantization-based index structure. Experimental results on the billion-level datasets demonstrate the effectiveness and superiority of the proposed method compared with several state-of-the-art methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Babenko A, Lempitsky V (2014) Additive quantization for extreme vector compression. Proc IEEE Int Conf Comput Vis Pattern Recognit:931–938

  2. Babenko A, Lempitsky V (2015) The inverted multi-index. IEEE Trans Pattern Anal Mach Intell 37(6):1247–1260

    Article  Google Scholar 

  3. Babenko A, Lempitsky V (2016) Efficient indexing of billion-scale datasets of deep descriptors. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2055–2063, Las Vegas, USA, Jun. 26-Jul. 1, 2016

  4. Calonder M, Lepetit V, Strecha C, Fua P (2010) BRIEF: binary robust independent elementary features. Proc Eur conf Comput Vis:778–792

  5. Chen Y, Guan T, Wang C (2010) Approximate nearest neighbor search by residual vector quantization. Sensors 10:11259–11273

    Article  Google Scholar 

  6. Chiu CY, Liou YC, Prayoonwong A (2016) Approximate asymmetric search for binary embedding codes. ACM Trans Multimed Comput Commun Appl 13(1):1–25

    Article  Google Scholar 

  7. Dai Q, Li J, Wang J, Jiang YG (2016) Binary optimized hashing. In Proceedings of ACM International Conference on Multimedia (SIGMM), pp. 1247–1256, Amsterdam, Netherlands, Oct. 15–19, 2016

  8. Dong W, Charikar M, Li K (2008) Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces. In Proceedings of ACM International Conference on Information Retrieval (SIGIR), pp. 128–130, 2008

  9. Ge T, He K, Ke Q, Sun J (2013) Optimized product quantization for approximate nearest neighbor search. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), Portland, USA, Jun. 23–28, 2013

  10. Ge T, He K, Sun J (2014) graph cuts for supervised binary coding. Proc Eur conf Comput Vis 7:250–264

    Google Scholar 

  11. Gong Y, Lazebnik S (2011) iterative quantization: a procrustean approach to learning binary codes. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 2011

  12. Gordo A, Perronnin F, Gong Y, Lazebnik S (2014) Asymmetric distances for binary embeddings. IEEE Trans Pattern Anal Mach Intell 36(1):33–47

    Article  Google Scholar 

  13. He K, Wen F, Sun J. (2013) K-means hashing: an affinity-preserving quantization method for learning binary compact codes. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), Portland, USA, Jun. 23–28, 2013

  14. Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of ACM Symposium on Theory of Computing (STOC), pp 604–613, 1998

  15. Jégou H, Douze M, Schmid C (2011) Product quantization for nearest neighbor search. IEEE Trans Pattern Anal Mach Intell 33(1):2481–2488

    Article  Google Scholar 

  16. Jégou H, Tavenard R, Douze M, Amsaleg L (2011) Searching in one billion vectors: re-rank with source coding. In Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 861–864, Prague, Czech Republic, May 22–27, 2011

  17. Kalantidis Y, Avrithis Y (2014) Locally optimized product quantization for approximate nearest neighbor search. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), Columbus, USA, Jun. 23–28, 2014

  18. Li J, Lan X, Wang J, Yang M, Zheng N (2017) Fast additive quantization for vector compression in nearest neighbor search. Multimed Tools Appl 76(22):23273–23289

    Article  Google Scholar 

  19. Liong VE, Lu J, Wang G, Moulin P, Zhou J (2015) Deep hashing for compact binary codes learning. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2475–2483, Boston, USA, Jun. 7–12, 2015

  20. Liu W, Wang J, Ji R, Jiang YG, Chang SF (2012) Supervised hashing with kernels. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2123–2130, Rhode Island, USA, Jun. 16–21, 2012

  21. Lowe DG (2004) Distinctive image features from scale-invariant keypoints. Int J Comput Vis 60(2):91–110

    Article  MathSciNet  Google Scholar 

  22. Martinez J, Clement J, Hoos HH, Little JJ (2016) Revisiting additive quantization. In Proceedings of European Conference on Computer Vision (ECCV), pp. 137–153, Amsterdam, The Netherlands, Oct. 8–16, 2016

  23. Matsui Y, Yamasaki T, Aizawa K (2015) PQTable: fast exact asymmetric distance neighbor search for product quantization using hash tables. In Proceedings of IEEE international conference on computer vision (ICCV), pp. 1940–1948, Santiago, Chile, 2015

  24. Muja M, Lowe DG (2014) Scalable nearest neighbor algorithms for dimensional data. IEEE Trans Pattern Anal Mach Intell 36(11):2227–2240

    Article  Google Scholar 

  25. Nistér D, Stewénius H (2006) Scalable recognition with a vocabulary tree. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR). New York, USA, 2006

  26. Norouzi M, Fleet DJ (2011) Minimal loss hashing for compact binary codes. In Proceedings of International Conference on Machine Learning (ICML), Bellevue, USA, Jun. 28-Jul. 2, 2011

  27. Norouzi M, Fleet DJ (2013) Cartesian k-means. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), Portland, USA, Jun. 23–28, 2013

  28. Paulevé L, Jégou H, Amsaleg L (2010) Locality sensitive hashing: a comparison of hash function types and querying mechanisms. Pattern Recogn Lett 31:1348–1358

    Article  Google Scholar 

  29. Silpa-Anan C, Hartley R (2008) Optimized KD-trees for fast image descriptor matching. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), Anchorage, USA, 2008

  30. Torralba A, Fergus R, Weiss Y (2008) small codes and large image databases for recognition. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 2008

  31. Wang J, Kumar S, Chang SF (2010) semi-supervised hashing for scalable image retrieval. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 2010

  32. Wang J, Shen HT, Song J, Ji J (2014) Hashing for similarity search: a survey. ArXiv:1408.2927

  33. Wang J, Shen HT, Yan S, Yu N, Li S, Wang J (2014) optimized distances for binary code ranking. In Proceedings of ACM international conference on multimedia (ACMMM), pp. 517–526, 2014

  34. Wei B, Guan T, Yu J (2014) Projected residual vector quantization for ANN search. IEEE Multimedia 21(3):41–51

    Article  Google Scholar 

  35. Weiss Y, Fergus R, Torralba A (2012) Multi-dimensional spectral hashing. Proc Eur Conf Comput Vis 5:340–353

    Google Scholar 

  36. Xia Y, He K, Wen F, Sun J (2013) Joint inverted indexing. In Proceedings of IEEE International Conference on Computer Vision (ICCV), pp. 3416–3423, Sydney, Australia, Dec. 1–8, 2013

  37. Zhang T, Du C, Wang J (2014) composite quantization for approximate nearest neighbor search. In Proceedings of International conference on Machine Learning (ICML), Beijing, China, Jun. 21–26, 2014

  38. Zhang T, Qi GJ, Tang J, Wang J (2015) Sparse composite quantization. In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), pp. 4548–4556, Boston, USA, Jun. 7–12, 2015

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Chiayi University, No.300 Syuefu Rd, Chiayi City, 60004, Taiwan

    Chih-Yi Chiu, Jih-Sheng Chiu, Sarawut Markchit & Sheng-Hao Chou

Authors
  1. Chih-Yi Chiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jih-Sheng Chiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sarawut Markchit
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sheng-Hao Chou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chih-Yi Chiu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chiu, CY., Chiu, JS., Markchit, S. et al. Effective product quantization-based indexing for nearest neighbor search. Multimed Tools Appl 78, 2877–2895 (2019). https://doi.org/10.1007/s11042-018-6059-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-018-6059-5

Keywords

Search

Navigation