DocumentCode
2199055
Title
Characterizing Hand Written Devanagari Characters using Evolved Regular Expressions
Author
Deshpande, P.S. ; Malik, Latesh ; Arora, Sandhya
Author_Institution
Dept. of Comput. Sci. & Eng., Visvesvaraya Nat. Inst. of Technol., Nagpur
fYear
2006
fDate
14-17 Nov. 2006
Firstpage
1
Lastpage
4
Abstract
Devanagari script is used in the Indian subcontinent for several major languages such as Hindi, Sanskrit, Marathi Nepali languages. More than 500 million people use the script. Recognition of unconstrained (Handwritten) Devanagari writing is more complex than English cursive due to shape of constituent strokes. The method that has been proposed is using segmentation evolved regular expressions. It has been taken care into account that there is vast variation in writing styles size and thickness characters and any distortion during scanning. There is no need preprocessing as well as training. The notation of regular expression is short and precise and can be easily transformed directed graphs or finite-state automata accepting all the symbol strings generated by the corresponding expressions. The method efficient enough because of power of regular expressions
Keywords
directed graphs; finite automata; handwritten character recognition; natural languages; directed graphs; finite-state automata; hand written Devanagari characters; unconstrained Devanagari writing recognition; Application software; Automata; Character recognition; Feature extraction; Image segmentation; Natural languages; Optical character recognition software; Shape; Strips; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON 2006. 2006 IEEE Region 10 Conference
Conference_Location
Hong Kong
Print_ISBN
1-4244-0548-3
Electronic_ISBN
1-4244-0549-1
Type
conf
DOI
10.1109/TENCON.2006.343941
Filename
4142173
Link To Document