基于凹凸特性的非限制粘连手写数字串切分  

A New Segmentation Method of Unconstrained Handwritten Connected Numeral String Based on Concave-and-Convex Feature

作　　者：罗佳[1] 王玲[1] 

机构地区：[1]四川师范大学计算机科学学院

出　　处：《微计算机信息》2007年第25期275-276,284,共3页Control & Automation

摘　　要：针对现有的切分算法结构复杂,时间和空间复杂度高等不足,提出了一种基于凹凸特性的非限制粘连手写数字串切分的新方法。首先计算数字串图像的赋值背景,然后从中提取凹凸特性,找到切分区域,最后在切分区域内提取切分线。该方法简单快速,在提高切分正确率的同时也降低了复杂度。利用NISTSD19收集到的样本进行实验,正确率高达97.5%,切分时间也大大缩短。Considering such defects of the present segmentation methods as complex structure and so on, a new method based on concave-and-convex feature is proposed for unconstrained handwritten connected numeral strings segmentation. First value_associated background of string＇s image is found, convex-and-concave feature is then extracted. At last, the convex areas for segmentation are found. This method is simple and fast, which reduce the time and space complexity. Test results on collection of samples from NIST SD19 show that the system achieve an accuracy of 97.5%, and the time also is shorten greatly.

关 键 词：凹凸特性 手写数字串 赋值背景 

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