• Recognition of online unconstrained handwritten Gurmukhi characters based on Finite State Automata

    • Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


      Online handwriting recognition; Gurmukhi characters; post-processing; strokes association; Finite State Automata; SVM classifier.

    • Abstract


      This paper presents a language-based efficient post-processing algorithm for the recognition of online unconstrained handwritten Gurmukhi characters. A total of 93 stroke classes have been identified to recognize the Gurmukhi character set in this work. Support Vector Machine (SVM) classifier has been employedfor stroke classification. The main objective of this paper is to improve the character level recognition accuracy using an efficient Finite State Automata (FSA)-based formation of Gurmukhi characters algorithm. A databaseof 21,945 online handwritten Gurmukhi words is primarily collected in this experiment. After analysing the collected database, we have observed that a character can be written using one or more strokes. Therefore, a totalof 65,946 strokes have been annotated using the 93 identified stroke classes. Among these strokes, 15,069 stroke samples are considered for training the classifier. The proposed system achieved promising recognition accuracyof 97.3% for Gurmukhi characters, when tested with a new database of 8,200 characters, written by 20 different writers.

    • Author Affiliations



      1. Department of Computer Science and Engineering, Thapar Institute of Engineering & Technology (Deemed University), Patiala, India
    • Dates

  • Sadhana | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.