{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:14:03Z","timestamp":1729635243732,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.23919\/eusipco.2017.8081662","type":"proceedings-article","created":{"date-parts":[[2017,11,2]],"date-time":"2017-11-02T21:20:38Z","timestamp":1509657638000},"page":"2506-2510","source":"Crossref","is-referenced-by-count":0,"title":["Pyramid encoding for fast additive quantization"],"prefix":"10.23919","author":[{"given":"Anton","family":"Muravev","sequence":"first","affiliation":[]},{"given":"Ezgi Can","family":"Ozan","sequence":"additional","affiliation":[]},{"given":"Alexandros","family":"Iosifidis","sequence":"additional","affiliation":[]},{"given":"Moncef","family":"Gabbouj","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/MASSP.1984.1162229"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TPAMI.2013.240"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/CVPR.2013.388"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/CVPR.2014.298"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TKDE.2014.2324592"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/CVPR.2014.124"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/CVPR.2015.7299052"},{"key":"ref17","first-page":"838","article-title":"Composite Quantization for Approximate Nearest Neighbor Search","volume":"32","author":"zhang","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/CVPR.2015.7299085"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/0004-3702(90)90060-D"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TPAMI.2008.121"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/997817.997857"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/Trustcom.2015.554"},{"key":"ref5","first-page":"1","author":"wang","year":"2014","journal-title":"Hashing for similarity search A survey"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.3390\/s101211259"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","article-title":"Product quantization for nearest neighbor search","volume":"33","author":"douze","year":"2011","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref2","first-page":"194","article-title":"A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces","author":"weber","year":"1998","journal-title":"Proc 24th VLDB Conf"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/s11036-013-0489-0"},{"key":"ref9","first-page":"1","article-title":"Optimized residual vector quantization for efficient approximate nearest neighbor search","author":"ai","year":"2015","journal-title":"Multimed Syst"}],"event":{"name":"2017 25th European Signal Processing Conference (EUSIPCO)","start":{"date-parts":[[2017,8,28]]},"location":"Kos, Greece","end":{"date-parts":[[2017,9,2]]}},"container-title":["2017 25th European Signal Processing Conference (EUSIPCO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8067434\/8081145\/08081662.pdf?arnumber=8081662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T14:06:51Z","timestamp":1570284411000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8081662\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":19,"URL":"https:\/\/doi.org\/10.23919\/eusipco.2017.8081662","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}