{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:58:40Z","timestamp":1760385520799,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673204","61273257","61321491"],"award-info":[{"award-number":["61673204","61273257","61321491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program for Distinguished Talents of Jiangsu Province, China","award":["2013-XXRJ-018"],"award-info":[{"award-number":["2013-XXRJ-018"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["020214380026"],"award-info":[{"award-number":["020214380026"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multimedia"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1109\/tmm.2016.2614858","type":"journal-article","created":{"date-parts":[[2016,10,3]],"date-time":"2016-10-03T18:13:57Z","timestamp":1475518437000},"page":"382-392","source":"Crossref","is-referenced-by-count":11,"title":["Hashing With Pairwise Correlation Learning and Reconstruction"],"prefix":"10.1109","volume":"19","author":[{"given":"Xiao-Jiao","family":"Mao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Bin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Li","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","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289451"},{"key":"ref33","first-page":"663","article-title":"Robust subspace segmentation\n by low-rank representation","author":"liu","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2015.7301269"},{"key":"ref31","first-page":"2156","article-title":"Supervised hashing for image retrieval via image representation learning","author":"xia","year":"0","journal-title":"Proc 28th AAAI Conf Artif Intell"},{"key":"ref30","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref37","first-page":"2328","article-title":"Non-negative low rank and sparse graph for\n semi-supervised learning","author":"zhuang","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recog"},{"key":"ref36","first-page":"347","article-title":"Robust and\n efficient subspace segmentation via least squares regression","author":"lu","year":"0","journal-title":"Proc 12th Eur Conf Comput Vis Part VII"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.62"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.103"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.388"},{"key":"ref11","first-page":"250","article-title":"Graph cuts for supervised\n binary coding","author":"ge","year":"0","journal-title":"Proc 13th Eur Conf Comput Vis Part VII"},{"key":"ref12","first-page":"142","article-title":"Learning hash functions using column generation","author":"li","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10578-9_40"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2013.2291214"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2015.2455415"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2015.2419973"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-015-4192-0"},{"key":"ref18","first-page":"1509","article-title":"Locality-sensitive binary codes from shift-invariant kernels","author":"raginsky","year":"0","journal-title":"Proc 23rd Annu Conf Adv Neural Inform Process Syst 22"},{"key":"ref19","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"0","journal-title":"Proc 28th Int Conf Mach Learn"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08010-9_3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"ref3","first-page":"1753","article-title":"Spectral\n hashing","author":"weiss","year":"0","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.272"},{"key":"ref29","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"0","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.378"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.39"},{"key":"ref7","first-page":"2957","article-title":"Spherical hashing","author":"heo","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recog"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.69"},{"key":"ref1","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.317"},{"key":"ref21","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"0","journal-title":"Proc 2012 IEEE Conf Comput Vis Pattern Recog"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2361319"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28661-2_3"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.205"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2404776"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.240"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.231"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"}],"container-title":["IEEE Transactions on Multimedia"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6046\/7820230\/07581046.pdf?arnumber=7581046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:11:52Z","timestamp":1642003912000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7581046\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":44,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tmm.2016.2614858","relation":{},"ISSN":["1520-9210","1941-0077"],"issn-type":[{"type":"print","value":"1520-9210"},{"type":"electronic","value":"1941-0077"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}