TY - GEN
T1 - Match between normalization schemes and feature sets for handwritten Chinese character recognition
AU - Wang, Qing
AU - Chi, Zheru
AU - Feng, David D.
AU - Zhao, Rongchun
N1 - Publisher Copyright:
© 2001 IEEE.
PY - 2001
Y1 - 2001
N2 - Because of the large number of Chinese characters and many different writing styles involved, the recognition of handwritten Chinese character remains a very challenging task. It is well recognized that a good feature set plays a key role in a successful recognition system. Shape normalization is as well an essential step toward achieving translation, scale, and rotation invariance in recognition. Many shape normalization methods and different feature sets have been proposed in the literature. This paper first reviews five commonly used shape normalization schemes and then discusses various feature extraction techniques usually used in handwritten Chinese character recognition. Based on numerous experiments conducted on 3,755 handwritten Chinese characters (GB23I2-80), we discuss the matches made between the normalization schemes and the features sets and suggest the best match between them in terms of classification performance. The nearest neighbor classifier was adopted in our experiments with templates obtained by using the K-means clustering algorithm.
AB - Because of the large number of Chinese characters and many different writing styles involved, the recognition of handwritten Chinese character remains a very challenging task. It is well recognized that a good feature set plays a key role in a successful recognition system. Shape normalization is as well an essential step toward achieving translation, scale, and rotation invariance in recognition. Many shape normalization methods and different feature sets have been proposed in the literature. This paper first reviews five commonly used shape normalization schemes and then discusses various feature extraction techniques usually used in handwritten Chinese character recognition. Based on numerous experiments conducted on 3,755 handwritten Chinese characters (GB23I2-80), we discuss the matches made between the normalization schemes and the features sets and suggest the best match between them in terms of classification performance. The nearest neighbor classifier was adopted in our experiments with templates obtained by using the K-means clustering algorithm.
UR - http://www.scopus.com/inward/record.url?scp=33750088233&partnerID=8YFLogxK
U2 - 10.1109/ICDAR.2001.953849
DO - 10.1109/ICDAR.2001.953849
M3 - 会议稿件
AN - SCOPUS:33750088233
T3 - Proceedings of the International Conference on Document Analysis and Recognition, ICDAR
SP - 551
EP - 555
BT - Proceedings - 6th International Conference on Document Analysis and Recognition, ICDAR 2001
PB - IEEE Computer Society
T2 - 6th International Conference on Document Analysis and Recognition, ICDAR 2001
Y2 - 10 September 2001 through 13 September 2001
ER -