| 摘要 |
CHARACTER RECOGNITION APPARATUS A recognition dictionary of a tree structure is created by using multi-value feature with maximum and minimum values such as a white run length, rather than a binary feature value such as black or white pels, so that the dictionary can be created through very simple operations with fewer samples. In addition, recognition error due to erroneous branching can be detected at the time of searching of the dictionary tree by using a ternary tree instead of a binary tree, to improve the efficiency in the recognition. Combination of the recognition technique with the tree structure dictionary and the pattern matching technique also provides a feature where the former can efficiently narrow down the candidate character categories, and then the latter can order the candidates. Thus, because high speed and high recognition ratio can be realized, and the processing is simple, a practical system can be implemented on a general purpose personal computer in software only, without using special hardware. Additionally, it is easy to improve the recognition ratio through adaption because addition or modification of the recognition dictionary can be very easily performed. JA9-82-002 |
