Abstract

This paper deals with recognition of printed mathematical symbols. A group of classifiers arranged hierarchically is used to achieve robust recognition of the large number of symbols appearing in expressions. The classifier used at the top level employs stroke-based classification technique to recognize some of the frequently occurring symbols. The second level uses three classifiers to recognize the rest of the expression symbols. Different combination techniques have been attempted to integrate the second level classifiers to achieve high recognition accuracy. Experiment shows that the proposed approach is quite robust for recognition of a large number of symbols appearing in various expressions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call