{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:17:03Z","timestamp":1729642623584,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1109\/icip.2017.8296404","type":"proceedings-article","created":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T22:03:23Z","timestamp":1519337003000},"page":"865-869","source":"Crossref","is-referenced-by-count":0,"title":["Efficient similarity learning for asymmetric hashing"],"prefix":"10.1109","author":[{"given":"Cheng","family":"Da","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunlei","family":"Huo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiming","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunhong","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"2248","article-title":"Scalable graph hashing with feature transformation","author":"jiang","year":"2015","journal-title":"IJCAI"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2404776"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.131"},{"key":"ref13","first-page":"2823","article-title":"The power of asymmetry in binary hashing","author":"neyshabur","year":"2013","journal-title":"NIPS"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.472"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref16","first-page":"1230","article-title":"Column sampling based discrete supervised hashing","author":"kang","year":"2016","journal-title":"AAAI"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.102"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.101"},{"key":"ref19","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"ICML"},{"key":"ref28","first-page":"1","author":"cai","year":"2016","journal-title":"A revisit of hashing algorithms for approximate nearest neighbor search"},{"key":"ref4","first-page":"2156","article-title":"Supervised hashing for image retrieval via image representation learning","author":"xia","year":"2014","journal-title":"AAAI"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1023\/A:1011139631724","article-title":"Modeling the shape of the scene: A holistic representation of the spatial envelope","volume":"42","author":"oliva","year":"2001","journal-title":"IJCV"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref5","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"VLDB"},{"key":"ref8","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"NIPS"},{"key":"ref7","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"CVPR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"key":"ref9","first-page":"1839","article-title":"Hashing on nonlinear manifolds","volume":"24","author":"shen","year":"2015","journal-title":"TIP"},{"key":"ref1","first-page":"1","author":"wang","year":"2014","journal-title":"Hashing for similarity search A survey"},{"key":"ref20","first-page":"3419","article-title":"Discrete graph hashing","author":"liu","year":"2014","journal-title":"NIPS"},{"key":"ref22","first-page":"2957","article-title":"Spherical hashing","author":"heo","year":"2012","journal-title":"CVPR"},{"key":"ref21","first-page":"1655","article-title":"Isotropic hashing","author":"kong","year":"2012","journal-title":"NIPS"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47979-1_52"},{"key":"ref23","first-page":"11","article-title":"Learning distance functions using equivalence relations","author":"bar-hillel","year":"2003","journal-title":"ICML"},{"key":"ref26","first-page":"3655","article-title":"Large scale similarity learning using similar pairs for person verification","author":"yang","year":"2016","journal-title":"AAAI"},{"key":"ref25","first-page":"1109","article-title":"Large scale online learning of image similarity through ranking","volume":"11","author":"chechik","year":"2010","journal-title":"JMLR"}],"event":{"name":"2017 IEEE International Conference on Image Processing (ICIP)","start":{"date-parts":[[2017,9,17]]},"location":"Beijing","end":{"date-parts":[[2017,9,20]]}},"container-title":["2017 IEEE International Conference on Image Processing (ICIP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8267582\/8296222\/08296404.pdf?arnumber=8296404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T13:40:18Z","timestamp":1570801218000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8296404\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/icip.2017.8296404","relation":{},"subject":[],"published":{"date-parts":[[2017,9]]}}}