HANDWRITTEN CHARACTER CLASSIFICATION USING NEAREST-NEIGHBOR IN LARGE DATABASES

被引:46
作者
SMITH, SJ [1 ]
BOURGOIN, MO [1 ]
SIMS, K [1 ]
VOORHEES, HL [1 ]
机构
[1] TASC,READING,MA 01867
关键词
D O I
10.1109/34.310689
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We show that systems built on a simple statistical technique and a large training database can be automatically optimized to produce classification accuracies of 99% in the domain of handwritten digits. It is also shown that the performance of these systems scale consistently with the size of the training database, where the error rate is cut by more than half for every tenfold increase in the size of the training set from 10 to 100,000 examples. Three distance metrics for the standard Nearest Neighbor classification system are investigated: a simple Hamming distance metric, a pixel distance metric, and a metric based on the extraction of penstroke features. Systems employing these metrics were trained and tested on a standard, publicly available, database of nearly 225,000 digits provided by the National Institute of Standards and Technology. Additionally, a confidence metric is both introduced by the authors and also discovered and optimized by the system. The new confidence measure proves to be superior to the commonly used Nearest Neighbor distance.
引用
收藏
页码:915 / 919
页数:5
相关论文
共 22 条
[1]   INSTANCE-BASED LEARNING ALGORITHMS [J].
AHA, DW ;
KIBLER, D ;
ALBERT, MK .
MACHINE LEARNING, 1991, 6 (01) :37-66
[2]  
AHMED P, 1987, INT J PATTERN RECOGN
[3]  
ATKESON C, 1986, MIT942 AI LAB TECH R
[4]   PARALLEL DISTANCE TRANSFORMS ON PYRAMID MACHINES - THEORY AND IMPLEMENTATION [J].
BORGEFORS, G ;
HARTMANN, T ;
TANIMOTO, SL .
SIGNAL PROCESSING, 1990, 21 (01) :61-86
[5]   ELASTIC MATCHING OF LINE DRAWINGS [J].
BURR, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1981, 3 (06) :708-713
[6]  
CHURCH K, 1986, UNPUB STOCHASTIC PAR
[7]   NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[8]   TRADING MIPS AND MEMORY FOR KNOWLEDGE ENGINEERING [J].
CREECY, RH ;
MASAND, BM ;
SMITH, SJ ;
WALTZ, DL .
COMMUNICATIONS OF THE ACM, 1992, 35 (08) :48-64
[9]   EUCLIDEAN DISTANCE MAPPING [J].
DANIELSSON, PE .
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1980, 14 (03) :227-248
[10]  
DASRATHY B, 1990, NEAREST NEIGHBOR PAT