{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T07:35:22Z","timestamp":1776152122830,"version":"3.50.1"},"reference-count":81,"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":["61771322"],"award-info":[{"award-number":["61771322"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61375015"],"award-info":[{"award-number":["61375015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Foundation of Shenzhen","award":["JCYJ20160307154630057"],"award-info":[{"award-number":["JCYJ20160307154630057"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2968154","type":"journal-article","created":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T20:43:47Z","timestamp":1579553027000},"page":"15377-15391","source":"Crossref","is-referenced-by-count":34,"title":["A Review of Hashing Methods for Multimodal Retrieval"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8174-6167","authenticated-orcid":false,"given":"Wenming","family":"Cao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1586-4165","authenticated-orcid":false,"given":"Wenshuo","family":"Feng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0221-2464","authenticated-orcid":false,"given":"Qiubin","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4059-4806","authenticated-orcid":false,"given":"Guitao","family":"Cao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2647-8286","authenticated-orcid":false,"given":"Zhihai","family":"He","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref73","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":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.142"},{"key":"ref71","first-page":"1097","article-title":"Imagenet classification with deep convolutional neural networks","author":"krizhevsky","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref70","article-title":"Return of the devil in the details: Delving deep into convolutional nets","author":"chatfield","year":"2014","journal-title":"ArXiv 1405 3531"},{"key":"ref76","first-page":"740","article-title":"Microsoft COCO: Common objects in context","author":"lin","year":"2014","journal-title":"Proc Eur Conf Comput Vis (ECCV)"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238354"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"key":"ref39","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":"ref75","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2009.03.008"},{"key":"ref38","first-page":"1376","article-title":"Co-regularized hashing for multimodal data","author":"zhen","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref79","article-title":"Very deep convolutional networks for large-scale image recognition","author":"simonyan","year":"2014","journal-title":"arXiv 1409 1556"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767725"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2013.2276713"},{"key":"ref31","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref30","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539928"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502107"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465274"},{"key":"ref34","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":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7439(87)80084-9"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2002.1007592"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015408"},{"key":"ref63","first-page":"467","article-title":"A probabilistic interpretation of svms with an application to unbalanced classification","author":"grandvalet","year":"2006","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.103"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553523"},{"key":"ref27","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":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401969"},{"key":"ref66","first-page":"801","article-title":"Efficient sparse coding algorithms","author":"lee","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref67","first-page":"679","article-title":"Large graph construction for scalable semi-supervised learning","author":"liu","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn (ICML)"},{"key":"ref68","article-title":"Learning task-specific similarity","author":"shakhnarovich","year":"2005"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1017\/S0020268100041275"},{"key":"ref2","first-page":"1631","article-title":"Complementary hashing for approximate nearest neighbor search","author":"xu","year":"2011","journal-title":"Proc Int Conf Comput Vis"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223794"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540129"},{"key":"ref21","first-page":"1127","article-title":"Sequential projection learning for hashing with compact codes","author":"wang","year":"2010","journal-title":"Proc 27th Int Conf Int Conf Mach Learn"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.107"},{"key":"ref26","first-page":"1646","article-title":"Isotropic hashing","author":"kong","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc Int Conf Int Conf Mach Learn"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2832141"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2899536"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2011.2167223"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2005.843341"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2866771"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2625747"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.10.082"},{"key":"ref53","first-page":"159","article-title":"Adversary guided asymmetric hashing for cross-modal retrieval","author":"gu","year":"2019","journal-title":"Proc ACM Int Conf Multimedia Retr (ICMR)"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2897249"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-03-03403-2"},{"key":"ref40","first-page":"3890","article-title":"Semantic topic multimodal hashing for cross-media retrieval","author":"wang","year":"2015","journal-title":"Proc 24th Int Joint Conf Artif Intell"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348293"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199401)45:1<12::AID-ASI2>3.0.CO;2-L"},{"key":"ref15","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume":"99","author":"gionis","year":"1999","journal-title":"Proc VLDB"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref81","first-page":"1188","article-title":"Distributed representations of sentences and documents","author":"le","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","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"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060840"},{"key":"ref19","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref80","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013","journal-title":"arXiv 1301 3781 [cs]"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1038\/nature14539","article-title":"Deep learning","volume":"521","author":"lecun","year":"2015","journal-title":"Nature"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1965.264258"},{"key":"ref6","first-page":"2672","article-title":"Generative adversarial nets","author":"goodfellow","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2005.12.005"},{"key":"ref8","volume":"24","author":"park","year":"1995","journal-title":"An Effective Hash-based Algorithm for Mining Association Rules ACM"},{"key":"ref7","first-page":"360","article-title":"Fast algorithms for sorting and searching strings","author":"bentley","year":"1997","journal-title":"Proc 8th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref49","first-page":"591","article-title":"Attention-aware deep adversarial hashing for cross-modal retrieval","author":"zhang","year":"2018","journal-title":"Proc Eur Conf Comput Vis (ECCV)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/21.286391"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.348"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-017-4567-3"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00446"},{"key":"ref47","first-page":"1618","article-title":"Pairwise relationship guided deep hashing for cross-modal retrieval","author":"yang","year":"2017","journal-title":"Proc 31st AAAI Conf Artif Intell"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.267"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299011"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2014.04.001"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609610"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08963910.pdf?arnumber=8963910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T19:35:02Z","timestamp":1643312102000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8963910\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":81,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2968154","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}