Handwritten Chinese/Japanese Text Recognition Using Semi-Markov Conditional Random Fields

被引:65
作者
Zhou, Xiang-Dong [1 ]
Wang, Da-Han [3 ]
Tian, Feng [1 ,2 ]
Liu, Cheng-Lin [3 ]
Nakagawa, Masaki [4 ]
机构
[1] Chinese Acad Sci, Beijing Key Lab Human Comp Interact, Inst Software, Beijing 100190, Peoples R China
[2] Chinese Acad Sci, State Key Lab Comp Sci, Beijing 100190, Peoples R China
[3] Chinese Acad Sci, NLPR, Inst Automat, Beijing 100190, Peoples R China
[4] Tokyo Univ Agr & Technol, Dept Comp & Informat Sci, Koganei, Tokyo 1848588, Japan
基金
中国国家自然科学基金;
关键词
Character string recognition; semi-Markov conditional random field; lattice pruning; beam search; CHINESE CHARACTERS; SEGMENTATION; ONLINE; ALGORITHM;
D O I
10.1109/TPAMI.2013.49
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a method for handwritten Chinese/Japanese text (character string) recognition based on semi-Markov conditional random fields (semi-CRFs). The high-order semi-CRF model is defined on a lattice containing all possible segmentation-recognition hypotheses of a string to elegantly fuse the scores of candidate character recognition and the compatibilities of geometric and linguistic contexts by representing them in the feature functions. Based on given models of character recognition and compatibilities, the fusion parameters are optimized by minimizing the negative log-likelihood loss with a margin term on a training string sample set. A forward-backward lattice pruning algorithm is proposed to reduce the computation in training when trigram language models are used, and beam search techniques are investigated to accelerate the decoding speed. We evaluate the performance of the proposed method on unconstrained online handwritten text lines of three databases. On the test sets of databases CASIA-OLHWDB (Chinese) and TUAT Kondate (Japanese), the character level correct rates are 95.20 and 95.44 percent, and the accurate rates are 94.54 and 94.55 percent, respectively. On the test set (online handwritten texts) of ICDAR 2011 Chinese handwriting recognition competition, the proposed method outperforms the best system in competition.
引用
收藏
页码:2413 / 2426
页数:14
相关论文
共 63 条
  • [31] Long T, 2008, TOP GERIATR REHABIL, V24, P1
  • [32] Segmentation of handwritten Chinese characters from destination addresses of mail pieces
    Lu, Y
    Tan, CL
    Shi, PF
    Zhang, KH
    [J]. INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2002, 16 (01) : 85 - 96
  • [33] Collection and analysis of on-line handwritten Japanese character patterns
    Matsumoto, K
    Fukushima, T
    Nakagawa, M
    [J]. SIXTH INTERNATIONAL CONFERENCE ON DOCUMENT ANALYSIS AND RECOGNITION, PROCEEDINGS, 2001, : 496 - 500
  • [34] Murase H., 1988, 9th International Conference on Pattern Recognition (IEEE Cat. No.88CH2614-6), P1143, DOI 10.1109/ICPR.1988.28462
  • [35] A model of on-line handwritten Japanese text recognition free from line direction and writing format constraints
    Nakagawa, M
    Zhu, BL
    Onuma, M
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2005, E88D (08): : 1815 - 1822
  • [36] Nguyen V.C, 2011, P 28 INT C MACH LEAR
  • [37] Okanohara D, 2006, COLING/ACL 2006, VOLS 1 AND 2, PROCEEDINGS OF THE CONFERENCE, P465
  • [38] A word graph algorithm for large vocabulary continuous speech recognition
    Ortmanns, S
    Ney, H
    Aubert, X
    [J]. COMPUTER SPEECH AND LANGUAGE, 1997, 11 (01) : 43 - 72
  • [39] Pal Chris., 2006, PROC INT C ACOUSTICS, V5, P581
  • [40] Boosted MMI for model and feature-space discriminative training
    Povey, Daniel
    Kanevsky, Dimitri
    Kingsbury, Brian
    Ramabhodran, Bhuvana
    Saon, George
    Visweswariah, Karthik
    [J]. 2008 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, VOLS 1-12, 2008, : 4057 - 4060