{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:01:16Z","timestamp":1767034876974,"version":"3.37.3"},"reference-count":42,"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":["61906091"],"award-info":[{"award-number":["61906091"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province, China,","doi-asserted-by":"publisher","award":["BK20190440"],"award-info":[{"award-number":["BK20190440"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["30919011229"],"award-info":[{"award-number":["30919011229"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Nanjing Scientific Innovation Funds for Returned Scholars in 2019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3003072","type":"journal-article","created":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T22:17:48Z","timestamp":1592432268000},"page":"113814-113825","source":"Crossref","is-referenced-by-count":1,"title":["Semi-Paired Asymmetric Deep Cross-Modal Hashing Learning"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2578-7693","authenticated-orcid":false,"given":"Yi","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8494-4532","authenticated-orcid":false,"given":"Xiaobo","family":"Shen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2889-796X","authenticated-orcid":false,"given":"Zhenmin","family":"Tang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8359-3387","authenticated-orcid":false,"given":"Tao","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1438-0078","authenticated-orcid":false,"given":"Jianyong","family":"Lv","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.142"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3323873.3325045"},{"key":"ref33","first-page":"1618","article-title":"Pairwise relationship guided deep hashing for cross-modal retrieval","author":"yang","year":"2017","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.348"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00446"},{"key":"ref30","first-page":"823","article-title":"Cluster canonical correlation analysis","author":"rasiwasia","year":"2014","journal-title":"Proc Int Conf Artif Intell Stat"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2897249"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2899536"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2832141"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01267-0_36"},{"key":"ref10","first-page":"3419","article-title":"Discrete graph hashing","author":"liu","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/1460096.1460104","article-title":"The MIR flickr retrieval evaluation","author":"huiskes","year":"2008","journal-title":"Proc ACM Int Conf Multimedia Inf Retrieval (MIR)"},{"key":"ref11","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc Int Conf Int Conf Mach Learn"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3178119"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539928"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.267"},{"key":"ref16","first-page":"2179","article-title":"Large-scale supervised multimodal hashing with semantic correlation maximization","author":"zhang","year":"2014","journal-title":"Proc 28th AAAI Conf Artif Intell"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2866771"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/396"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00312"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.5244\/C.28.6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.04.072"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2927524"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2016.2592329"},{"key":"ref6","article-title":"Hashing for similarity search: A survey","author":"wang","year":"2014","journal-title":"arXiv 1408 2927"},{"key":"ref29","first-page":"3946","article-title":"Quantized correlation hashing for fast cross-modal search","author":"wu","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0391-4"},{"key":"ref8","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume":"99","author":"gionis","year":"1999","journal-title":"VLDB"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2652730"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2567386"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2606441"},{"key":"ref22","first-page":"3904","article-title":"Learning to hash on partial multi-modal data","author":"wang","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465274"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2733373.2807412"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502107"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"key":"ref23","first-page":"1360","article-title":"Learning hash functions for cross-view similarity search","author":"kumar","year":"2011","journal-title":"Proc 32nd Int Joint Conf Artif Intell"},{"key":"ref26","first-page":"3342","article-title":"Asymmetric deep supervised hashing","author":"jiang","year":"2017","journal-title":"Proc AAAI"},{"key":"ref25","first-page":"2291","article-title":"Deep multimodal hashing with orthogonal regularization","author":"wang","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09119427.pdf?arnumber=9119427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:08:37Z","timestamp":1641949717000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9119427\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3003072","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}