TY - GEN
T1 - Deep LSTM networks for online Chinese handwriting recognition
AU - Sun, Li
AU - Su, Tonghua
AU - Liu, Ce
AU - Wang, Ruigang
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/7/2
Y1 - 2016/7/2
N2 - Currently two heavy burdens are borne in online Chinese handwriting recognition: a large-scale training data needs to be annotated with the boundaries of each character and effective features should be handcrafted by domain experts. To relieve such issues, the paper presents a novel end-to-end recognition method based on recurrent neural networks. A mixture architecture of deep bidirectional Long Short-Term Memory (LSTM) layers and feed forward subsampling layers is used to encode the long contextual history trajectories. The Connectionist Temporal Classification (CTC) objective function makes it possible to train the model without providing alignment information between input trajectories and output strings. During decoding, a modified CTC beam search algorithm is devised to integrate the linguistic constraints wisely. Our method is evaluated both on test set and competition set of CASIA-OLHWDB 2. x. Comparing with state-of-the-art methods, over 30% relative error reductions are observed on test set in terms of both correct rate and accurate rate. Even to the more challenging competition set, better results can be achieved by our method if the out-of-vocabulary problem can be ignored.
AB - Currently two heavy burdens are borne in online Chinese handwriting recognition: a large-scale training data needs to be annotated with the boundaries of each character and effective features should be handcrafted by domain experts. To relieve such issues, the paper presents a novel end-to-end recognition method based on recurrent neural networks. A mixture architecture of deep bidirectional Long Short-Term Memory (LSTM) layers and feed forward subsampling layers is used to encode the long contextual history trajectories. The Connectionist Temporal Classification (CTC) objective function makes it possible to train the model without providing alignment information between input trajectories and output strings. During decoding, a modified CTC beam search algorithm is devised to integrate the linguistic constraints wisely. Our method is evaluated both on test set and competition set of CASIA-OLHWDB 2. x. Comparing with state-of-the-art methods, over 30% relative error reductions are observed on test set in terms of both correct rate and accurate rate. Even to the more challenging competition set, better results can be achieved by our method if the out-of-vocabulary problem can be ignored.
KW - Beam search
KW - Chinese handwriting recognition
KW - Deep learning
KW - Long short-term memory
UR - https://www.scopus.com/pages/publications/85012940957
U2 - 10.1109/ICFHR.2016.0059
DO - 10.1109/ICFHR.2016.0059
M3 - 会议稿件
AN - SCOPUS:85012940957
T3 - Proceedings of International Conference on Frontiers in Handwriting Recognition, ICFHR
SP - 271
EP - 276
BT - Proceedings - 2016 15th International Conference on Frontiers in Handwriting Recognition, ICFHR 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th International Conference on Frontiers in Handwriting Recognition, ICFHR 2016
Y2 - 23 October 2016 through 26 October 2016
ER -