By Topic

2-stage character recognition by detection and correction of erroneously-identified characters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
C. -H. Tung ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; H. -J. Lee

The authors propose a two-stage text recognition system with high recognition rate. In the first stage, characters recognized as different recognition results by two matching modules are rejected, since they are recognized incorrectly by at least one of the two matching modules. The rejected characters are then processed by a Markov language model in the second stage. Since most of the input characters are recognized in the first stage, the computation cost of the language model is low and the recognition rate of the language model is excellent. By using this erroneously-identified text recognition approach, a system with high character recognition accuracy can be achieved. Our text recognition system can be extended to a multiple-stage recognition system to further improve the recognition accuracy. In each stage, various matching modules can be used. The recognized result of an input character will be accepted only when all matching modules produce the same result. Rejected characters will be fed into the next stage for further processing

Published in:

Document Analysis and Recognition, 1993., Proceedings of the Second International Conference on

Date of Conference:

20-22 Oct 1993