2012
DOI: 10.5120/7942-1270
|View full text |Cite
|
Sign up to set email alerts
|

Offline Handwritten Devanagari Vowels Recognition using KNN Classifier

Abstract: The discussion in the paper is regarding to the recognition of handwritten Devanagari vowels by means of a classifier named as K-NN (K-Nearest Neighbour). Before applying classifier, feature extortion is accomplished for extracting the feature points (FP) i.e. also known as division points (DP). In this paper the feature extortion is perform through recursive sub division technique, which is first time implemented on Devanagari vowels. K-NN classifier is functioned for the learning and the testing phases, thro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…The recognition performance with this method is 94.12%. In Rakesh Rathi et al (2012), the authors used feature mining algorithms to compute the feature vector and tested the method on the Devanagari vowels database. Here, the KNN algorithm is used as a classification technique, and obtained the accuracy of 96.14%.…”
Section: K-nearest Neighbors Algorithm (Knn)mentioning
confidence: 99%
“…The recognition performance with this method is 94.12%. In Rakesh Rathi et al (2012), the authors used feature mining algorithms to compute the feature vector and tested the method on the Devanagari vowels database. Here, the KNN algorithm is used as a classification technique, and obtained the accuracy of 96.14%.…”
Section: K-nearest Neighbors Algorithm (Knn)mentioning
confidence: 99%
“…K-nearest neighbor (k-NN) is instance-based supervised learning, based on statistical estimation. Since each Thai-handwritten recognition image is stored in a row of the vector (Rathi, Pandey, Chaturvedi & Jangid, 2012), all rows are kept as a big table (Mookdarsanit & Moorkdarsanit, 2018a) without any independent learning functions (a.k.a. lazy learning).…”
Section: K-nearest Neighbor (K-nn)mentioning
confidence: 99%
“…This problem is difficult and may be resolved by jointly segmenting and recognizing the characters [27], [37], such a problem can be formulated as a multi-class classification problem with a large range of small snippets extracted from the different prototypes of characters [25].…”
Section: Manuscript Recognition Problemmentioning
confidence: 99%
“…Several approaches have used this method in the resolution of the problem of the handwriting recognition problem [18], [25].…”
Section: Learning For the Recognition Stripmentioning
confidence: 99%