A Feature Vector for Optical Character Recognition

Ariyan Zarei, Arman Yousefzadeh Shooshtari
{"title":"A Feature Vector for Optical Character Recognition","authors":"Ariyan Zarei, Arman Yousefzadeh Shooshtari","doi":"10.1145/3209914.3209942","DOIUrl":null,"url":null,"abstract":"The extraction of the written text in an image has always been an important application of computer vision since it was introduced. It is widely used in automatic number plate recognition, handwriting recognition, extracting data from scanned documents such as passports, ID cards, banking forms, etc. There exist a wide variety of approaches to the general problem of optical character recognition such as Template Matching, Structural Classification, Artificial Neural Networks, etc. In this paper we introduced a new feature vector for optical character recognition and we tested its accuracy by using a Nearest Neighbor classifier. The new feature vector is a sequence generated by putting together the orientations of each pixel to a base point. The classifier then, is simply Longest Common Subsequence algorithm. In other words, a new image contains a character if and only if the corresponding sequence of the image has the longest common subsequence with the feature vector or sequence of that character among all the characters available. The experiments provided us with satisfying results which can be definitely better under better classifiers such as RNN or SVM.","PeriodicalId":174382,"journal":{"name":"Proceedings of the 1st International Conference on Information Science and Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1st International Conference on Information Science and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3209914.3209942","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The extraction of the written text in an image has always been an important application of computer vision since it was introduced. It is widely used in automatic number plate recognition, handwriting recognition, extracting data from scanned documents such as passports, ID cards, banking forms, etc. There exist a wide variety of approaches to the general problem of optical character recognition such as Template Matching, Structural Classification, Artificial Neural Networks, etc. In this paper we introduced a new feature vector for optical character recognition and we tested its accuracy by using a Nearest Neighbor classifier. The new feature vector is a sequence generated by putting together the orientations of each pixel to a base point. The classifier then, is simply Longest Common Subsequence algorithm. In other words, a new image contains a character if and only if the corresponding sequence of the image has the longest common subsequence with the feature vector or sequence of that character among all the characters available. The experiments provided us with satisfying results which can be definitely better under better classifiers such as RNN or SVM.
光学字符识别的特征向量
从图像中提取文字一直是计算机视觉的一个重要应用。广泛应用于车牌自动识别、手写识别、护照、身份证、银行表格等扫描文件的数据提取。针对光学字符识别的一般问题,存在着各种各样的方法,如模板匹配、结构分类、人工神经网络等。本文引入了一种新的光学字符识别特征向量,并利用最近邻分类器对其精度进行了测试。新的特征向量是通过将每个像素的方向组合到一个基点而生成的序列。分类器就是简单的最长公共子序列算法。换句话说,当且仅当图像的相应序列与该字符的特征向量或序列在所有可用字符中具有最长公共子序列时,新图像包含该字符。实验提供了令人满意的结果,在RNN或SVM等更好的分类器下,结果肯定会更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信