{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:25:25Z","timestamp":1726410325809},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642411809"},{"type":"electronic","value":"9783642411816"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41181-6_76","type":"book-chapter","created":{"date-parts":[[2013,9,2]],"date-time":"2013-09-02T12:03:54Z","timestamp":1378123434000},"page":"752-762","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Indexing Scheme Based on Linked-Node m-Ary Tree Structure"],"prefix":"10.1007","author":[{"given":"The-Anh","family":"Pham","sequence":"first","affiliation":[]},{"given":"Sabine","family":"Barrat","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Delalandre","sequence":"additional","affiliation":[]},{"given":"Jean-Yves","family":"Ramel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"76_CR1","unstructured":"Beis, J.S., Lowe, D.G.: Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In: Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition, CVPR 1997, pp. 1000\u20131006 (1997)"},{"issue":"3","key":"76_CR2","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv.\u00a033(3), 322\u2013373 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"76_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J.H. Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw.\u00a03(3), 209\u2013226 (1977)","journal-title":"ACM Trans. Math. Softw."},{"issue":"7","key":"76_CR4","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"24","author":"K. Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, M.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comput. 24(7), 750\u2013753 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"76_CR5","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"issue":"1","key":"76_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H. J\u00e9gou","year":"2011","unstructured":"J\u00e9gou, H., Douze, M., Schmid, C.: Product Quantization for Nearest Neighbor Search. IEEE Trans. Pattern Anal. Mach. Intell.\u00a033(1), 117\u2013128 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"76_CR7","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1109\/TPAMI.2011.219","volume":"34","author":"B. Kulis","year":"2012","unstructured":"Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing. IEEE Trans. Pattern Anal. Mach. Intell.\u00a034(6), 1092\u20131104 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"76_CR8","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe lsh: efficient indexing for high-dimensional similarity search. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 950\u2013961 (2007)"},{"issue":"9","key":"76_CR9","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/34.955110","volume":"23","author":"J. McNames","year":"2001","unstructured":"McNames, J.: A fast nearest-neighbor algorithm based on a principal axis search tree. IEEE Trans. Pattern Anal. Mach. Intell.\u00a023(9), 964\u2013976 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"76_CR10","unstructured":"Muja, M., Lowe, D.G.: Fast approximate nearest neighbors with automatic algorithm configuration. In: VISAPP International Conference on Computer Vision Theory and Applications, pp. 331\u2013340 (2009)"},{"key":"76_CR11","doi-asserted-by":"crossref","unstructured":"Muja, M., Lowe, D.G.: Fast matching of binary features. In: Proceedings of the Ninth Conference on Computer and Robot Vision, pp. 404\u2013410 (2012)","DOI":"10.1109\/CRV.2012.60"},{"key":"76_CR12","doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised kd-trees for fast image descriptor matching. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2008), pp. 1\u20138 (2008)","DOI":"10.1109\/CVPR.2008.4587638"}],"container-title":["Lecture Notes in Computer Science","Image Analysis and Processing \u2013 ICIAP 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41181-6_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T01:15:00Z","timestamp":1558055700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41181-6_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642411809","9783642411816"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41181-6_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}