Abstract
In this work, fast approximate nearest neighbours search algorithms are shown to provide high accuracies, similar to those of exact nearest neighbour search, at a fraction of the computational cost in an OCR task. Recent studies [26,15] have shown the power of k-nearest neighbour classifiers (k-nn) using large databases, for character recognition. In those works, the error rate is found to decrease consistently as the size of the database increases. Unfortunately, a large database implies large search times if an exhaustive search algorithm is used. This is often cited as a major problem that limits the practical value of the k- nearest neighbours classification method. The error rates and search times presented in this paper prove, however, that k-nn can be a practical technique for a character recognition task.
Chapter PDF
Similar content being viewed by others
References
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–923, 1998.
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.
J.S. Beis and D.G. Lowe. Indexing without invariants in 3d object recognition. IEEE Trans. on PAMI, 21(10):1000–1015, October 1999.
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–580, 1980.
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–39, 1996.
M. Bern. Approximate closest-point queries in high dimensions. Pattern Recognition, 45:95–99, 1993.
S. Brin. Near neighbor search in large metric spaces. In Proc. 21st Inter. Conf. on Very Large Data Bases, pages 574–584, 1995.
P. A. Devijver and J. Kittler. On the edited nearest neighbour rule. pages 72–80. Proceedings of the 5th International Conference on Pattern Recognition, IEEE Computer Society Press, Los Alamitos, CA, 1980.
L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag., 1996.
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–226, 1977.
K. Fukunaga and P. M. Narendra. A branch and bound algorithm for computing k-nearest neighbors. 24:750–753, 1975.
S. Geva and J. Sitte. Adaptive nearest neighbor pattern classification. IEEE Trans on Neural Networks, 2(2):318–322, 1991.
P.J. Grother and G.T. Candela. Comparison of handprinted digit classifiers. In NISTIR, 1993.
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.
T.M. Ha and H. Bunke. Off-line, handwritten numeral recognition by perturbation method. IEEE Trans. on PAMI, 19(5):535–539, May 1997.
P.E. Hart. The condensed nearest neighbor rule. IEEE Trans. on Information Theory, 125:515–516, 1968.
R. Indyk and R Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In 30th Symposium on Theory of Computing, 1998.
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–766, 1986.
T. Kohonen. Self Organization and Associative Memory. Springer-Verlag., 1988.
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.
G. Loizou and S. J. Maybank. The nearest neighbor and the Bayes error rates. IEEE Trans. on PAMI, 9:254–262, 1987.
L. Miclet and M. Dabouz. Approximative fast nearest neighbor recognition. Pat tern Recognition Letters, 1:277–285, 1983.
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.
J.C. Perez and E. Vidal. The extended general spacefilling curves heuristic. In Intl. Conf. on Pattern Recognition ICPR-98, Brisbane, Australia., 1998.
H. Robinson. Database Analysis and Design., 1981.
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–919, September 1994.
R.F. Sproull. Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica, 6:579–589, 1991.
C. Tomasi and R. Manduchi. Stereo matching as a nearest-neighbor problem. IEEE Trans. on PAMI, 20(3):333–340, March 1998.
D.L. Wilson. Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans. on Systems, Man and Cybernetics, 2:408–420, 1972.
P. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In 4th ACM Symp. on Discrete Algorithms, pages 311–321, 1993.
P. Zakarauskas and J.M. Ozard. Complexity analysis for partitioning nearestneighbor searching algorithms. IEEE Trans. on PAMI, 18(6):663–668, June 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pérez-Cortes, J.C., Llobet, R., Arlandis, J. (2000). Fast and Accurate Handwritten Character Recognition Using Approximate Nearest Neighbours Search on Large Databases. In: Ferri, F.J., Iñesta, J.M., Amin, A., Pudil, P. (eds) Advances in Pattern Recognition. SSPR /SPR 2000. Lecture Notes in Computer Science, vol 1876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44522-6_79
Download citation
DOI: https://doi.org/10.1007/3-540-44522-6_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67946-2
Online ISBN: 978-3-540-44522-7
eBook Packages: Springer Book Archive