{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:34:19Z","timestamp":1725489259570},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679462"},{"type":"electronic","value":"9783540445227"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44522-6_79","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T01:52:36Z","timestamp":1186883556000},"page":"767-776","source":"Crossref","is-referenced-by-count":7,"title":["Fast and Accurate Handwritten Character Recognition Using Approximate Nearest Neighbours Search on Large Databases"],"prefix":"10.1007","author":[{"given":"Juan C.","family":"P\u00e9rez-Cortes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Llobet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joaquim","family":"Arlandis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,21]]},"reference":[{"key":"79_CR1","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45:891\u2013923, 1998.","journal-title":"Journal of the ACM"},{"key":"79_CR2","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The r*-tree: An efficient and robust access method for points and rectangles. In ACM SIGMOD Conf. on the Management of Data 90, Atlantic City., May 1990.","DOI":"10.1145\/93597.98741"},{"issue":"10","key":"79_CR3","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/34.799907","volume":"21","author":"J.S. Beis","year":"1999","unstructured":"J.S. Beis and D.G. Lowe. Indexing without invariants in 3d object recognition. IEEE Trans. on PAMI, 21(10):1000\u20131015, October 1999.","journal-title":"IEEE Trans. on PAMI"},{"key":"79_CR4","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"J.L. Bentley","year":"1980","unstructured":"J.L. Bentley, B.W. Weide, and A.C. Yao. Optimal expected time algorithms for closest point problems. ACM Trans. on Math. Software, 6:563\u2013580, 1980.","journal-title":"ACM Trans. on Math. Software"},{"key":"79_CR5","unstructured":"S. Berchtold, D.A. Keim, and H.P. Kriegel. The x-tree: An index structure for high-dimensional data. In Proc. 22nd Very Large Database Conference, Bombay, India, pages 28\u201339, 1996."},{"key":"79_CR6","first-page":"95","volume":"45","author":"M. Bern","year":"1993","unstructured":"M. Bern. Approximate closest-point queries in high dimensions. Pattern Recognition, 45:95\u201399, 1993.","journal-title":"Pattern Recognition"},{"key":"79_CR7","unstructured":"S. Brin. Near neighbor search in large metric spaces. In Proc. 21st Inter. Conf. on Very Large Data Bases, pages 574\u2013584, 1995."},{"key":"79_CR8","first-page":"72","volume-title":"Proceedings of the 5th International Conference on Pattern Recognition","author":"P. A. Devijver","year":"1980","unstructured":"P. A. Devijver and J. Kittler. On the edited nearest neighbour rule. pages 72\u201380. Proceedings of the 5th International Conference on Pattern Recognition, IEEE Computer Society Press, Los Alamitos, CA, 1980."},{"key":"79_CR9","doi-asserted-by":"crossref","unstructured":"L. Devroye, L. Gy\u00f6rfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag., 1996.","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"79_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J. H. Friedman","year":"1977","unstructured":"J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm finding best matches in logarithmic expected time. ACM Trans. Math. Software, 3:209\u2013226, 1977.","journal-title":"ACM Trans. Math. Software"},{"key":"79_CR11","first-page":"750","volume":"24","author":"K. Fukunaga","year":"1975","unstructured":"K. Fukunaga and P. M. Narendra. A branch and bound algorithm for computing k-nearest neighbors. 24:750\u2013753, 1975.","journal-title":"A branch and bound algorithm for computing k-nearest neighbors"},{"issue":"2","key":"79_CR12","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1109\/72.80344","volume":"2","author":"S. Geva","year":"1991","unstructured":"S. Geva and J. Sitte. Adaptive nearest neighbor pattern classification. IEEE Trans on Neural Networks, 2(2):318\u2013322, 1991.","journal-title":"IEEE Trans on Neural Networks"},{"key":"79_CR13","unstructured":"P.J. Grother and G.T. Candela. Comparison of handprinted digit classifiers. In NISTIR, 1993."},{"key":"79_CR14","unstructured":"A. Guttman. R-trees: A dynamic index structure for spatial searching. In UCB, Elec.Res.Lab, Res.R. No.M83-64, with Stonebraker, M., 1983."},{"issue":"5","key":"79_CR15","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/34.589216","volume":"19","author":"T.M. Ha","year":"1997","unstructured":"T.M. Ha and H. Bunke. Off-line, handwritten numeral recognition by perturbation method. IEEE Trans. on PAMI, 19(5):535\u2013539, May 1997.","journal-title":"IEEE Trans. on PAMI"},{"key":"79_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"125","author":"P.E. Hart","year":"1968","unstructured":"P.E. Hart. The condensed nearest neighbor rule. IEEE Trans. on Information Theory, 125:515\u2013516, 1968.","journal-title":"IEEE Trans. on Information Theory"},{"key":"79_CR17","doi-asserted-by":"crossref","unstructured":"R. Indyk and R Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In 30th Symposium on Theory of Computing, 1998.","DOI":"10.1145\/276698.276876"},{"key":"79_CR18","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TPAMI.1986.4767859","volume":"8","author":"B. S. Kim","year":"1986","unstructured":"B. S. Kim and S. B. Park. A fast k nearest neighbor finding algorithm based on the ordered partition. IEEE Trans. on PAMI, 8:761\u2013766, 1986.","journal-title":"IEEE Trans. on PAMI"},{"key":"79_CR19","doi-asserted-by":"crossref","unstructured":"T. Kohonen. Self Organization and Associative Memory. Springer-Verlag., 1988.","DOI":"10.1007\/978-3-662-00784-6"},{"key":"79_CR20","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. In 30th Symposium on Theory of Computing, 1998.","DOI":"10.1145\/276698.276877"},{"key":"79_CR21","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TPAMI.1987.4767899","volume":"9","author":"G. Loizou","year":"1987","unstructured":"G. Loizou and S. J. Maybank. The nearest neighbor and the Bayes error rates. IEEE Trans. on PAMI, 9:254\u2013262, 1987.","journal-title":"IEEE Trans. on PAMI"},{"key":"79_CR22","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0167-8655(83)90063-6","volume":"1","author":"L. Miclet","year":"1983","unstructured":"L. Miclet and M. Dabouz. Approximative fast nearest neighbor recognition. Pat tern Recognition Letters, 1:277\u2013285, 1983.","journal-title":"Pat tern Recognition Letters"},{"key":"79_CR23","doi-asserted-by":"crossref","unstructured":"J.C. Perez and E. Vidal. An approximate nearest neighbours search algorithm based on the extended general spacefilling curves heuristic. In Workshop on Statistical Pattern Recognition SPR-98, Sydney, Australia., 1998.","DOI":"10.1007\/BFb0033294"},{"key":"79_CR24","doi-asserted-by":"crossref","unstructured":"J.C. Perez and E. Vidal. The extended general spacefilling curves heuristic. In Intl. Conf. on Pattern Recognition ICPR-98, Brisbane, Australia., 1998.","DOI":"10.1109\/ICPR.1998.711193"},{"key":"79_CR25","unstructured":"H. Robinson. Database Analysis and Design., 1981."},{"issue":"9","key":"79_CR26","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1109\/34.310689","volume":"16","author":"S.J. Smith","year":"1994","unstructured":"S.J. Smith, Sims K. Bourgoin, M.O., and H.L. Voorhees. Handwritten character classification using nearest neighbor in large databases. IEEE Trans. on PAMI, 16(9):915\u2013919, September 1994.","journal-title":"IEEE Trans. on PAMI"},{"key":"79_CR27","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"R.F. Sproull","year":"1991","unstructured":"R.F. Sproull. Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica, 6:579\u2013589, 1991.","journal-title":"Algorithmica"},{"issue":"3","key":"79_CR28","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/34.667890","volume":"20","author":"C. Tomasi","year":"1998","unstructured":"C. Tomasi and R. Manduchi. Stereo matching as a nearest-neighbor problem. IEEE Trans. on PAMI, 20(3):333\u2013340, March 1998.","journal-title":"IEEE Trans. on PAMI"},{"key":"79_CR29","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"D.L. Wilson","year":"1972","unstructured":"D.L. Wilson. Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans. on Systems, Man and Cybernetics, 2:408\u2013420, 1972.","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"},{"key":"79_CR30","unstructured":"P. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In 4th ACM Symp. on Discrete Algorithms, pages 311\u2013321, 1993."},{"issue":"6","key":"79_CR31","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/34.506419","volume":"18","author":"P. Zakarauskas","year":"1996","unstructured":"P. Zakarauskas and J.M. Ozard. Complexity analysis for partitioning nearestneighbor searching algorithms. IEEE Trans. on PAMI, 18(6):663\u2013668, June 1996.","journal-title":"IEEE Trans. on PAMI"}],"container-title":["Lecture Notes in Computer Science","Advances in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44522-6_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:49:24Z","timestamp":1556740164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44522-6_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679462","9783540445227"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-44522-6_79","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}