{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:04:17Z","timestamp":1775837057436,"version":"3.50.1"},"reference-count":68,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61772112"],"award-info":[{"award-number":["61772112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61672379"],"award-info":[{"award-number":["61672379"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61370199"],"award-info":[{"award-number":["61370199"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61572463"],"award-info":[{"award-number":["61572463"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"State Key Program of National Natural Science of China","doi-asserted-by":"publisher","award":["61432002"],"award-info":[{"award-number":["61432002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015789","name":"Dalian High-level Talent Innovation Program","doi-asserted-by":"crossref","award":["2015R049"],"award-info":[{"award-number":["2015R049"]}],"id":[{"id":"10.13039\/100015789","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001691","name":"JSPS KAKENHI","doi-asserted-by":"publisher","award":["16F16349"],"award-info":[{"award-number":["16F16349"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council during a visit to Rutgers University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2017.2781360","type":"journal-article","created":{"date-parts":[[2017,12,8]],"date-time":"2017-12-08T20:37:49Z","timestamp":1512765469000},"page":"2039-2054","source":"Crossref","is-referenced-by-count":85,"title":["Binary Hashing for Approximate Nearest Neighbor Search on Big Data: A Survey"],"prefix":"10.1109","volume":"6","author":[{"given":"Yuan","family":"Cao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8770-3934","authenticated-orcid":false,"given":"Heng","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Wenrui","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Jien","family":"Kato","sequence":"additional","affiliation":[]},{"given":"Keqiu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiulong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Gui","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"2058","article-title":"QsRank: Query-sensitive hash code ranking for efficient \n$\\epsilon $\n-neighbor search","author":"zhang","year":"2012","journal-title":"Proc CVPR"},{"key":"ref38","first-page":"1642","article-title":"Hashing for distributed data","author":"leng","year":"2015","journal-title":"Proc ICML"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.267"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465274"},{"key":"ref31","first-page":"1360","article-title":"Learning hash functions for cross-view similarity search","author":"kumar","year":"2011","journal-title":"Proc IJCAI"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.39"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298865"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2015.7351274"},{"key":"ref35","first-page":"1422","article-title":"Online hashing","author":"huang","year":"2013","journal-title":"Proc IJCAI"},{"key":"ref34","first-page":"3890","article-title":"Semantic topic multimodal hashing for cross-media retrieval","author":"wang","year":"2015","journal-title":"Proc CVPR"},{"key":"ref60","article-title":"Learning multiple layers of features from tiny images","author":"krizhevsky","year":"2009"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248087"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref64","article-title":"Caltech-256 object category dataset","author":"griffin","year":"2013","journal-title":"Proc CVPR"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995709"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609600"},{"key":"ref66","first-page":"2957","article-title":"Sperical hashing","author":"heo","year":"2012","journal-title":"Proc CVPR"},{"key":"ref29","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc ICML"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/2393347.2396337"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.378"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1275808.1276382"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1348246.1348248"},{"key":"ref20","first-page":"634","article-title":"Double-bit quantization for hashing","author":"kong","year":"2012","journal-title":"Proc AAAI"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835946"},{"key":"ref21","first-page":"753","article-title":"Variable bit quantisation for lsh","author":"moran","year":"2013","journal-title":"Proc ACL"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540024"},{"key":"ref23","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc CVPR"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995518"},{"key":"ref25","first-page":"1509","article-title":"Locality-sensitive binary codes from shift-invariant kernels","author":"raginsky","year":"2009","journal-title":"Proc NIPS"},{"key":"ref50","first-page":"216","article-title":"Learning to hash with binary deep neural network","author":"do","year":"2016","journal-title":"Proc ECCV"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2467315"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref58","first-page":"251","article-title":"Translingual document representations from discriminative projections","author":"platt","year":"2010","journal-title":"Proc EMNLP"},{"key":"ref57","first-page":"492","article-title":"Improving the multilingual user experience of Wikipedia using cross-language name search","author":"udupa","year":"2010","journal-title":"Proc NAACL"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"ref54","first-page":"2415","article-title":"Deep hashing network for efficient similarity retrieval","author":"zhu","year":"2016","journal-title":"Proc AAAI"},{"key":"ref53","first-page":"1711","article-title":"Feature learning based deep supervised hashing with pairwise labels","author":"li","year":"2016","journal-title":"Proc IJCAI"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298947"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"ref11","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"Proc ICML"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.208"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"ref13","first-page":"1127","article-title":"Sequential projection learning for hashing with compact codes","author":"wang","year":"2010","journal-title":"Proc ICML"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2678475"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2636870"},{"key":"ref16","first-page":"1646","article-title":"Isotropic hashing","author":"kong","year":"2012","journal-title":"Proc NIPS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.103"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.69"},{"key":"ref19","first-page":"1820","article-title":"Harmonious hashing","author":"xu","year":"2013","journal-title":"Proc IJCAI"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1186\/s13640-017-0167-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"ref8","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"Proc NIPS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref49","first-page":"1556","article-title":"Deep semantic ranking based hashing for multi-label image retrieval","author":"zhao","year":"2015","journal-title":"Proc CVPR"},{"key":"ref9","first-page":"1042","article-title":"Learning to hash with binary reconstructive embedding","author":"kulis","year":"2009","journal-title":"Proc NIPS"},{"key":"ref46","first-page":"1183","article-title":"Learning compact binary descriptors with unsupervised deep neural networks","author":"lu","year":"2016","journal-title":"Proc CVPR"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298862"},{"key":"ref48","article-title":"Supervised learning of semantics-preserving hashing via deep neural networks for large-scale image search","volume":"abs 1507 101","author":"yang","year":"2015","journal-title":"CoRR"},{"key":"ref47","first-page":"2156","article-title":"Supervised hashing for image retrieval via image representation learning","author":"xia","year":"2014","journal-title":"Proc AAAI"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.101"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1991996.1992012"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2015.7301269"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2016.0251"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08170203.pdf?arnumber=8170203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T03:00:22Z","timestamp":1633921222000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8170203\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":68,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2781360","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}