Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/3648
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRajput G.G
dc.contributor.authorHorakeri R.
dc.date.accessioned2020-06-12T15:01:04Z-
dc.date.available2020-06-12T15:01:04Z-
dc.date.issued2011
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , Vol. 7080 LNAI , , p. 169 - 180en_US
dc.identifier.uri10.1007/978-3-642-25725-4_15
dc.identifier.urihttp://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/3648-
dc.description.abstractIn this paper, we present an efficient method for recognition of basic characters (vowels) of handwritten Kannada text, which is thinning free and independent of size of handwritten characters. Crack codes and Fourier descriptors are used for computing features. The recognition accuracy has been studied by comparing the performances of well known K-NN and SVM classifiers. Five-fold cross validation technique is used for result computation. Experiments are performed on handwritten Kannada vowels consisting of 6500 images with 500 samples for each class. The mean performance of the system with these two shape based features together is 91.24% and 93.73% for K-NN and SVM classifiers, respectively, demonstrating the fact that SVM performs better over K-NN classifier. The system methodology can be extended for the recognition of remaining set of Kannada characters. © 2011 Springer-Verlag.en_US
dc.subjectcrack codes
dc.subjectFourier descriptors
dc.subjectK-NN
dc.subjectKannada
dc.subjectSVM
dc.titleHandwritten Kannada vowel character recognition using crack codes and Fourier descriptorsen_US
dc.typeConference Paper
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.