Computer Science – Networking and Internet Architecture
Scientific paper
2010-01-29
InterJRI Computer Science and Networking, Volume 1, pp 7-12, 2009
Computer Science
Networking and Internet Architecture
6pages, 5 figures
Scientific paper
Traditionally, the performance of ocr algorithms and systems is based on the recognition of isolated characters. When a system classifies an individual character, its output is typically a character label or a reject marker that corresponds to an unrecognized character. By comparing output labels with the correct labels, the number of correct recognition, substitution errors misrecognized characters, and rejects unrecognized characters are determined. Nowadays, although recognition of printed isolated characters is performed with high accuracy, recognition of handwritten characters still remains an open problem in the research arena. The ability to identify machine printed characters in an automated or a semi automated manner has obvious applications in numerous fields. Since creating an algorithm with a one hundred percent correct recognition rate is quite probably impossible in our world of noise and different font styles, it is important to design character recognition algorithms with these failures in mind so that when mistakes are inevitably made, they will at least be understandable and predictable to the person working with the
Hemanth S.
Saritha B. S.
No associations
LandOfFree
An Efficient Hidden Markov Model for Offline Handwritten Numeral Recognition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Efficient Hidden Markov Model for Offline Handwritten Numeral Recognition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Hidden Markov Model for Offline Handwritten Numeral Recognition will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-676190