{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T05:49:49Z","timestamp":1744436989255,"version":"3.37.3"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972188"],"award-info":[{"award-number":["61972188"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tip.2021.3093387","type":"journal-article","created":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T19:55:28Z","timestamp":1625514928000},"page":"6321-6334","source":"Crossref","is-referenced-by-count":6,"title":["Learning Efficient Hash Codes for Fast Graph-Based Data Similarity Retrieval"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5916-8965","authenticated-orcid":false,"given":"Jinbao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Shuo","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1701-9141","authenticated-orcid":false,"given":"Feng","family":"Zheng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0176-3088","authenticated-orcid":false,"given":"Ke","family":"Lu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2549-8322","authenticated-orcid":false,"given":"Jingkuan","family":"Song","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8264-6117","authenticated-orcid":false,"given":"Ling","family":"Shao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38221-5_21"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2017.2703636"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2015.2455415"},{"key":"ref30","first-page":"2957","article-title":"Spherical hashing","author":"heo","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref37","first-page":"2475","article-title":"Deep hashing for compact binary codes learning","author":"liong","year":"2015","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit (CVPR)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2845842"},{"key":"ref35","first-page":"1","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"2009","journal-title":"Proc NIPS"},{"key":"ref34","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref27","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"Proc VLDB"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.378"},{"key":"ref2","first-page":"1","article-title":"Asymmetric deep supervised hashing","author":"jiang","year":"2018","journal-title":"Proc AAAI"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref20","article-title":"Graph matching networks for learning the similarity of graph structured objects","author":"li","year":"2019","journal-title":"arXiv 1904 12787"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2822810"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2020.2963957"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2793863"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2019.2935680"},{"key":"ref25","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2016.23185"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978370"},{"key":"ref58","first-page":"1","article-title":"Visualizing data using t-SNE","volume":"9","author":"van der maaten","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"ref56","article-title":"How powerful are graph neural networks?","author":"xu","year":"2018","journal-title":"arXiv 1810 00826"},{"key":"ref55","first-page":"1","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"Proc NIPS"},{"key":"ref54","article-title":"Graph attention networks","author":"velickovic","year":"2018","journal-title":"arXiv 1710 10903"},{"key":"ref53","article-title":"Residual gated graph ConvNets","author":"bresson","year":"2017","journal-title":"arXiv 1711 07553"},{"key":"ref52","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2016","journal-title":"arXiv 1609 02907"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref11","article-title":"Graph attention networks","author":"veli?kovi?","year":"2017","journal-title":"arXiv 1710 10903"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/ima.20146"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3026079"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330982"},{"key":"ref14","article-title":"Learning deep generative models of graphs","author":"li","year":"2018","journal-title":"arXiv 1803 03324"},{"key":"ref15","article-title":"GC-LSTM: Graph convolution embedded LSTM for dynamic link prediction","author":"chen","year":"2018","journal-title":"arXiv 1812 04206"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.28"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505723"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-012-0284-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2922738"},{"key":"ref3","article-title":"Deep image retrieval: A survey","author":"chen","year":"2021","journal-title":"arXiv 2101 11282"},{"key":"ref6","first-page":"1","article-title":"Are scene graphs good enough to improve image captioning?","author":"milewski","year":"2020","journal-title":"Proc 1st Conf Asia–Pacific Chapter Assoc Comput Linguistics 10th Int Joint Conf Natural Lang Process"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2789887"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-016-0966-6"},{"key":"ref49","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","author":"shervashidze","year":"2009","journal-title":"Proc Artif Intell Statist"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"ref46","article-title":"Understanding attention and generalization in graph neural networks","author":"knyazev","year":"2019","journal-title":"arXiv 1905 02850"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"article-title":"Learning multiple layers of features from tiny images","year":"2009","author":"krizhevsky","key":"ref48"},{"key":"ref47","article-title":"Benchmarking graph neural networks","author":"dwivedi","year":"2020","journal-title":"arXiv 2003 00982"},{"key":"ref42","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"erd?s","year":"1960","journal-title":"Publ Math Inst Hungarian Acad Sci"},{"key":"ref41","first-page":"1","article-title":"Deep hashing network for efficient similarity retrieval","author":"zhu","year":"2016","journal-title":"Proc 30th AAAI Conf Artif Intell"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134018"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","article-title":"IAM graph database repository for graph based pattern recognition and machine learning","author":"riesen","year":"2008","journal-title":"Structural Syntactic and Statistical Pattern Recognition"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/83\/9263394\/09474952.pdf?arnumber=9474952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:07Z","timestamp":1652194207000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9474952\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":58,"URL":"https:\/\/doi.org\/10.1109\/tip.2021.3093387","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"type":"print","value":"1057-7149"},{"type":"electronic","value":"1941-0042"}],"subject":[],"published":{"date-parts":[[2021]]}}}