{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:39:47Z","timestamp":1766137187432,"version":"3.37.3"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/tip.2019.2912290","type":"journal-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T20:10:09Z","timestamp":1557346209000},"page":"4803-4818","source":"Crossref","is-referenced-by-count":103,"title":["Scalable Supervised Asymmetric Hashing With Semantic and Latent Factor Embedding"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1470-6998","authenticated-orcid":false,"given":"Zheng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4388-3080","authenticated-orcid":false,"given":"Zhihui","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9738-4949","authenticated-orcid":false,"given":"Zi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5214-7114","authenticated-orcid":false,"given":"Wai Keung","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5487-9845","authenticated-orcid":false,"given":"Guo-Sen","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8264-6117","authenticated-orcid":false,"given":"Ling","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911502"},{"key":"ref70","first-page":"2823","article-title":"The power of asymmetry in binary hashing","author":"neyshabur","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"Horizontal pyramid matching for person re-identification","year":"2019","author":"fu","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2255300"},{"key":"ref33","first-page":"1230","article-title":"Column sampling based discrete supervised hashing","author":"kang","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609600"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.205"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2799862"},{"key":"ref37","first-page":"1","article-title":"Grassmann Hashing for approximate nearest neighbor search in high dimensional space","author":"wang","year":"2011","journal-title":"Proc IEEE Int Conf Multimedia Expo"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2114354"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.253"},{"key":"ref60","first-page":"2156","article-title":"Supervised hashing for image retrieval via image representation learning","author":"xia","year":"2014","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref62","first-page":"1711","article-title":"Feature learning based deep supervised hashing with pairwise labels","author":"li","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298947"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.227"},{"key":"ref28","first-page":"2248","article-title":"Scalable graph hashing with feature transformation","author":"jiang","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref64","first-page":"2415","article-title":"Deep hashing network for efficient similarity retrieval","author":"zhu","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref27","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.96"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.598"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"ref67","first-page":"456","article-title":"Asymmetric deep supervised hashing","author":"jiang","year":"2018","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2882816"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390358"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2789887"},{"key":"ref20","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2283497"},{"key":"ref21","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref24","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2018.2889727"},{"key":"ref26","first-page":"10","article-title":"SADIH: Semantic-aware discrete hashing","author":"zhang","year":"2019","journal-title":"Proc 33rd AAAI Conf Artif Intell"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.317"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0584-1"},{"key":"ref51","first-page":"1813","article-title":"Efficient and robust feature selection via joint \n$l_{2}1$\n-norms minimization","author":"nie","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.140"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10584-0_26"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539970"},{"article-title":"The Caltech-256 object category dataset","year":"2007","author":"griffin","key":"ref54"},{"key":"ref53","article-title":"Learning multiple layers of features from tiny images","volume":"1","author":"krizhevsky","year":"2009"},{"journal-title":"Principles of Mathematical Analysis","year":"1964","author":"rudin","key":"ref52"},{"key":"ref10","first-page":"2527","article-title":"Compressed K-Means for large-scale clustering","author":"shen","year":"2017","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2847335"},{"key":"ref40","first-page":"817","article-title":"Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval","author":"gong","year":"2011","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01258-8_44"},{"key":"ref13","first-page":"19","article-title":"Web scale photo hash clustering on a single machine","author":"gong","year":"2015","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref14","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"Proc Very Large Data Bases"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref16","first-page":"1225","article-title":"Practical and optimal LSH for angular distance","author":"andoni","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126421"},{"key":"ref18","first-page":"2321","article-title":"Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS)","author":"shrivastava","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","first-page":"946","article-title":"Circulant binary embedding","author":"yu","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.125"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10584-0_17"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2636870"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2678475"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080767"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2737538"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-017-1007-9"},{"key":"ref9","first-page":"1","article-title":"Attentive region embedding network for zero-shot learning","author":"xie","year":"2019","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186072"},{"key":"ref45","first-page":"10","article-title":"$\\text{R}^{2}$\nSDH: robust rotated supervised discrete hashing","author":"gui","year":"2018","journal-title":"Proc ACM SIGKDD Int Conf Knowledge Discovery and Data Mining"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2017.2699863"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.101"},{"key":"ref42","first-page":"3017","article-title":"Cartesian k-means","author":"mohammad","year":"2013","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2019.2903661"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2651396"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2772264"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/83\/8784442\/08709760.pdf?arnumber=8709760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:44:27Z","timestamp":1657745067000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8709760\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":71,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tip.2019.2912290","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"type":"print","value":"1057-7149"},{"type":"electronic","value":"1941-0042"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}