We describe an off-line handwritten Korean character recognition module for real-time address reading. Our module has a two-stage recognition structure. The first recognition aims at reducing target classes for the second recognition at high-speed. We introduced a method to remove non-similar candidates with an input from the candidate set returned by the first recognizer. The optimal candidate set obtained after the operation of the removal method is used to be the target class set for the second recognition and hence should include the class membership of input without fail and a possible small number of candidates in consideration of the whole processing time. The result of experiment done with the PE92 database has proven the superiority of the removal method.
Non-similar candidate removal method for off-line handwritten Korean character recognition
2003-01-01
249670 byte
Conference paper
Electronic Resource
English
Non-similar Candidate Removal Method for Off-line Handwritten Korean Character Recognition
British Library Conference Proceedings | 2003
|A Flexible Recognition Engine for Complex On-line Handwritten Character Recognition
British Library Conference Proceedings | 2003
|Fuzzy Logic in Handwritten Character Recognition
British Library Online Contents | 2003
|