{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T22:08:38Z","timestamp":1775340518699,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/cvpr.2012.6247912","type":"proceedings-article","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T15:05:51Z","timestamp":1343833551000},"page":"2074-2081","source":"Crossref","is-referenced-by-count":373,"title":["Supervised hashing with kernels"],"prefix":"10.1109","author":[{"family":"Wei Liu","sequence":"first","affiliation":[]},{"family":"Jun Wang","sequence":"additional","affiliation":[]},{"family":"Rongrong Ji","sequence":"additional","affiliation":[]},{"family":"Yu-Gang Jiang","sequence":"additional","affiliation":[]},{"family":"Shih-Fu Chang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Complementary hashing for approximate nearest neighbor search","author":"xu","year":"2011","journal-title":"Proc ICCV"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"18","article-title":"Spectral hashing","volume":"21","author":"weiss","year":"2008","journal-title":"NIPS"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.128"},{"key":"16","article-title":"Small codes and large databases for recognition","author":"torralba","year":"2008","journal-title":"Proc CVPR"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.103"},{"key":"11","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"Proc ICML"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540039"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"10","author":"nesterov","year":"2003","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.151"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.219"},{"key":"5","article-title":"Learning to hash with binary reconstructive embeddings","volume":"22","author":"kulis","year":"2009","journal-title":"NIPS"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126421"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540024"},{"key":"8","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc ICML"}],"event":{"name":"2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","location":"Providence, RI","start":{"date-parts":[[2012,6,16]]},"end":{"date-parts":[[2012,6,21]]}},"container-title":["2012 IEEE Conference on Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6235193\/6247647\/06247912.pdf?arnumber=6247912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T20:22:17Z","timestamp":1490127737000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6247912\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2012.6247912","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}