Finite State Machine Based Decoding of Handwritten Text Using Recurrent Neural Networks
暂无分享,去创建一个
[1] Jürgen Schmidhuber,et al. Long Short-Term Memory , 1997, Neural Computation.
[2] Jürgen Schmidhuber,et al. Framewise phoneme classification with bidirectional LSTM and other neural network architectures , 2005, Neural Networks.
[3] Steve Young,et al. Token passing: a simple conceptual model for connected speech recognition systems , 1989 .
[4] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[5] Venu Govindaraju,et al. IBM_UB_1: A Dual Mode Unconstrained English Handwriting Dataset , 2013, 2013 12th International Conference on Document Analysis and Recognition.
[6] Cuong Tuan Nguyen,et al. A Semi-incremental Recognition Method for On-Line Handwritten English Text , 2014, 2014 14th International Conference on Frontiers in Handwriting Recognition.
[7] Sargur N. Srihari,et al. On-Line and Off-Line Handwriting Recognition: A Comprehensive Survey , 2000, IEEE Trans. Pattern Anal. Mach. Intell..
[8] Masaki Nakagawa,et al. 'Online recognition of Chinese characters: the state-of-the-art , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[9] Johan Schalkwyk,et al. OpenFst: A General and Efficient Weighted Finite-State Transducer Library , 2007, CIAA.
[10] Masaki Nakagawa,et al. A robust model for on-line handwritten japanese text recognition , 2010, Electronic Imaging.
[11] Marcus Liwicki,et al. IAM-OnDB - an on-line English sentence database acquired from handwritten text on a whiteboard , 2005, Eighth International Conference on Document Analysis and Recognition (ICDAR'05).