Learning symbol relation tree for online mathematical expression recognition
Not on the map. Why?
Abstract (arXiv)
This paper proposes a method for recognizing online handwritten mathematical expressions (OnHME) by building a symbol relation tree (SRT) directly from a sequence of strokes. A bidirectional recurrent neural network learns from multiple derived paths of SRT to predict both symbols and spatial relations between symbols using global context. The recognition system has two parts: a temporal classifier and a tree connector. The temporal classifier produces an SRT by recognizing an OnHME pattern. The tree connector splits the SRT into several sub-SRTs. The final SRT is formed by looking up the best combination among those sub-SRTs. Besides, we adopt a tree sorting method to deal with various stroke orders. Recognition experiments indicate that the proposed OnHME recognition system is competitive to other methods. The recognition system achieves 44.12% and 41.76% expression recognition rates on the Competition on Recognition of Online Handwritten Mathematical Expressions (CROHME) 2014 and 2016 testing sets.
Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 0 of its 19 references that are in the map. First posted on arXiv 13 May 2021.
Builds on
0 of 19 references.
No references here yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.