Abstract
The authors introduce a new method for on-line character recognition based on the co-operation of two classifiers, a static one and a dynamic one. In fact, on-line and off-line recognition present very different qualities and small redundancy. Its complementary treatment can bring very interesting results. In their approach, each classifier which operates respectively on static and dynamic character properties, uses the k-nearest-neighbour algorithm. References have been selected previously, using a clustering technic based on dynamic programming, which takes into account the intra-class variability of dynamics characters. This allows data compilation and increases recognition speed. Test data are presented to both classifiers and results are integrated by a static supervisor which provides the final decision. They present the results on their omniscriptor database which count 36 different classes of character and more than 36000 different characters.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
