{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T02:28:01Z","timestamp":1730255281830,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/icpr.2016.7900200","type":"proceedings-article","created":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T17:12:47Z","timestamp":1493053967000},"page":"3645-3649","source":"Crossref","is-referenced-by-count":1,"title":["Joint K-Means quantization for Approximate Nearest Neighbor Search"],"prefix":"10.1109","author":[{"given":"Ezgi Can","family":"Ozan","sequence":"first","affiliation":[]},{"given":"Serkan","family":"Kiranyaz","sequence":"additional","affiliation":[]},{"given":"Moncef","family":"Gabbouj","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/CVPR.2010.5540039"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TPAMI.2013.101"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/CVPR.2013.379"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/CVPR.2014.274"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/CVPR.2013.388"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/CVPR.2010.5539852"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.3390\/s101211259"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/CVPR.2014.124"},{"key":"ref18","article-title":"Composite Quantization for Approximate Nearest Neighbor Search","author":"zhang","year":"2014","journal-title":"ICML"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/CVPR.2015.7299052"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1016\/j.patrec.2010.04.004"},{"key":"ref3","article-title":"Spherical hashing","author":"heo","year":"2012","journal-title":"CVPR"},{"key":"ref6","first-page":"1820","article-title":"Harmonious hashing","author":"xu","year":"2013","journal-title":"International Joint Conference on Artificial Intelligence"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/1835449.1835455"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TPAMI.2010.57"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/ICCV.2013.317"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/CVPR.2011.5995518"},{"key":"ref1","first-page":"1408","article-title":"Hashing for Similarity Search: A Survey","author":"wang","year":"2014","journal-title":"ArXiv Preprint"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/CVPR.2013.208"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TKDE.2014.2324592"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1016\/j.patrec.2009.09.011"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/18.720541"},{"key":"ref23","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","volume":"8","author":"arthur","year":"2007","journal-title":"SODA"}],"event":{"name":"2016 23rd International Conference on Pattern Recognition (ICPR)","start":{"date-parts":[[2016,12,4]]},"location":"Cancun","end":{"date-parts":[[2016,12,8]]}},"container-title":["2016 23rd International Conference on Pattern Recognition (ICPR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7893644\/7899596\/07900200.pdf?arnumber=7900200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T16:50:17Z","timestamp":1496681417000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7900200\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/icpr.2016.7900200","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}