Spectral Graph-based Features for Recognition of Handwritten Characters: A Case Study on Handwritten Devanagari Numerals

• Published in: Journal of intelligent systems 2020-01, Vol.29 (1), p.799-813
• Main Authors: Bhat, Mohammad Idrees, Sharada, B.
• Format: Article
• Language: English
• Subjects: Character recognition; Computer vision; Feature recognition; feature representation; graph representation; Graph representations; Graphical representations; Handwriting recognition; Pattern recognition; primitive relationships; spectral graph embedding; unconstrained cursiveness; Writing styles
• ISSN: 0334-1860; 2191-026X
• DOI: 10.1515/jisys-2017-0448

Interpretation of different writing styles, unconstrained cursiveness and relationship between different primitive parts is an essential and challenging task for recognition of handwritten characters. As feature representation is inadequate, appropriate interpretation/description of handwritten characters seems to be a challenging task. Although existing research in handwritten characters is extensive, it still remains a challenge to get the effective representation of characters in feature space. In this paper, we make an attempt to circumvent these problems by proposing an approach that exploits the robust graph representation and spectral graph embedding concept to characterise and effectively represent handwritten characters, taking into account writing styles, cursiveness and relationships. For corroboration of the efficacy of the proposed method, extensive experiments were carried out on the standard handwritten numeral Computer Vision Pattern Recognition, Unit of Indian Statistical Institute Kolkata dataset. The experimental results demonstrate promising findings, which can be used in future studies.