{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T15:25:22Z","timestamp":1772033122803,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/cvpr.2010.5540006","type":"proceedings-article","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T17:57:43Z","timestamp":1281463063000},"page":"3392-3399","source":"Crossref","is-referenced-by-count":45,"title":["Optimizing kd-trees for scalable visual descriptor indexing"],"prefix":"10.1109","author":[{"given":"You","family":"Jia","sequence":"first","affiliation":[]},{"given":"Jingdong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Hongbin","family":"Zha","sequence":"additional","affiliation":[]},{"given":"Xian-Sheng","family":"Hua","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","author":"yianilos","year":"1993","journal-title":"SODA"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.128"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","author":"de berg","year":"2008","journal-title":"Computational Geometry Algorithms and Applications"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2004.383"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408857"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587841"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref16","first-page":"364","article-title":"What is a good nearest neighbors algorithm for finding similar patches in images?","author":"kumar","year":"2008","journal-title":"ECCV"},{"key":"ref17","article-title":"An investigation of practical approximate nearest neighbor algorithms","author":"liu","year":"2004","journal-title":"NIPS"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01911006"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141964"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1997.609451"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759061"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502809"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238630"},{"key":"ref7","author":"breiman","year":"1984","journal-title":"Classification and Regression Trees"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1993.253111"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/34.955110"},{"key":"ref22","first-page":"397","article-title":"The anchors hierarchy: Using the triangle inequality to survive high dimensional data","author":"moore","year":"2000","journal-title":"UAI"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408871"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"ref23","first-page":"331","article-title":"Fast approximate nearest neighbors with automatic algorithm configuration","author":"muja","year":"2009","journal-title":"VISSAPP"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4908.001.0001","author":"shakhnarovich","year":"2006","journal-title":"Nearest-Neighbor Methods in Learning and Vision Theory and Practice"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383172"}],"event":{"name":"2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","location":"San Francisco, CA, USA","start":{"date-parts":[[2010,6,13]]},"end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5521876\/5539770\/05540006.pdf?arnumber=5540006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T06:20:05Z","timestamp":1591770005000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5540006\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2010.5540006","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}