| 一种字符孔洞数的求法 |
| |
| 引用本文： | 周明元,曹中华. 一种字符孔洞数的求法[J]. 计算机与现代化, 2005, 0(9): 5-7 |
| |
| 作者姓名： | 周明元 曹中华 |
| |
| 作者单位： | 宜春学院现代教育技术中心,江西,宜春,336000;江西师范大学软件学院,江西,南昌,330027 |
| |
| 摘 要： | 提出一种新的求字符孔洞数目算法。根据字符图像形状特征，把要识别的字符图像用有向图表示，对有向图进行广度优先遍历而得出字符孔洞个数，用于字符识别。
|
| 关 键 词： | 字符识别 孔洞数 有向图 广度优先遍历 |
| 文章编号： | 1006-2475（2005）09-0005-03 |
| 收稿时间： | 2004-11-03 |
| 修稿时间： | 2004-11-03 |
A Way of Getting Character's Hole Number |
| |
| ZHOU Ming-yuan,CAO Zhong-hua. A Way of Getting Character's Hole Number[J]. Computer and Modernization, 2005, 0(9): 5-7 |
| |
| Authors: | ZHOU Ming-yuan CAO Zhong-hua |
| |
| Abstract: | 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. |
| |
| Keywords: | character recognition hole number digraph breadth-first tmversal |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
