Abstract
A stroke order and number free method for on-line recognition of Chinese characters is proposed. Both input characters and the model characters are represented with complete attributed relational graphs (ARGs). The ARGs of the model base are built according to the human knowledge of the segment relation structure of Chinese characters. For the recognition purpose, an optimal matching measure between two ARGs is defined, and the graph matching is formulated as a search problem of finding the minimum cost path in a state space tree, using the A * algorithm. Moreover, to reduce the search time of the A *, besides a heuristic estimate, a novel strategy is employed which again uses the human knowledge of the segment position structure of Chinese characters to prune the tree. Our experimental results demonstrate the efficiency of the proposed method.
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 callMore From: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Disclaimer: 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.
