Tree-based BLSTM for mathematical expression recognition - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Tree-based BLSTM for mathematical expression recognition

Résumé

In this study, we extend the chain-structured BLSTM to tree structure topology and apply this new network model for online math expression recognition. The proposed system addresses the recognition task as a graph building problem. The input expression is a sequence of strokes from which an intermediate graph is derived using temporal and spatial relations among strokes. In this graph, a node corresponds to a stroke and an edge denotes the relationship between a pair of strokes. Then several trees are derived from the graph and labeled with Tree-based BLSTM. The last step is to merge these labeled trees to build an admissible label graph (LG) modeling 2-D formulas uniquely. The proposed system achieves competitive results in online math expression recognition domain.
Fichier principal
Vignette du fichier
3586a914.pdf (553.54 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01576305 , version 1 (05-12-2017)

Identifiants

Citer

Ting Zhang, Harold Mouchère, Christian Viard-Gaudin. Tree-based BLSTM for mathematical expression recognition. International Conference on Document Analysis and Recognition (ICDAR), Nov 2017, Kyoto, Japan. ⟨10.1109/ICDAR.2017.154⟩. ⟨hal-01576305⟩
327 Consultations
336 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More