{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:34:40Z","timestamp":1742924080373,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319698991"},{"type":"electronic","value":"9783319699004"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69900-4_60","type":"book-chapter","created":{"date-parts":[[2017,10,31]],"date-time":"2017-10-31T01:42:58Z","timestamp":1509414178000},"page":"473-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Random Binary Search Trees for Approximate Nearest Neighbour Search in Binary Space"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6838-2135","authenticated-orcid":false,"given":"Micha\u0142","family":"Komorowski","sequence":"first","affiliation":[]},{"given":"Tomasz","family":"Trzci\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,1]]},"reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Alahi, A., Ortiz, R., Vandergheynst, P.: FREAK: fast retina keypoint. In: CVPR (2012)","DOI":"10.1109\/CVPR.2012.6247715"},{"issue":"9","key":"60_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"60_CR3","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"issue":"1","key":"60_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TIP.2015.2500030","volume":"25","author":"Y Feng","year":"2016","unstructured":"Feng, Y., Fan, L., Wu, Y.: Fast localization in large-scale environments using supervised indexing of binary features. IEEE Trans. Image Process. 25(1), 343\u2013358 (2016)","journal-title":"IEEE Trans. Image Process."},{"issue":"7","key":"60_CR5","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"100","author":"K Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, P.M.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comput. 100(7), 750\u2013753 (1975)","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"60_CR6","first-page":"518","volume":"99","author":"A Gionis","year":"1999","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. VLDB 99(6), 518\u2013529 (1999)","journal-title":"VLDB"},{"key":"60_CR7","unstructured":"Google Tango. https:\/\/get.google.com\/tango\/"},{"key":"60_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-88688-4_27","volume-title":"Computer Vision \u2013 ECCV 2008","author":"N Kumar","year":"2008","unstructured":"Kumar, N., Zhang, L., Nayar, S.: What is a good nearest neighbors algorithm for finding similar patches in images? In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008. LNCS, vol. 5303, pp. 364\u2013378. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-88688-4_27"},{"issue":"9","key":"60_CR9","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1109\/TPAMI.2006.188","volume":"28","author":"V Lepetit","year":"2006","unstructured":"Lepetit, V., Fua, P.: Keypoint recognition using randomized trees. IEEE Trans. Pattern Anal. Mach. Intell. 28(9), 1465\u20131479 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"60_CR10","unstructured":"Liu, T., Moore, A., Gray, A., Yang, K.: An investigation of practical approximate nearest neighbor algorithm. In: NIPS (2004)"},{"key":"60_CR11","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe LSH: efficient indexing for high-dimensional similarity search. In: VLDB (2007)"},{"key":"60_CR12","unstructured":"Nister, D., Stewenius, H.: Scalable recognition with a vocabulary tree. In: CVPR (2006)"},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"Sattler, T., Leibe, B., Kobbelt, L.: Fast image-based localization using direct 2d-to-3d matching. In: ICCV (2011)","DOI":"10.1109\/ICCV.2011.6126302"},{"issue":"4","key":"60_CR14","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/BF01940876","volume":"16","author":"R Seidel","year":"1996","unstructured":"Seidel, R., Cecilia, R.A.: Randomized search trees. Algorithmica 16(4), 464\u2013497 (1996)","journal-title":"Algorithmica"},{"key":"60_CR15","doi-asserted-by":"crossref","unstructured":"Shakhnarovich, G., Viola, P.A., Darrell, T.: Fast pose estimation with parameter-sensitive hashing. In: ICCV (2003)","DOI":"10.1109\/ICCV.2003.1238424"},{"key":"60_CR16","doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised kd-trees for fast image descriptor matching. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"60_CR17","doi-asserted-by":"crossref","unstructured":"Torralba, A., Fergus, R., Weiss, Y.: Small codes and large image databases for recognition. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587633"},{"issue":"16","key":"60_CR18","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1016\/j.patrec.2012.08.006","volume":"33","author":"T Trzcinski","year":"2012","unstructured":"Trzcinski, T., Lepetit, V., Fua, P.: Thick boundaries in binary space and their influence on nearest-neighbor search. Pattern Recogn. Lett. 33(16), 2173\u20132180 (2012)","journal-title":"Pattern Recogn. Lett."},{"issue":"12","key":"60_CR19","doi-asserted-by":"publisher","first-page":"2393","DOI":"10.1109\/TPAMI.2012.48","volume":"34","author":"J Wang","year":"2012","unstructured":"Wang, J., Kumar, S., Chang, S.F.: Semi-supervised hashing for large-scale search. IEEE Trans. Pattern Anal. Mach. Intell. 34(12), 2393\u20132406 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"60_CR20","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: NIPS, vol. 21, pp. 1753\u20131760 (2009)"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69900-4_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T00:06:37Z","timestamp":1635638797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-69900-4_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319698991","9783319699004"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69900-4_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PReMI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Pattern Recognition and Machine Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"premi2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.isical.ac.in\/~premi17","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}