Performance Comparison of SVM and K-NN for Oriya Character Recognition
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2011, Vol 0, Issue 1
Abstract
Image classification is one of the most important branch of Artificial intelligence; its application seems to be in a promising direction in the development of character recognition in Optical Character Recognition (OCR). Character recognition (CR) has been extensively studied in the last half century and progressed to the level, sufficient to produce technology driven applications. Now the rapidly growing computational power enables the implementation of the present CR methodologies and also creates an increasing demand on many emerging application domains, which require more advanced methodologies. Researchers for the recognition of Indic Languages and scripts are comparatively less with other languages. There are lots of different machine learning algorithms used for image classification nowadays. In this paper, we discuss the characteristics of some classification methods such as Support Vector Machines (SVM) and K-Nearest Neighborhood (K-NN) that have been applied to Oriya characters. We will discuss the performance of each algorithm for character classification based on drawing their learning curve, selecting parameters and comparing their correct rate on different categories of Oriya characters. It has been observed that Support Vector Machines outperforms among both the classifiers.
Authors and Affiliations
Sanghamitra Mohanty , Himadri Nandini Das Bebartta
Keywords
Related Articles
- EP ID EP92328
- DOI -
- Views 64
- Downloads 0
Partial Greedy Algorithm to Extract a Minimum Phonetically-and-Prosodically Rich Sentence Set
A phonetically-and-prosodically rich sentence set is so important in collecting a read-speech corpus for developing phoneme-based speech recognition. The sentence set is usually searched from a huge text corpus of millio...
Solving the Free Clustered TSP Using a Memetic Algorithm
The free clustered travelling salesman problem (FCTSP) is an extension of the classical travelling salesman problem where the set of vertices is partitioned into clusters, and the task is to find a minimum cost Hamiltoni...
An Area-Efficient Carry Select Adder Design by using 180 nm Technology
In this paper, we proposed an area-efficient carry select adder by sharing the common Boolean logic term. After logic simplification and sharing partial circuit, we only need one XOR gate and one inverter gate in each su...
Cost-Effective Smart Metering System for the Power Consumption Analysis of Household
This paper deals with design, calibration, experimental implementation and validation of cost-effective smart metering system. Goal was to analyse power consumption of the household with the immediate availability of the...
Scale and Resolution Invariant Spin Images for 3D Object Recognition
Until the last decades, researchers taught that teaching a computer how to recognize a bunny, for example, in a complex scene is almost impossible. Today, computer vision system do it with a high score of accuracy. To br...