{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T22:28:32Z","timestamp":1775946512792,"version":"3.50.1"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2014,11,1]]},"DOI":"10.1109\/tpami.2014.2321376","type":"journal-article","created":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T18:03:29Z","timestamp":1398967409000},"page":"2227-2240","source":"Crossref","is-referenced-by-count":1081,"title":["Scalable Nearest Neighbor Algorithms for High Dimensional Data"],"prefix":"10.1109","volume":"36","author":[{"given":"Marius","family":"Muja","sequence":"first","affiliation":[]},{"given":"David G.","family":"Lowe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"1631","article-title":"Complementary hashing for approximate nearest neighbor search","author":"xu","year":"0","journal-title":"Proc IEEE Int Conf Comput Vis"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835946"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587841"},{"key":"ref32","first-page":"6","article-title":"Spectral hashing","author":"weiss","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060840"},{"key":"ref30","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"0","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"ref36","first-page":"1509","article-title":"Locality-sensitive binary codes from shift-invariant kernels","volume":"22","author":"raginsky","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","volume":"22","author":"kulis","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref60","year":"0"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206677"},{"key":"ref61","first-page":"280","article-title":"Automatic reconstruction of Mars artifacts","author":"havlena","year":"0","journal-title":"Proc Eur Planet Sci Congr"},{"key":"ref63","article-title":"ROS: An open-source robot operating system","author":"quigley","year":"0","journal-title":"ICRA Workshop on Open Source Software"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248038"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2009.5457541"},{"key":"ref27","first-page":"1","article-title":"Product quantization for nearest neighbor search","volume":"32","author":"j\u00e9gou","year":"2010","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref65","author":"bradski","year":"2008","journal-title":"Learning OpenCV Computer Vision With the OpenCV Library"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383172"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref20","first-page":"397","article-title":"The anchors hierarchy: Using the triangle inequality to survive high dimensional data","author":"moore","year":"0","journal-title":"Proc 16th Conf Uncertainty Artif Intell"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"ref21","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","author":"yianilos","year":"0","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"ref23","year":"0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383150"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.5244\/C.20.81"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126544"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126542"},{"key":"ref59","year":"0"},{"key":"ref58","year":"0"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2009.36"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587784"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408871"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382971"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CRV.2012.60"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2002.1047852"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1997.609451"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"ref14","first-page":"331","article-title":"Fast approximate nearest neighbors with automatic algorithm configuration","author":"muja","year":"0","journal-title":"Proc Int Conf Computer Vis Theory Appl"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759061"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374452"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224297"},{"key":"ref19","first-page":"574","article-title":"Near neighbor search in large metric spaces","author":"brin","year":"0","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1276377.1276382","article-title":"Scene completion using millions of photographs","volume":"26","author":"hays","year":"2007","journal-title":"ACM Trans Graph"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238663"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.320"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238424"},{"key":"ref8","first-page":"248","article-title":"ImageNet: A large-scale hierarchical image database","author":"deng","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recog"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.128"},{"key":"ref49","first-page":"778","article-title":"BRIEF: Binary robust independent elementary features","author":"calonder","year":"0","journal-title":"Proc 11th Eur Conf Comput Vis"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref46","first-page":"281","article-title":"Random search for hyper-parameter optimization","volume":"13","author":"bergstra","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","article-title":"ParamILS: An automatic algorithm configuration framework","volume":"36","author":"hutter","year":"2009","journal-title":"J Artif Intell Res"},{"key":"ref48","first-page":"1027","article-title":"K-Means++: The advantages of careful seeding","author":"arthur","year":"0","journal-title":"Proc Symp Discrete Algorithms"},{"key":"ref47","author":"muja","year":"2013","journal-title":"Scalable nearest neighbour methods for high dimensional data"},{"key":"ref42","first-page":"1106","article-title":"Scalable k-NN graph construction for visual descriptors","author":"wang","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recog"},{"key":"ref41","first-page":"1312","article-title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph","author":"hajebi","year":"0","journal-title":"Proc 22nd Int Joint Conf Artif Intell"},{"key":"ref44","year":"0"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/iel7\/34\/6914638\/06809191.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/6914638\/06809191.pdf?arnumber=6809191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:28:53Z","timestamp":1642004933000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6809191\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,1]]},"references-count":65,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2014.2321376","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,1]]}}}