An algorithm development for handwritten character recognition by personal handwriting identity analysis [PHIA]

P. Boribalburephan, B. Sakboonyarat
{"title":"An algorithm development for handwritten character recognition by personal handwriting identity analysis [PHIA]","authors":"P. Boribalburephan, B. Sakboonyarat","doi":"10.1109/KST.2012.6287732","DOIUrl":null,"url":null,"abstract":"The algorithm for online handwritten character recognition, PHIA algorithm, is introduced. The algorithm uses a likelihood score computed by a small neural network from every symbol pair for various decisions. Scores are used to generate a relationship map (Rivals/Non-rivals) between each symbol pairs. The training data is added to the database if and only if the relationship with the training data is `rival' for all existing database samples that identifies the same symbol. In the recognition phase, a nearest neighbor search is applied. During the search, if we traverse to a node whose relationship to the input is `non-rival', we later skip all processes that would operate on that node's rivals. This optimizes the decision path for each of the individual and enhances the ability to learn new symbols effectively.","PeriodicalId":209504,"journal":{"name":"Knowledge and Smart Technology (KST)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge and Smart Technology (KST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KST.2012.6287732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The algorithm for online handwritten character recognition, PHIA algorithm, is introduced. The algorithm uses a likelihood score computed by a small neural network from every symbol pair for various decisions. Scores are used to generate a relationship map (Rivals/Non-rivals) between each symbol pairs. The training data is added to the database if and only if the relationship with the training data is `rival' for all existing database samples that identifies the same symbol. In the recognition phase, a nearest neighbor search is applied. During the search, if we traverse to a node whose relationship to the input is `non-rival', we later skip all processes that would operate on that node's rivals. This optimizes the decision path for each of the individual and enhances the ability to learn new symbols effectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于个人笔迹身份分析的手写体字符识别算法研究[a]
介绍了一种在线手写体字符识别算法——PHIA算法。该算法使用由小型神经网络从每个符号对中计算出的似然评分来进行各种决策。分数用于生成每个符号对之间的关系图(对手/非对手)。当且仅当与训练数据的关系对于识别相同符号的所有现有数据库样本来说是“竞争”时,将训练数据添加到数据库中。在识别阶段,应用最近邻搜索。在搜索过程中,如果我们遍历到一个与输入的关系为“非竞争”的节点,我们稍后会跳过对该节点的竞争节点进行操作的所有进程。这优化了每个个体的决策路径,提高了有效学习新符号的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Experimental study efficiency of robust models of Lucas-Kanade optical flow algorithms in the present of Non-Gaussian Noise Training a single multiplicative neuron with a harmony search algorithm for prediction of S&P500 index - An extensive performance evaluation A combined semantic social network analysis framework to integrate social media data Automatic traffic estimation system using mobile probe vehicles Pupil extraction system for Nystagmus diagnosis by using K-mean clustering and Mahalanobis distance technique
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1