{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:13Z","timestamp":1740169153676,"version":"3.37.3"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61773397","61971352","61862043"],"award-info":[{"award-number":["61773397","61971352","61862043"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Basic Research Plan in Shaanxi Province of China","award":["2018JM6015"],"award-info":[{"award-number":["2018JM6015"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["3102019ZY1003","3102019ZY1004"],"award-info":[{"award-number":["3102019ZY1003","3102019ZY1004"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2975883","type":"journal-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T04:08:05Z","timestamp":1582603685000},"page":"42937-42947","source":"Crossref","is-referenced-by-count":3,"title":["Unsupervised Ensemble Hashing: Boosting Minimum Hamming Distance"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5013-2501","authenticated-orcid":false,"given":"Yufei","family":"Zha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1788-7149","authenticated-orcid":false,"given":"Zhuling","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9690-7026","authenticated-orcid":false,"given":"Peng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0541-8612","authenticated-orcid":false,"given":"Wei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.219"},{"key":"ref38","first-page":"539","article-title":"Non-metric locality-sensitive hashing","author":"mu","year":"2010","journal-title":"Proc 24th AAAI Conf Artif Intell (AAAI-10)"},{"key":"ref33","first-page":"1820","article-title":"Harmonious hashing","author":"xu","year":"2013","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref32","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref30","first-page":"1509","article-title":"Locality-sensitive binary codes from shift-invariant kernels","author":"raginsky","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3047307"},{"article-title":"Learning multiple layers of features from tiny images","year":"2009","author":"krizhevsky","key":"ref36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3323873.3325038"},{"key":"ref34","first-page":"3332","article-title":"Sparse projections for high-dimensional binary codes","author":"xia","year":"2015","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit (CVPR)"},{"key":"ref28","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"Proc 28th Int Conf Mach Learn (ICML)"},{"key":"ref27","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst Annu Conf Neural Inf Process Syst"},{"key":"ref29","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"2000","journal-title":"Proc Int Conf Very Large Databases"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2872898"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2924996"},{"key":"ref20","first-page":"539","article-title":"Unsupervised generative adversarial cross-modal hashing","author":"zhang","year":"2018","journal-title":"Proc AAAI 2nd Nat Conf Artif Intell"},{"key":"ref22","first-page":"490","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44851-9_12"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.09.042"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2019.2922128"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-7299-4_52"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2804763"},{"key":"ref50","first-page":"211","article-title":"Learning weighted hashing on local structured data","author":"li","year":"2016","journal-title":"Proc IEEE Int Conf Image Process (ICIP)"},{"key":"ref51","first-page":"167","article-title":"An ensemble hashing framework for fast image retrieval","author":"li","year":"2017","journal-title":"Proc Adv Internetwork Data Web Technol"},{"key":"ref59","first-page":"1655","article-title":"Isotropic hashing","author":"kong","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref58","first-page":"2957","article-title":"Spherical hashing","author":"heo","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00386"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.133"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"ref53","first-page":"946","article-title":"Circulant binary embedding","author":"yu","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000013087.49260.fb"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2763600"},{"journal-title":"Principal Component Analysis","year":"1989","author":"jolliffe","key":"ref40"},{"key":"ref11","first-page":"1018","article-title":"Beyond locality-sensitive hashing","author":"andoni","year":"2013","journal-title":"Proc Annu ACM-SIAM Symp Discrete Algorithm"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1360\/N972014-00841"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2017.2771332"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2868826"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.253"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.317"},{"key":"ref19","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3240508.3240560"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348293"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ipr.2015.0848"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3231737"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2934321"},{"key":"ref49","first-page":"1631","article-title":"Complementary hashing for approximate nearest neighbor search","author":"xu","year":"2011","journal-title":"Proc Int Conf Comput Vis"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1996.548872"},{"key":"ref45","first-page":"231","article-title":"Neural network ensembles, cross validation, and active learning","author":"krogh","year":"1995","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref48","first-page":"148","article-title":"Experiments with a new boosting algorithm","author":"freund","year":"1996","journal-title":"Proc 13th Int Conf Mach Learn"},{"key":"ref47","first-page":"757","article-title":"An ensemble diversity approach to supervised binary hashing","author":"carreira-perpi\u00f1\u00e1n","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref42","first-page":"153","article-title":"Locality preserving projections","author":"he","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540039"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45014-9_1"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058655"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09007381.pdf?arnumber=9007381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:08:13Z","timestamp":1641949693000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9007381\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":59,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2975883","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}