Augmented incremental recognition of online handwritten mathematical expressions |
| |
Authors: | Khanh Minh Phan Anh Duc Le Bipin Indurkhya Masaki Nakagawa |
| |
Affiliation: | 1.Department of Computer and Information Sciences,Tokyo University of Agriculture and Technology,Koganei-shi,Japan;2.NTT Hi-Tech Institute,Nguyen Tat Thanh University,Ho Chi Minh city,Vietnam;3.Department of Computer Science,AGH University of Science and Technology,Kraków,Poland |
| |
Abstract: | This paper presents an augmented incremental recognition method for online handwritten mathematical expressions (MEs). If an ME is recognized after all strokes are written (batch recognition), the waiting time increases significantly when the ME becomes longer. On the other hand, the pure incremental recognition method recognizes an ME whenever a new single stroke is input. It shortens the waiting time but degrades the recognition rate due to the limited context. Thus, we propose an augmented incremental recognition method that not only maintains the advantage of the two methods but also reduces their weaknesses. The proposed method has two main features: one is to process the latest stroke, and the other is to find the erroneous segmentations and recognitions in the recent strokes and correct them. In the first process, the segmentation and the recognition by Cocke–Younger–Kasami (CYK) algorithm are only executed for the latest stroke. In the second process, all the previous segmentations are updated if they are significantly changed after the latest stroke is input, and then, all the symbols related to the updated segmentations are updated with their recognition scores. These changes are reflected in the CYK table. In addition, the waiting time is further reduced by employing multi-thread processes. Experiments on our dataset and the CROHME datasets show the effectiveness of this augmented incremental recognition method, which not only maintains recognition rate even compared with the batch recognition method but also reduces the waiting time to a very small level. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|