基于连接段数细化算法的脱机手写体数字识别  

Recognition of Off-line Handwritten Numbers Based on Thinning Algorithm with Linked Section

作　　者：陈志坚[1] 成培[1] 李峰[1] 

机构地区：[1]长沙理工大学计算机与通信工程学院,长沙410076

出　　处：《通讯和计算机（中英文版）》2006年第6期48-51,共4页Journal of Communication and Computer

摘　　要：本文描述了已有的字符细化算法的思想及其缺陷，在分析细化形变根源的基础上给出了一种新的快速细化算法，并将该算法应用到脱机手写体数字识别过程申。该算法不会产生毛刺和伪分支点。细化後字符骨架形变小，而且速度也比较快，从而提高了手写体数字的识别速度。This paper depicts main ideas and defects of available thinning algorithms, and presents a new fast thinning algorithm with linked section based on analyzing origin of thinning distortion. The algorithm will be used in the recognition progress of off-line handwritten numbers. The algorithm produces no hairs or no spurious branches and makes the skeleton of the thinned character have less distortion. The speed of the algorithm is fast, and it can improve the speed of recognition of the handwritten numbers.

关 键 词：细化 连接段数 骨架 模板匹配 字符识别 

分 类 号：TP391.43[自动化与计算机技术—计算机应用技术]