{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T08:11:06Z","timestamp":1784621466977,"version":"3.55.0"},"reference-count":179,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61632007"],"award-info":[{"award-number":["61632007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2018,4,1]]},"DOI":"10.1109\/tpami.2017.2699960","type":"journal-article","created":{"date-parts":[[2017,5,2]],"date-time":"2017-05-02T18:23:31Z","timestamp":1493749411000},"page":"769-790","source":"Crossref","is-referenced-by-count":779,"title":["A Survey on Learning to Hash"],"prefix":"10.1109","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4888-4445","authenticated-orcid":false,"given":"Jingdong","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ting","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2549-8322","authenticated-orcid":false,"given":"Jingkuan","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicu","family":"Sebe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2999-2088","authenticated-orcid":false,"given":"Heng Tao","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0184"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299085"},{"key":"ref171","first-page":"838","article-title":"Composite\n quantization for approximate nearest neighbor search","author":"zhang","year":"2014","journal-title":"Proc Int Conf Mach Learning"},{"key":"ref174","first-page":"1556","article-title":"Deep semantic ranking based hashing for\n multi-label image retrieval","author":"zhao","year":"2015","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.224"},{"key":"ref176","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0249-y"},{"key":"ref175","first-page":"2874","article-title":"Locality\n preserving hashing","author":"zhao","year":"2014","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502107"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.1145\/2457465.2457469"},{"key":"ref168","first-page":"3669","article-title":"Discrete image hashing using large weakly annotated photo\n collections","author":"zhang","year":"2016","journal-title":"Proc 30th AAAI Conf Artif Intell"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502091"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995518"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/18.720541"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.69"},{"key":"ref32","first-page":"250","article-title":"Graph cuts for supervised\n binary coding","author":"ge","year":"2014","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.379"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2733373.2806360"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.101"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"ref34","first-page":"1205","article-title":"Angular quantization-based binary codes\n for fast similarity search","author":"gong","year":"2012","journal-title":"Proc 25th Int Conf Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2004.383"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.325"},{"key":"ref179","doi-asserted-by":"publisher","DOI":"10.1145\/2072298.2072039"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref22","first-page":"248","article-title":"Imagenet: A large-scale hierarchical image database","author":"deng","year":"2009","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref21","first-page":"1814","article-title":"Fast, accurate detection of 100, 000 object classes on a single machine","author":"dean","year":"2013","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46454-1_14"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.131"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1007\/s13735-012-0003-7"},{"key":"ref26","article-title":"Inner product similarity search using compositional codes","author":"du","year":"2014","journal-title":"CoRR"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1137\/050646858"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46475-6_49"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540039"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.222"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2507851"},{"key":"ref156","first-page":"1753","article-title":"Spectral\n hashing","author":"weiss","year":"2008","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33715-4_25"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502100"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.125"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.265"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.377"},{"key":"ref147","article-title":"Hashing for similarity search: A survey","author":"wang","year":"2014","journal-title":"CoRR"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1145\/2647868.2654898"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2324592"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27671-7_27"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2012.2231061"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/1991996.1992012"},{"key":"ref56","first-page":"2248","article-title":"Scalable graph hashing with feature transformation","author":"jiang","year":"2015","journal-title":"Proc 24th Int Conf Artif Intell"},{"key":"ref55","first-page":"108","article-title":"Super-bit locality-sensitive hashing","author":"ji","year":"2012","journal-title":"Proc 25th Int Conf Neural Inf Process Syst"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.119"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288307"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835946"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911502"},{"key":"ref166","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835455"},{"key":"ref165","first-page":"946","article-title":"Circulant binary embedding","author":"yu","year":"2014","journal-title":"Proc Int Conf Mach Learning"},{"key":"ref164","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2016.2516024"},{"key":"ref163","first-page":"1855","article-title":"Smart hashing update for fast response","author":"yang","year":"2013","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref162","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.251"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2676345"},{"key":"ref160","first-page":"1631","article-title":"Complementary\n hashing for approximate nearest neighbor search","author":"xu","year":"2011","journal-title":"Proc IEEE Int Conf Comput Vis"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248038"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299052"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90070-9"},{"key":"ref5","first-page":"6884","article-title":"Beyond\n ”project and sign” for cosine estimation with binary codes","author":"balu","year":"2014","journal-title":"Proc IEEE Int Conf Acoustics Speech Signal Process"},{"key":"ref159","first-page":"1820","article-title":"Harmonious\n hashing","author":"xu","year":"2013","journal-title":"Proc 23rd Int Joint Conf Artif Intell"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558487"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88682-2_24"},{"key":"ref7","first-page":"2088","article-title":"Picodes: Learning a compact code for novel-category recognition","author":"bergamo","year":"2011","journal-title":"Proc 24th Int Conf Neural Inf Proc Syst"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.76"},{"key":"ref158","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":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539852"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.272"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.219"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4517737"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46478-7_42"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.274"},{"key":"ref41","first-page":"2957","article-title":"Spherical hashing","author":"heo","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref43","first-page":"1422","article-title":"Online\n hashing","author":"huang","year":"2013","journal-title":"Proc Int Conf Artif Intell"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2612883"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.205"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.10.018"},{"key":"ref73","first-page":"1387","article-title":"b-bit minwise\n hashing for estimating three-way similarities","author":"li","year":"2010","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772759"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33460-3_36"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150436"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46478-7_26"},{"key":"ref70","first-page":"873","article-title":"Conditional random\n sampling: A sketch-based sampling technique for sparse data","author":"li","year":"2006","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.253"},{"key":"ref130","first-page":"557","article-title":"Densifying one permutation hashing via rotation for fast near neighbor","author":"shrivastava","year":"2014","journal-title":"Proc 31st Int Conf Int Conf Mach Learn"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.317"},{"key":"ref74","first-page":"3122","article-title":"One permutation\n hashing","author":"li","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2012.2199970"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2515990"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2013.2271746"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141964"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540129"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.223"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.64"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.103"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465274"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.153"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.128"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.39"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247943"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995709"},{"key":"ref63","first-page":"1655","article-title":"Isotropic hashing","author":"kong","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2004.1319980"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1145\/1124772.1124782"},{"key":"ref65","first-page":"1097","article-title":"Imagenet\n classification with deep convolutional neural networks","author":"krizhevsky","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"ref66","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"2009","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref142","first-page":"1127","article-title":"Sequential projection learning for hashing with compact codes","author":"wang","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298947"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"ref68","first-page":"306","article-title":"Gradient-based learning applied to\n document recognition","author":"lecun","year":"2001","journal-title":"Intelligent Signal Process"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1145\/2393347.2393378"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.124"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298865"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref109","first-page":"1070","article-title":"Hamming distance metric learning","author":"norouzi","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref95","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.388"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref107","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"Proc Int Conf Mach Learning"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2207394"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.476"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2012.02.051"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.132"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/CRV.2012.60"},{"key":"ref90","article-title":"Reciprocal hash tables for\n nearest neighbor search","author":"liu","year":"2013","journal-title":"Proc 27th AAAI Conf Artif Intell"},{"key":"ref103","first-page":"331","article-title":"Fast approximate nearest neighbors with automatic algorithm configuration","author":"muja","year":"2009","journal-title":"Proc Int Conf Comput Vis Theory Appl"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540024"},{"key":"ref111","first-page":"275","article-title":"Optimal lower\n bounds for locality sensitive hashing (except when q is tiny)","author":"o'donnell","year":"2011","journal-title":"Proc Int Conf Supercomputing"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248043"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92957-4_33"},{"key":"ref99","first-page":"235","article-title":"Capsule: A camera-based positioning system\n using learning","author":"moon","year":"2015","journal-title":"Proc ACM Symp Cloud Comput"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46475-6_9"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.225"},{"key":"ref10","first-page":"21","article-title":"On the resemblance and containment of documents","author":"broder","year":"1997","journal-title":"Proc Compression Complexity Sequences"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(97)00031-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.125"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298654"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509965"},{"key":"ref15","first-page":"1053","article-title":"Nearest neighbors using compact sparse codes","author":"cherian","year":"2014","journal-title":"Proc 31st Int Conf Int Conf Mach Learn"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.5244\/C.28.43"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2012.6467385"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.227"},{"key":"ref117","first-page":"172","article-title":"Quantized kernel learning for feature\n matching","author":"qin","year":"2014","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.166"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/2422956.2422958"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2964284.2964331"},{"key":"ref84","first-page":"3419","article-title":"Discrete graph hashing","author":"liu","year":"2014","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0090-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020578"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2619262"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2010.04.004"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109688"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540009"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298862"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref120","first-page":"969","article-title":"Semantic hashing","author":"salakhutdinov","year":"2007","journal-title":"Proc SIGIR Workshop Inf Retrieval Applicat Graph Models"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.275"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995504"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495403"},{"key":"ref85","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref86","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc Int Conf Mach Learning"},{"key":"ref87","first-page":"467","article-title":"Compact hyperplane hashing with bilinear functions","author":"liu","year":"2012","journal-title":"Proc Int Conf Mach Learning"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2505180"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/8306529\/07915742.pdf?arnumber=7915742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:22:53Z","timestamp":1642004573000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7915742\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,1]]},"references-count":179,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2017.2699960","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,1]]}}}