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

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