| Sherman细化技术的实现 |
| |
| 引用本文： | 乔元志.Sherman细化技术的实现[J].吉林大学学报(信息科学版),1995(2). |
| |
| 作者姓名： | 乔元志 |
| |
| 作者单位： | 长春邮电学院电信工程设计院 |
| |
| 摘 要： | 根据近邻集的概念，提出了一种３×３窗口中黑色元素间最短距离的方法。与直接比较法相比，该方法使Ｓｈｅｒｍａｎ细化技术的处理速度得以提高。计算机模拟显示，随着字符点阵的增大，细化速度明显提高，细化结果保证了连通性且接近输入线状结构的中轴位置。
|
| 关 键 词： | 字符识别，模式识别，预处理／细化技术 |
Implementation for sherman thinning technique |
| |
| Qiao Yuanzhi.Implementation for sherman thinning technique[J].Journal of Jilin University:Information Sci Ed,1995(2). |
| |
| Authors: | Qiao Yuanzhi |
| |
| Abstract: | cording to the concept of adjacent set,this paper gives a method of minimumdistance between the black points on a 3*3 discrete grid.This method of min-imum distance makes the processing speed of Sherman thinning techque im-proved by contrast with the method of direct comparison. The simulated resulton computer shows that this method of minimum distance improves the pro-cessing speed obviously with the increment of character dot matrix and guaran-tees the thinned result continual and close to medial axis. |
| |
| Keywords: | character recognition pattern recognition pretreatment thinning technique |
| 本文献已被 CNKI 等数据库收录！ |
