A tree-BLSTM-based recognition system for online handwritten mathematical expressions

Abstract : Long short-term memory networks (LSTM) achieves great success in temporal dependency modelling for chain-structured data, such as texts and speeches. An extension towards more complex data structures as encountered in 2D graphic languages is proposed in this work. Specifically, we address the problem of handwritten mathematical expression recognition, using a Tree-based BLSTM architecture allowing the direct labelling of nodes (symbol) and edges (relationship) from a graph modelling the input strokes. One major difference with the traditional approaches is that there is no explicit segmentation, recognition and layout extraction steps but a unique trainable system that produces directly a Stroke Label Graph describing a mathematical expression. The proposed system, considering no grammar, achieves competitive results in online math expression recognition domain.
Liste complète des métadonnées

Littérature citée [6 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01900412
Contributeur : Harold Mouchère <>
Soumis le : lundi 29 octobre 2018 - 11:15:47
Dernière modification le : jeudi 8 novembre 2018 - 17:29:46

Fichier

HAL_Version.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Ting Zhang, Harold Mouchère, Christian Viard-Gaudin. A tree-BLSTM-based recognition system for online handwritten mathematical expressions. Neural Computing and Applications, Springer Verlag, 2018, 〈10.1007/s00521-018-3817-2〉. 〈hal-01900412〉

Partager

Métriques

Consultations de la notice

5

Téléchargements de fichiers

1