A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Nearest Neighbor and the Bayes Error Rates
IEEE Transactions on Pattern Analysis and Machine Intelligence
Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Approximate closest-point queries in high dimensions
Information Processing Letters
Complexity Analysis for Partitioning Nearest Neighbor Searching Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Off-Line, Handwritten Numeral Recognition by Perturbation Method
IEEE Transactions on Pattern Analysis and Machine Intelligence
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Stereo Matching as a Nearest-Neighbor Problem
IEEE Transactions on Pattern Analysis and Machine Intelligence
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Indexing without Invariants in 3D Object Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
Handwritten Character Classification Using Nearest Neighbor in Large Databases
IEEE Transactions on Pattern Analysis and Machine Intelligence
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The Extended General Spacefilling Curves Heuristic
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
IEEE Transactions on Computers
Training Set Expansion in Handwritten Character Recognition
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Comparison of feature extraction methods for breast cancer detection
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Similarity-based training set acquisition for continuous handwriting recognition
Information Sciences: an International Journal
| Hi-index | 0.00 |
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.