Abstract
The character set used by the Chinese is greater in both size and complexity than that used by the Japanese, and experiments performed by the authors indicate that the stroke-matching algorithm of Yamamoto and Rosenfeld (1982) is too computationally intensive to be implemented for the recognition of complicated Chinese characters. A modified relaxation method that greatly reduces the computational load is proposed. The idea is to incorporate specific knowledge about the Chinese characters into the training system to remove inconsistencies with a higher efficiency and to speed up the matching process. Experimental results on the 240 most frequently used characters written by 37 different individuals showed that a fourfold improvement in speed could be achieved, making it more feasible to implement the algorithm for the recognition of complicated Chinese 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 callMore From: IEEE Transactions on Systems, Man, and Cybernetics
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.
