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%.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Design of a mathematical expression recognition system


    Contributors:


    Publication date :

    1995-01-01


    Size :

    458998 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Design of a Mathematical Expression Recognition System

    Lee, H.-J. / Wang, J.-S. | British Library Conference Proceedings | 1995



    Shape Recognition Using Recursive Mathematical Morphology

    Schauf, M. / Haralick, R. M. / University of Naples et al. | British Library Conference Proceedings | 1997


    MUSER: A prototype musical score recognition system using mathematical morphology

    Modayur, B. R. / Ramesh, V. / Haralick, R. M. et al. | British Library Online Contents | 1993


    Mathematical Analysis and Speaker-Independent Speech Recognition

    Gur'yanov, A. E. | British Library Online Contents | 1996