{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:27:34Z","timestamp":1758274054786,"version":"3.37.3"},"reference-count":60,"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":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772296"],"award-info":[{"award-number":["61772296"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012271","name":"Shenzhen Fundamental Research and Discipline Layout project","doi-asserted-by":"publisher","award":["JCYJ20170412170438636"],"award-info":[{"award-number":["JCYJ20170412170438636"]}],"id":[{"id":"10.13039\/501100012271","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.2020.3040536","type":"journal-article","created":{"date-parts":[[2020,12,3]],"date-time":"2020-12-03T20:54:38Z","timestamp":1607028878000},"page":"1130-1142","source":"Crossref","is-referenced-by-count":10,"title":["A Scalable Optimization Mechanism for Pairwise Based Discrete Hashing"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4934-0850","authenticated-orcid":false,"given":"Xiaoshuang","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0982-8675","authenticated-orcid":false,"given":"Fuyong","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6754-5123","authenticated-orcid":false,"given":"Zizhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8409-0397","authenticated-orcid":false,"given":"Manish","family":"Sapkota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8201-0864","authenticated-orcid":false,"given":"Zhenhua","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"167","article-title":"The elastic embedding algorithm for dimensionality reduction","volume":"10","author":"carreira-perpi\u00f1an","year":"2010","journal-title":"Proc ICML"},{"key":"ref38","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.223"},{"key":"ref32","first-page":"3911","article-title":"Ranking preserving hashing for fast similarity search","author":"wang","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.377"},{"key":"ref30","first-page":"142","article-title":"Learning hash functions using column generation","author":"li","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.641"},{"key":"ref36","first-page":"1556","article-title":"Deep semantic ranking based hashing for multi-label image retrieval","author":"zhao","year":"2015","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit (CVPR)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298947"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.546"},{"key":"ref60","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JBHI.2018.2827703"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2015.7301269"},{"key":"ref29","first-page":"1061","article-title":"Hamming distance metric learning","author":"norouzi","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","first-page":"3419","article-title":"Discrete graph hashing","author":"liu","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"ref20","first-page":"1230","article-title":"Column sampling based discrete supervised hashing","author":"kang","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.128"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref23","first-page":"740","article-title":"Microsoft COCO: Common objects in context","author":"lin","year":"2014","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.222"},{"key":"ref25","article-title":"Fast supervised discrete hashing and its analysis","author":"koutaki","year":"2016","journal-title":"arXiv 1611 10017"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-020-01299-x"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.03.015"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref58","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":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/279232.279236"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.253"},{"key":"ref52","first-page":"679","article-title":"Large graph construction for scalable semi-supervised learning","author":"liu","year":"2010","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref10","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2404776"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.103"},{"key":"ref13","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.317"},{"key":"ref15","first-page":"419","article-title":"Kernel-based supervised discrete hashing for image retrieval","author":"shi","year":"2016","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref16","first-page":"2823","article-title":"The power of asymmetry in binary hashing","author":"neyshabur","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.472"},{"key":"ref18","first-page":"2541","article-title":"Asymmetric discrete graph hashing","author":"shi","year":"2017","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref19","first-page":"2156","article-title":"Supervised hashing for image retrieval via image representation learning","volume":"1","author":"xia","year":"2014","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2781360"},{"key":"ref6","first-page":"886","article-title":"In defense of minhash over simhash","volume":"33","author":"shrivastava","year":"2014","journal-title":"Proc 17th Int Conf Artif Intell Statist"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"ref8","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":"ref7","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref49","first-page":"1","article-title":"Asymmetric deep supervised hashing","author":"jiang","year":"2018","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref46","first-page":"2482","article-title":"Deep supervised discrete hashing","author":"li","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.598"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3123266.3123345"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00134"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835455"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609600"},{"key":"ref44","article-title":"Feature learning based deep supervised hashing with pairwise labels","author":"li","year":"2015","journal-title":"arXiv 1511 03855"},{"key":"ref43","first-page":"2415","article-title":"Deep hashing network for efficient similarity retrieval","author":"zhu","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/83\/9263394\/09280410.pdf?arnumber=9280410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:15Z","timestamp":1652194215000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9280410\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/tip.2020.3040536","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"type":"print","value":"1057-7149"},{"type":"electronic","value":"1941-0042"}],"subject":[],"published":{"date-parts":[[2021]]}}}