{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T21:49:49Z","timestamp":1686347389864},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"National Science Foundation","award":["IIP-0443945","CNS-0821474","IIP-0934327","CNS-1039741","IIS-1017344","IIP-1032018","SMA-1028076","CNS-1338042"],"award-info":[{"award-number":["IIP-0443945","CNS-0821474","IIP-0934327","CNS-1039741","IIS-1017344","IIP-1032018","SMA-1028076","CNS-1338042"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1109\/tip.2014.2324280","type":"journal-article","created":{"date-parts":[[2014,6,3]],"date-time":"2014-06-03T18:47:15Z","timestamp":1401821235000},"page":"3646-3655","source":"Crossref","is-referenced-by-count":12,"title":["Efficient Nearest Neighbors via Robust Sparse Hashing"],"prefix":"10.1109","volume":"23","author":[{"given":"Anoop","family":"Cherian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suvrit","family":"Sra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilios","family":"Morellas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Papanikolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1794","article-title":"Linear spatial pyramid matching using sparse coding for image classification","author":"yang","year":"2009","journal-title":"Proc IEEE Conf CVPR"},{"key":"ref38","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2009","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"ref32","first-page":"512","article-title":"A sparse coding based similarity measure","author":"heidemann","year":"2009","journal-title":"Proc Int Conf Data Mining"},{"key":"ref31","first-page":"860","article-title":"A framework for learning image priors","author":"roth","year":"2005","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1326548.1326553"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540018"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15567-3_29"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238424"},{"key":"ref10","article-title":"Efficient similarity search via sparse coding","author":"cherian","year":"2011"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946730"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/MMSP.2009.5293301"},{"key":"ref12","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","article-title":"Least angle regression","volume":"32","author":"efron","year":"2004","journal-title":"Ann Statist"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.142"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref17","first-page":"547","article-title":"Étude comparative de la distribution florale dans une portion des Alpes et du Jura","volume":"37","author":"jaccard","year":"1901","journal-title":"Bulletin del la Socie?te? Vaudoise des Sciences Naturelles"},{"key":"ref18","first-page":"304","article-title":"Hamming embedding and weak geometric consistency for large scale image search","author":"jegou","year":"2008","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00016-4"},{"key":"ref28","article-title":"Locality-sensitive binary codes from shift-invariant kernels","author":"raginsky","year":"2009","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050"},{"key":"ref27","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":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref5","first-page":"217","article-title":"When is 'nearest neighbor' meaningful?","author":"beyer","year":"1999","journal-title":"Proc ICDT"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2009.5413302"},{"key":"ref8","author":"caraminis","year":"2011","journal-title":"Optmization for Machine Learning"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495916"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2012.2225911"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248038"},{"key":"ref20","first-page":"861","article-title":"Searching in one billion vectors: Re-rank with source coding","author":"j\u00e9gou","year":"2011","journal-title":"Proc ICASSP"},{"key":"ref22","article-title":"The art of computer programming","volume":"3","author":"knuth","year":"1973","journal-title":"Sorting and Searching"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(80)90061-0"},{"key":"ref24","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc 28th ICML"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref26","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"mairal","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/83\/6840896\/06824781.pdf?arnumber=6824781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:55:37Z","timestamp":1642006537000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6824781\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":40,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tip.2014.2324280","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"value":"1057-7149","type":"print"},{"value":"1941-0042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8]]}}}