{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:10:32Z","timestamp":1742379032709},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1109\/icip.2017.8296455","type":"proceedings-article","created":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T17:03:23Z","timestamp":1519319003000},"page":"1117-1121","source":"Crossref","is-referenced-by-count":3,"title":["A Multi-Block N-ary trie structure for exact r-neighbour search in hamming space"],"prefix":"10.1109","author":[{"given":"Yicheng","family":"Huang","sequence":"first","affiliation":[]},{"given":"Ling-Yu","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Zhe","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Vijay","family":"Chandrasekhar","sequence":"additional","affiliation":[]},{"given":"Tiejun","family":"Huang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.128"},{"key":"ref10","article-title":"Sparse projections for high-dimensional binary codes","author":"xia","year":"2015","journal-title":"CVPR"},{"key":"ref11","article-title":"Co-sparsity regularized deep hashing for image instance retrieval","author":"jie","year":"2016","journal-title":"ICIP"},{"journal-title":"Deep hash Getting depth reguarlization and fine tuning right","year":"2015","author":"lin","key":"ref12"},{"key":"ref13","article-title":"Hamming compatible quantization for hashing","author":"wang","year":"2015","journal-title":"IJCAI"},{"key":"ref14","first-page":"1102","article-title":"Affinity preserving quantization for hashing: A vector quantization approach to learning compact binary codes","author":"wang","year":"2016","journal-title":"Proc of the Thirtieth AAAI Conference on Artificial Intelligence"},{"key":"ref15","article-title":"To project more or to quantize more: Minimizing reconstruction bias for learning compact binary codes","author":"wang","year":"2016","journal-title":"IJCAI"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"ref17","article-title":"Double-bit quantization for hashing","author":"kong","year":"2012","journal-title":"Proceedings of the Twenty-Sixth AAAI"},{"key":"ref18","article-title":"Fast exact search in hamming space with multi-index hashing","author":"norouzi","year":"2012","journal-title":"CVPR"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2015.2419973"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2014.7025449"},{"key":"ref3","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"2009","journal-title":"NIPS"},{"key":"ref6","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"ICML"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.378"},{"key":"ref7","article-title":"Isotropic hashing","author":"kong","year":"2012","journal-title":"NIPS"},{"key":"ref2","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"NIPS"},{"key":"ref9","article-title":"Dis-crete graph hashing","author":"liu","year":"2014","journal-title":"NIPS"},{"key":"ref1","article-title":"Hashing with graphs","author":"liu","year":"2010","journal-title":"ICML"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365720"},{"journal-title":"Perceptions","year":"1969","author":"minsky","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref26","article-title":"Improved hamming distance search using variable length substrings","author":"ong","year":"2016","journal-title":"CVPR"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.170"}],"event":{"name":"2017 IEEE International Conference on Image Processing (ICIP)","start":{"date-parts":[[2017,9,17]]},"location":"Beijing","end":{"date-parts":[[2017,9,20]]}},"container-title":["2017 IEEE International Conference on Image Processing (ICIP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8267582\/8296222\/08296455.pdf?arnumber=8296455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T17:12:31Z","timestamp":1523466751000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8296455\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/icip.2017.8296455","relation":{},"subject":[],"published":{"date-parts":[[2017,9]]}}}