Recognizing Mathematical Expressions Using Tree Transformation
IEEE Transactions on Pattern Analysis and Machine Intelligence
ICDAR '99 Proceedings of the Fifth International Conference on Document Analysis and Recognition
INFTY: an integrated OCR system for mathematical documents
Proceedings of the 2003 ACM symposium on Document engineering
A Ground-Truthed Mathematical Character and Symbol Image Database
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Pattern Recognition Letters
Structural Construction for On-Line Mathematical Formulae Recognition
CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
Towards a web-based progressive handwriting recognition environment for mathematical problem solving
Expert Systems with Applications: An International Journal
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
An improved method of formula structural analysis
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
| Hi-index | 0.00 |
In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps. In the first step, a fast structural analysis algorithm is performed on each mathematical formula to obtain a tree representation of the formula. This step generally provides a correct tree representation but sometimes provides an erroneous representation. Therefore, the tree representation is verified by the following two steps. In the second step, the result of the analysis step, (i.e., a tree representation) is converted into a one-dimensional representation. The third step is a verification step where the one-dimensional representation is parsed by a formula description grammar, which is a context-free grammar specialized for mathematical formulae. If the one-dimensional representation is not accepted by the grammar, the result of the analysis step is detected as an erroneous result and alarmed to OCR users. This three-step organization achieves reliable and efficient structural analysis without any two-dimensional grammars.