Acceleration of Online Recognition of 2D Sequences Using Deep Bidirectional LSTM and Dynamic Programming

被引:13
作者
Zhelezniakov, Dmytro [1 ]
Zaytsev, Viktor [1 ]
Radyvonenko, Olga [1 ]
机构
[1] Samsung R&D Inst Ukraine SRK, 57 Lva Tolstogo Str, UA-01032 Kiev, Ukraine
来源
ADVANCES IN COMPUTATIONAL INTELLIGENCE, IWANN 2019, PT II | 2019年 / 11507卷
关键词
Deep learning; Recurrent neural networks; Recognition acceleration; Dynamic programming; Human computer interfaces; Handwritten mathematical expression; Online recognition;
D O I
10.1007/978-3-030-20518-8_37
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this work, the approach for online recognition of 2D sequences using deep bidirectional LSTM was proposed. One of the complex cases of online sequence recognition is handwritten mathematical expressions (HME). In spite of many achievements in this area, it is a still challenging task as, in addition to character segmentation and recognition, the tasks of structure, relations, and grammar analysis should be resolved. Such a combination of recognizers could lead to an increase in computational complexity for large expressions, which is unacceptable for on-device recognition in mobile applications. As end-to-end neural systems do not achieve plausible accuracy and recognition speed for on-device calculations so far, to overcome this problem we proposed a deeplearning solution that employs recurrent neural networks (RNNs) for structure and character recognition in combination with re-ordering and modified CYK algorithm for expression construction. Also, we explored a variety of structural and optimization enhancements to CYK algorithm that significantly improved the performance in terms of the recognition speed while the recognition accuracy remained at the same level. The ablation study for the introduced optimization techniques demonstrated significant improvement of recognition speed keeping the recognition accuracy comparable with the existing state-of-the-art approaches.
引用
收藏
页码:438 / 449
页数:12
相关论文
共 23 条
[1]  
Alvaro F.M, 2015, THESIS
[2]  
[Anonymous], ICPR
[3]  
[Anonymous], 2014, 3 INT C LEARN REPR
[4]  
[Anonymous], 2015, COMPUTER SCI
[5]  
Awal A.-M., 2009, P INT C DOC AN REC I
[6]  
Carbune V, 2019, ARXIV190210525
[7]   Probabilistic Mathematical Formula Recognition Using a 2D Context-Free Graph Grammar [J].
Celik, Mehmet ;
Yanikoglu, Berrin .
11TH INTERNATIONAL CONFERENCE ON DOCUMENT ANALYSIS AND RECOGNITION (ICDAR 2011), 2011, :161-166
[8]  
Chiu CC, 2018, 2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), P4774, DOI 10.1109/ICASSP.2018.8462105
[9]   Text/shape classifier for mobile applications with handwriting input [J].
Degtyarenko, Illya ;
Radyvonenko, Olga ;
Bokhan, Kostiantyn ;
Khomenko, Viacheslav .
INTERNATIONAL JOURNAL ON DOCUMENT ANALYSIS AND RECOGNITION, 2016, 19 (04) :369-379
[10]   A Novel Connectionist System for Unconstrained Handwriting Recognition [J].
Graves, Alex ;
Liwicki, Marcus ;
Fernandez, Santiago ;
Bertolami, Roman ;
Bunke, Horst ;
Schmidhuber, Juergen .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2009, 31 (05) :855-868