Using K-Nearest Neighbor in Optical Character Recognition

ComTech Pub Date : 2016-03-01 DOI:10.21512/COMTECH.V7I1.2223
V. Ong, Derwin Suhartono
{"title":"Using K-Nearest Neighbor in Optical Character Recognition","authors":"V. Ong, Derwin Suhartono","doi":"10.21512/COMTECH.V7I1.2223","DOIUrl":null,"url":null,"abstract":"The growth in computer vision technology has aided society with various kinds of tasks. One of these tasks is the ability of recognizing text contained in an image, or usually referred to as Optical Character Recognition (OCR). There are many kinds of algorithms that can be implemented into an OCR. The K-Nearest Neighbor is one such algorithm. This research aims to find out the process behind the OCR mechanism by using K-Nearest Neighbor algorithm; one of the most influential machine learning algorithms. It also aims to find out how precise the algorithm is in an OCR program. To do that, a simple OCR program to classify alphabets of capital letters is made to produce and compare real results. The result of this research yielded a maximum of 76.9% accuracy with 200 training samples per alphabet. A set of reasons are also given as to why the program is able to reach said level of accuracy.","PeriodicalId":31095,"journal":{"name":"ComTech","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ComTech","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21512/COMTECH.V7I1.2223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The growth in computer vision technology has aided society with various kinds of tasks. One of these tasks is the ability of recognizing text contained in an image, or usually referred to as Optical Character Recognition (OCR). There are many kinds of algorithms that can be implemented into an OCR. The K-Nearest Neighbor is one such algorithm. This research aims to find out the process behind the OCR mechanism by using K-Nearest Neighbor algorithm; one of the most influential machine learning algorithms. It also aims to find out how precise the algorithm is in an OCR program. To do that, a simple OCR program to classify alphabets of capital letters is made to produce and compare real results. The result of this research yielded a maximum of 76.9% accuracy with 200 training samples per alphabet. A set of reasons are also given as to why the program is able to reach said level of accuracy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于k近邻的光学字符识别
计算机视觉技术的发展帮助社会完成了各种各样的任务。其中一项任务是识别图像中包含的文本的能力,或通常称为光学字符识别(OCR)。有许多种算法可以实现到OCR中。k近邻算法就是这样一种算法。本研究旨在通过k -最近邻算法找出OCR机制背后的过程;最具影响力的机器学习算法之一。它还旨在找出该算法在OCR程序中的精确度。为此,编写了一个简单的OCR程序来对大写字母的字母进行分类,以产生和比较实际结果。本研究的结果是,在每个字母表200个训练样本的情况下,准确率最高为76.9%。一组原因也给出了为什么该程序能够达到上述水平的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
6
审稿时长
16 weeks
期刊最新文献
Quality Function Deployment for Quality Performance Analysis in Indonesian Automotive Company for Engine Manufacturing Analytical Hierarchy Process for Enhancing Procurement Decision-Making in Project Phase: A Case Study in the Gold Mining Project Analytical Hierarchy Process (AHP), Economic Order Quantity (EOQ), and Reorder Point (ROP) in Inventory Management System Shoreline Change with Groin Coastal Protection Structure at North Java Beach The Application of Quality Function Deployment in Car Seat Industry
×
引用
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