We present a system to segment and recognize texts and mathematical expressions in a document. The system can be divided into six stages: page segmentation and labeling, character segmentation, feature extraction, character recognition, expression formation, and error correction and expression extraction. In expression formation, we build a symbol relation tree for each text line to represent the relationships among the symbols in the text line. Some heuristic rules based on the primitive tokens are used to correct the recognition errors in a text line. We extract all mathematical expressions according to some basic expression forms. Our database consists of 190 symbols in the current stage. The average recognition rate is about 96.16%.
Design of a mathematical expression recognition system
Proceedings of 3rd International Conference on Document Analysis and Recognition ; 2 ; 1084-1087 vol.2
01.01.1995
458998 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Design of a Mathematical Expression Recognition System
British Library Conference Proceedings | 1995
|Shape Recognition Using Recursive Mathematical Morphology
British Library Conference Proceedings | 1997
|MUSER: A prototype musical score recognition system using mathematical morphology
British Library Online Contents | 1993
|Mathematical Analysis and Speaker-Independent Speech Recognition
British Library Online Contents | 1996
|