In this paper, a Devanagari script recognition scheme based on a novel algorithm is proposed. Devanagari script poses new challenges in the field of pattern recognition primarily due to the highly cursive nature of the script seen across its diverse character set. In the proposed algorithm, the character is initially subjected to a simple noise removal filter. Based on a reference co-ordinate system, the significant contours of the character are extracted and characterized as a contour set. The recognition of the character involves comparing these contour sets with those in the enrolled database. The matching of these contour sets is achieved by characterizing each contour based on its length, its relative position in the reference co-ordinate system and an interpolation scheme which eliminates displacement errors. In the Devanagari script, similar contour sets are observed among few characters, hence this method helps to filter out disparate characters and narrow down the possibilities to a limited set. The next step involves focusing on the subtle yet vital differences between the similar contours in this limited set. This is done by a prioritization scheme which concentrates only on those portions of character which reflect its uniqueness. The major challenge in developing the proposed scheme lay in striking the right balance between definiteness and flexibility to derive optimal solutions for out of sample data. Experimental results show the validity and efficiency of the developed scheme for recognition of characters of this script.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Robust Pattern Recognition Scheme for Devanagari Script
- Springer Berlin Heidelberg