Using K-Nearest Neighbor in Optical Character Recognition

  • Ong V
  • Suhartono D
N/ACitations
Citations of this article
63Readers
Mendeley users who have this article in their library.

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.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Ong, V., & Suhartono, D. (2016). Using K-Nearest Neighbor in Optical Character Recognition. ComTech: Computer, Mathematics and Engineering Applications, 7(1), 53. https://doi.org/10.21512/comtech.v7i1.2223

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 15

68%

Lecturer / Post doc 3

14%

Professor / Associate Prof. 2

9%

Researcher 2

9%

Readers' Discipline

Tooltip

Computer Science 25

71%

Engineering 9

26%

Environmental Science 1

3%

Save time finding and organizing research with Mendeley

Sign up for free