{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:44:37Z","timestamp":1761896677657,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["16H07411","15K12025"],"award-info":[{"award-number":["16H07411","15K12025"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"name":"JST ACT-I","award":["JPMJPR16UO"],"award-info":[{"award-number":["JPMJPR16UO"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multimedia"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/tmm.2017.2774009","type":"journal-article","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T19:23:17Z","timestamp":1510773797000},"page":"1809-1822","source":"Crossref","is-referenced-by-count":8,"title":["PQTable: Nonexhaustive Fast Search for Product-Quantized Codes Using Hash Tables"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1529-0154","authenticated-orcid":false,"given":"Yusuke","family":"Matsui","sequence":"first","affiliation":[]},{"given":"Toshihiko","family":"Yamasaki","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2146-6275","authenticated-orcid":false,"given":"Kiyoharu","family":"Aizawa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365720"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2647868.2654898"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.378"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"article-title":"A survey on learning to hash","year":"2016","author":"wang","key":"ref31"},{"key":"ref30","first-page":"288","article-title":"Cache locality is not enough: High-performance nearest neighbor search with product quantization fast\n scan","author":"and\u00e9","year":"0","journal-title":"Proc VLDB"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46475-6_48"},{"key":"ref36","first-page":"2000","article-title":"Improved hamming distance search using variable length substrings","author":"ong","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2515990"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.231"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46478-7_42"},{"journal-title":"Discrete Mathematics for Computer Scientists","year":"2010","author":"stein","key":"ref40"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2535287"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2625260"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248038"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.424"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"article-title":"Improving bilayer product quantization for billion-scale approximate nearest neighbors in high\n dimensions","year":"2014","author":"babenko","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2361319"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.221"},{"key":"ref19","first-page":"3535","article-title":"What is the\n most efficient way to select nearest neighbor candidates for fast approximate nearest neighbor search?","author":"iwamura","year":"0","journal-title":"Proc IEEE Int Conf Comput Vis"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.223"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.124"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3123266.3123430"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.240"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2324592"},{"article-title":"Billion-scale similarity search with GPUs","year":"2017","author":"johnson","key":"ref29"},{"key":"ref5","first-page":"ii-838","article-title":"Composite\n quantization for approximate nearest neighbor search","author":"zhang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299052"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.274"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.388"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299085"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref20","first-page":"861","article-title":"Searching in one billion vectors:\n Re-rank with souce coding","author":"j\u00e9gou","year":"0","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref22","first-page":"2055","article-title":"Efficient indexing of billion-scale datasets of deep descriptors","author":"babenko","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.225"},{"key":"ref42","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","author":"arthur","year":"0","journal-title":"Proc ACM SODA"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46475-6_9"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2014.2329648"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.224"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.222"}],"container-title":["IEEE Transactions on Multimedia"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6046\/8386723\/08110654.pdf?arnumber=8110654","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T03:00:32Z","timestamp":1633921232000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8110654\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":44,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tmm.2017.2774009","relation":{},"ISSN":["1520-9210","1941-0077"],"issn-type":[{"type":"print","value":"1520-9210"},{"type":"electronic","value":"1941-0077"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}