| Summary: | 碩士 === 國立交通大學 === 資訊工程研究所 === 82 === The goal of this thesis is to speed up the execution and
increase the efficiency of character recognition by using some
knowledge relative to radicals. In this thesis, we assume that
we have accepted an imperfect result of stroke extraction. If
the correct radicals can be extracted successfully, the task of
character recognition will be simplified greatly. First, we
defined about 400 radicals that can compose more than 2000
Chinese characters. According to the experimental results and
our observation, we summarize some knowledge to decribe the
structural properties of those reference radical models. In the
recognition process, 2-D Chinese characters would be first
processed by radical separation and stroke extraction. Next, we
use the possible positions at which radicals locate and the
stable stroke types to pre-select suitable extracted strokes
and reference radical models before the radical matching
process that is a dynamic programming method. Then, there are
three post-checking methods: the related stroke length
checking, the convex hull checking, and the radical overlap
checking are used to check the legality of all candidate
radicals and remove the illegal ones. Finally, we can extract
the correct radicals by finding the maximum clique of a
undirected graph constructed by the legal candidate radicals.
The input method utilizing a tablet is also applied in our
system. Computers can generate each reference radical model
automatically according to the on-line information extracted
from a tablet, and insert it into the proper position of the
knowledge base. The extension of radical database can be
achieved easily. The testing Chinese characters are selected
from the database CCL/HCCR1 and the experimental results show
the feasibility of the radical extraction method proposed in
this thesis.
|
|---|
