首页 | 本学科首页   官方微博 | 高级检索  
     

一种非限制性的手写数字的识别方法
引用本文:程晓群,戴汝为,刘迎建.一种非限制性的手写数字的识别方法[J].自动化学报,1993,19(5):578-586.
作者姓名:程晓群  戴汝为  刘迎建
作者单位:1.中国科学院自动化所,北京
基金项目:国家自然科学基金,863计划的资助
摘    要:本文从语义,句法模式识别观点,提出一种基于模型指导的有限状态属性自动机,进行特征抽取。对每一种典型的畸变模型设计一个有限状态属性文法及其相应的属性自动机,采用自下而上和自上而下相结合的控制策略,并在低层次引入知识指导,减少了工作量和不确定性。基于上述方法实现的非限制性手写数字识别系统,经过对1100个非限制性手写数字样本的测试,平均识别率达95.2%,拒识率为4.6%,误识率为0.2%。

关 键 词:模式识别    基元    属性    自动机
收稿时间:1992-5-21

A New Method for Unconstrained Handwritten Numerals Recognition
Cheng Xiaoqun,Tai Juwei,Liu Yingjian.A New Method for Unconstrained Handwritten Numerals Recognition[J].Acta Automatica Sinica,1993,19(5):578-586.
Authors:Cheng Xiaoqun  Tai Juwei  Liu Yingjian
Abstract:In this paper, a model-based finite state attribute automaton is proposed from syntatic and semantic recognition point view for the extraction of features. For each typical deformed model, a new finite state attribute grammar and its corresponding automaton is designed. This method combines Top-Down and Bottom-Up control strategy, introduces knowledge in low levels, this cuts down the amount of operations and reduces the uncertainty. An unconstrained handwritten numerals recognition system is realized based on this approach. By testing a set of 1, 100 samples, the average recognition ratte is 95.2%, rejection rate is 4.6%, substitution rate is 0.2%.
Keywords:Pattern recognition  primitive  attributed grammar  automata  
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号