2019
DOI: 10.1007/978-3-030-20518-8_37
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 18 publications
(10 citation statements)
references
References 17 publications
0
10
0
Order By: Relevance
“…For example, Le and Nakagawa [25] proposed a system for recognizing online handwritten mathematical expressions using stochastic context-free grammar and the-Cocke-Younger-Kasami algorithm. Conversely, an end-to-end recognition approach using deep learning was proposed in [26], [27], [28], [29]. This challenge is expected to improve based on research progress.…”
Section: Handwriting-based Input Methodsmentioning
confidence: 99%
“…For example, Le and Nakagawa [25] proposed a system for recognizing online handwritten mathematical expressions using stochastic context-free grammar and the-Cocke-Younger-Kasami algorithm. Conversely, an end-to-end recognition approach using deep learning was proposed in [26], [27], [28], [29]. This challenge is expected to improve based on research progress.…”
Section: Handwriting-based Input Methodsmentioning
confidence: 99%
“…The second heuristic applies dynamic pruning to the search area depending upon detected character candidates. We used an additional dataset to train our system for both tasks [10].…”
Section: Participating Methodsmentioning
confidence: 99%
“…This limits accuracy by underutilizing context, and by optimizing recognition for subtasks independently. Despite this, some commercial systems have used structural approaches in real systems and applications, such as in systems created by MyScript [17], Wiris [18], and Samsung [19].…”
Section: Structural Recognition Approachesmentioning
confidence: 99%