摘要
提出一种新的求字符孔洞数目算法。根据字符图像形状特征,把要识别的字符图像用有向图表示,对有向图进行广度优先遍历而得出字符孔洞个数,用于字符识别。
This paper presents a new algorithm to get the character＇s hole number. According to the feature of character image＇s figure, the digraph can be created. Then the digraph will be traversed in breadth-first to get the hole number used in character recognition.
出处
《计算机与现代化》
2005年第9期5-7,共3页
Computer and Modernization
关键词
字符识别
孔洞数
有向图
广度优先遍历
character recognition
hole number
digraph
breadth-first tmversal
