Machine recognition of printed Chinese characters via transformation algorithms

摘要

This paper presents some novel results concerning the recognition of single-font printed Chinese characters via the transformation algorithms of Fourier, Hadamard, and Rapid. The new design philosophy of a three-stage structure is believed to offer at least a suboptimal search strategy for recognizing printed Chinese characters with a dictionary of 7000–8000 characters. The transformation algorithms discussed in this paper will be used in the last two stages. Extensive experiments and simulations concerning feature extraction and noisy or abnormal pattern recognition have been carried out (the simulations have been restricted to a 63-character subset called “Radicals”). Comparison has been made of all three transforms according to their ability to recognize characters.