{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T04:33:49Z","timestamp":1729139629652,"version":"3.27.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2232021A-08"],"award-info":[{"award-number":["2232021A-08"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009110","name":"Natural Science Foundation of Xinjiang Province","doi-asserted-by":"publisher","award":["2019D04024"],"award-info":[{"award-number":["2019D04024"]}],"id":[{"id":"10.13039\/100009110","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s11042-023-14825-z","type":"journal-article","created":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T09:03:13Z","timestamp":1679562193000},"page":"31673-31689","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An efficient indexing technique for billion-scale nearest neighbor search"],"prefix":"10.1007","volume":"82","author":[{"given":"Kaixiang","family":"Yang","sequence":"first","affiliation":[]},{"given":"Hongya","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Du","sequence":"additional","affiliation":[]},{"given":"Zhizheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zongyuan","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yingyuan","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,23]]},"reference":[{"unstructured":"Andr\u00e9 F, Kermarrec A, Scouarnec N.L (2018) Quicker ADC unlocking the hidden potential of product quantization with SIMD. CoRR arXiv:1812.09162","key":"14825_CR1"},{"doi-asserted-by":"crossref","unstructured":"Aoyama K, Saito K, Sawada H, Ueda N (2011) Fast approximate similarity search based on degree-reduced neighborhood graphs. In: SIGKDD, pp 1055\u20131063","key":"14825_CR2","DOI":"10.1145\/2020408.2020576"},{"unstructured":"Arya S, Mount DM (1993) Approximate nearest neighbor queries in fixed dimensions. In: SODA, vol 93, pp 271\u2013280","key":"14825_CR3"},{"doi-asserted-by":"crossref","unstructured":"Babenko A, Lempitsky V (2014) Additive quantization for extreme vector compression. In: CVPR, pp 931\u2013938","key":"14825_CR4","DOI":"10.1109\/CVPR.2014.124"},{"issue":"6","key":"14825_CR5","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1109\/TPAMI.2014.2361319","volume":"37","author":"A Babenko","year":"2014","unstructured":"Babenko A, Lempitsky V (2014) The inverted multi-index. IEEE Trans Pattern Anal Mach Intell 37(6):1247\u20131260","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"unstructured":"Babenko A, Lempitsky V (2014) Improving bilayer product quantization for billion-scale approximate nearest neighbors in high dimensions. arXiv:1404.1831","key":"14825_CR6"},{"doi-asserted-by":"crossref","unstructured":"Babenko A, Lempitsky V (2015) Tree quantization for large-scale similarity search and classification. In: CVPR, pp 4240\u20134248","key":"14825_CR7","DOI":"10.1109\/CVPR.2015.7299052"},{"unstructured":"Babenko A, Lempitsky V (2016) Efficient indexing of billion-scale datasets of deep descriptors. In: CVPR, pp 2055\u20132063","key":"14825_CR8"},{"key":"14825_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.eswa.2018.06.044","volume":"113","author":"P Banerjee","year":"2018","unstructured":"Banerjee P, Bhunia AK, Bhattacharyya A, Roy PP, Murala S (2018) Local neighborhood intensity pattern-a new texture feature descriptor for image retrieval. Expert Syst Appl 113:100\u2013115. https:\/\/doi.org\/10.1016\/j.eswa.2018.06.044","journal-title":"Expert Syst Appl"},{"unstructured":"Baranchuk D, Persiyanov D, Sinitsin A, Babenko A (2019) Learning to route in similarity graphs. In: ICML, vol 97, pp 475\u2013484","key":"14825_CR10"},{"doi-asserted-by":"crossref","unstructured":"Beis JS, Lowe DG (1997) Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In: CVPR, pp 1000\u20131006. IEEE","key":"14825_CR11","DOI":"10.1109\/CVPR.1997.609451"},{"doi-asserted-by":"crossref","unstructured":"Beyer K, Goldstein J, Ramakrishnan R, Shaft U (1999) When is nearest neighbor meaningful?. In: ICDT, pp 217\u2013235. Springer","key":"14825_CR12","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"2","key":"14825_CR13","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s10044-019-00827-x","volume":"23","author":"AK Bhunia","year":"2020","unstructured":"Bhunia AK, Bhattacharyya A, Banerjee P, Roy PP, Murala S (2020) A novel feature descriptor for image retrieval by combining modified color histogram and diagonally symmetric co-occurrence texture pattern. Pattern Anal Appl 23(2):703\u2013723. https:\/\/doi.org\/10.1007\/s10044-019-00827-x","journal-title":"Pattern Anal Appl"},{"issue":"3","key":"14825_CR14","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"B\u00f6hm C, Berchtold S, Keim DA (2001) Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases. ACM Computing Surveys (CSUR) 33(3):322\u2013373","journal-title":"ACM Computing Surveys (CSUR)"},{"doi-asserted-by":"crossref","unstructured":"Datar M, Immorlica N, Indyk P, Mirrokni VS (2004) Locality-sensitive hashing scheme based on p-stable distributions. In: SoCG, pp 253\u2013262","key":"14825_CR15","DOI":"10.1145\/997817.997857"},{"doi-asserted-by":"crossref","unstructured":"Douze M, J\u00e9gou H, Perronnin F (2016) Polysemous codes. In: ECCV, pp 785\u2013801. Springer","key":"14825_CR16","DOI":"10.1007\/978-3-319-46475-6_48"},{"doi-asserted-by":"crossref","unstructured":"Douze M, Sablayrolles A, J\u00e9gou H (2018) Link and code: fast indexing with graphs and compact regression codes. In: CVPR, pp 3646\u20133654","key":"14825_CR17","DOI":"10.1109\/CVPR.2018.00384"},{"doi-asserted-by":"crossref","unstructured":"Douze M, Szlam A, Hariharan B, J\u00e9gou H (2018) Low-shot learning with large-scale diffusion. In: CVPR, pp 3349\u20133358","key":"14825_CR18","DOI":"10.1109\/CVPR.2018.00353"},{"issue":"5","key":"14825_CR19","first-page":"461","volume":"12","author":"C Fu","year":"2019","unstructured":"Fu C, Xiang C, Wang C, Cai D (2019) Fast approximate nearest neighbor search with the navigating spreading-out graph. VLDB 12(5):461\u2013474","journal-title":"VLDB"},{"issue":"4","key":"14825_CR20","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/TPAMI.2013.240","volume":"36","author":"T Ge","year":"2013","unstructured":"Ge T, He K, Ke Q, Sun J (2013) Optimized product quantization. IEEE Trans Pattern Anal Mach Intell 36(4):744\u2013755","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"4","key":"14825_CR21","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1007\/s10044-020-00879-4","volume":"23","author":"S Gupta","year":"2020","unstructured":"Gupta S, Roy PP, Dogra DP, Kim B (2020) Retrieval of colour and texture images using local directional peak valley binary pattern. Pattern Anal Appl 23(4):1569\u20131585. https:\/\/doi.org\/10.1007\/s10044-020-00879-4","journal-title":"Pattern Anal Appl"},{"doi-asserted-by":"crossref","unstructured":"Harwood B, Drummond T (2016) Fanng: fast approximate nearest neighbour graphs. In: CVPR, pp 5713\u20135722","key":"14825_CR22","DOI":"10.1109\/CVPR.2016.616"},{"issue":"10","key":"14825_CR23","doi-asserted-by":"publisher","first-page":"3160","DOI":"10.1016\/j.patcog.2015.03.016","volume":"48","author":"R He","year":"2015","unstructured":"He R, Cai Y, Tan T, Davis LS (2015) Learning predictable binary codes for face indexing. Pattern Recogn 48(10):3160\u20133168","journal-title":"Pattern Recogn"},{"issue":"1","key":"14825_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2010","unstructured":"Jegou H, Douze M, Schmid C (2010) Product quantization for nearest neighbor search. IEEE Trans Pattern Anal Mach Intell 33(1):117\u2013128","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"doi-asserted-by":"crossref","unstructured":"J\u00e9gou H, Tavenard R, Douze M, Amsaleg L (2011) Searching in one billion vectors: re-rank with source coding. In: ICASSP, pp 861\u2013864. IEEE","key":"14825_CR25","DOI":"10.1109\/ICASSP.2011.5946540"},{"doi-asserted-by":"crossref","unstructured":"Jiang Z, Xie L, Deng X, Xu W, Wang J (2016) Fast nearest neighbor search in the hamming space. In: International conference on multimedia modeling, pp 325\u2013336. Springer","key":"14825_CR26","DOI":"10.1007\/978-3-319-27671-7_27"},{"doi-asserted-by":"publisher","unstructured":"Jin L, Li Z, Tang J (2020) Deep semantic multimodal hashing network for scalable image-text and video-text retrievals. IEEE Transactions on Neural Networks and Learning Systems, pp 1\u201314. https:\/\/doi.org\/10.1109\/TNNLS.2020.2997020","key":"14825_CR27","DOI":"10.1109\/TNNLS.2020.2997020"},{"doi-asserted-by":"crossref","unstructured":"Kalantidis Y, Avrithis Y (2014) Locally optimized product quantization for approximate nearest neighbor search. In: CVPR, pp 2321\u20132328","key":"14825_CR28","DOI":"10.1109\/CVPR.2014.298"},{"issue":"8","key":"14825_CR29","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1007\/s11263-020-01331-0","volume":"128","author":"Z Li","year":"2020","unstructured":"Li Z, Tang J, Zhang L, Yang J (2020) Weakly-supervised semantic guided hashing for social image retrieval. Int J Comput Vis 128(8):2265\u20132278. https:\/\/doi.org\/10.1007\/s11263-020-01331-0","journal-title":"Int J Comput Vis"},{"issue":"8","key":"14825_CR30","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/TKDE.2019.2909204","volume":"32","author":"W Li","year":"2020","unstructured":"Li W, Zhang Y, Sun Y, Wang W, Li M, Zhang W, Lin X (2020) Approximate nearest neighbor search on high dimensional data - experiments, analyses, and improvement. IEEE Trans Knowl Data Eng 32(8):1475\u20131488","journal-title":"IEEE Trans Knowl Data Eng"},{"unstructured":"Lin P, Zhao W (2019) A comparative study on hierarchical navigable small world graphs. CoRR arXiv:1904.02077","key":"14825_CR31"},{"doi-asserted-by":"crossref","unstructured":"Liu Y, Cheng H, Cui J (2017) PQBF: i\/o-efficient approximate nearest neighbor search by product quantization. In: CIKM, pp 667\u2013676","key":"14825_CR32","DOI":"10.1145\/3132847.3132901"},{"issue":"8","key":"14825_CR33","first-page":"1","volume":"PP","author":"S Liu","year":"2017","unstructured":"Liu S, Shao J, Lu H (2017) Generalized residual vector quantization and aggregating tree for large scale search. IEEE Trans Multimedia PP(8):1\u20131","journal-title":"IEEE Trans Multimedia"},{"doi-asserted-by":"crossref","unstructured":"Lv Q, Charikar M, Li K (2004) Image similarity search with compact data structures. In: CIKM, pp 208\u2013217","key":"14825_CR34","DOI":"10.1145\/1031171.1031213"},{"unstructured":"Malkov YA, Yashunin DA (2018) Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs IEEE. Transactions on Pattern Analysis and Machine Intelligence","key":"14825_CR35"},{"doi-asserted-by":"crossref","unstructured":"Matsui Y, Uchida Y, J\u00e9gou H, Satoh S (2018) A survey of product quantization. ITE Transactions on Media Technology & Applications","key":"14825_CR36","DOI":"10.3169\/mta.6.2"},{"issue":"7","key":"14825_CR37","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1109\/TMM.2017.2774009","volume":"20","author":"Y Matsui","year":"2018","unstructured":"Matsui Y, Yamasaki T, Aizawa K (2018) Pqtable: Nonexhaustive fast search for product-quantized codes using hash tables. IEEE Trans Multim 20 (7):1809\u20131822","journal-title":"IEEE Trans Multim"},{"unstructured":"Muja M, Lowe DG (2009) Fast approximate nearest neighbors with automatic algorithm configuration. In: VISAPP, pp 331\u2013340","key":"14825_CR38"},{"doi-asserted-by":"crossref","unstructured":"Philbin J, Chum O, Isard M, Sivic J, Zisserman A (2007) Object retrieval with large vocabularies and fast spatial matching. In: CVPR","key":"14825_CR39","DOI":"10.1109\/CVPR.2007.383172"},{"doi-asserted-by":"crossref","unstructured":"Shakhnarovich G, Darrell T, Indyk P (2006) Nearest-neighbor methods in learning and vision: theory and practice (neural Information Processing). The MIT press","key":"14825_CR40","DOI":"10.7551\/mitpress\/4908.001.0001"},{"doi-asserted-by":"crossref","unstructured":"Sivic Z (2003) Video google: a text retrieval approach to object matching in videos. In: ICCV","key":"14825_CR41","DOI":"10.1109\/ICCV.2003.1238663"},{"issue":"3","key":"14825_CR42","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s00778-013-0329-7","volume":"23","author":"G Teodoro","year":"2014","unstructured":"Teodoro G, Valle E, Mariano N, Torres R, Meira W, Saltz JH (2014) Approximate similarity search for online multimedia services on distributed cpu\u2013gpu platforms. VLDB J 23(3):427\u2013448","journal-title":"VLDB J"},{"unstructured":"Weber R, Schek H-J, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, vol 98, pp 194\u2013205","key":"14825_CR43"},{"unstructured":"Zhang T, Du C, Wang J (2014) Composite quantization for approximate nearest neighbor search. In: ICML, vol 2, p 3","key":"14825_CR44"},{"doi-asserted-by":"crossref","unstructured":"Zhao K, Pan P, Zheng Y, Zhang Y, Wang C, Zhang Y, Xu Y, Jin R (2019) Large-scale visual search with binary distributed graph at Alibaba. In: CIKM, pp 2567\u20132575","key":"14825_CR45","DOI":"10.1145\/3357384.3357834"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-14825-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-023-14825-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-14825-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T22:23:49Z","timestamp":1729117429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-023-14825-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,23]]},"references-count":45,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["14825"],"URL":"https:\/\/doi.org\/10.1007\/s11042-023-14825-z","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2023,3,23]]},"assertion":[{"value":"19 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}