Performance Analysis of Random Forests with SVM and KNN in Classification of Ancient Kannada Scripts
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2014, Vol 13, Issue 9
Abstract
Ancient inscriptions which reveal the details of yester years are difficult to interpret by modern readers and efforts are being made in automating such tasks of deciphering historical records. The Kannada script which is used to write in Kannada language has gradually evolved from the ancient script known as Brahmi. Kannada script has traveled a long way from the earlier Brahmi model and has undergone a number of changes during the regimes of Ashoka, Shatavahana, Kadamba, Ganga, Rashtrakuta, Chalukya, Hoysala , Vijayanagara and Wodeyar dynasties. In this paper we discuss on Classification of ancient Kannada Scripts during three different periods Ashoka, Kadamba and Satavahana. A reconstructed grayscale ancient Kannada epigraph image is input, which is binarized using Otsu’s method. Normalized Central and Zernike Moment features are extracted for classification. The RF Classifier designed is tested on handwritten base characters belonging to Ashoka, Satavahana and Kadamba dynasties. For each dynasty, 105 handwritten samples with 35 base characters are considered. The classification rates for the training and testing base characters from Satavahana period, for varying number of trees and thresholds of RF are determined. Finally a Comparative analysis of the Classification rates is made for the designed RF with SVM and k-NN classifiers, for the ancient Kannada base characters from 3 different eras Ashoka, Kadamba and Satavahana period.
Authors and Affiliations
Soumya A, G Hemantha Kumar
Keywords
Related Articles
- EP ID EP650609
- DOI 10.24297/ijct.v13i9.2392
- Views 94
- Downloads 0
Aggregating IDS Alerts Based on Time Threshold: Testing and Results
Every secure system has the possibility to fail. Therefore, extra effort should be taken to protect these systems. Intrusion Detection Systems (IDSs) had been proposed with the aim of providing extra protection to securi...
An Improved Min-Min Task Scheduling Algorithm with Grid Utilization and Minimized Makespan
Grid computing is hardware and software infrastructure which offers a economical, distributable, coordinated and credible access to strong computational abilities [1]. For optimal use of the abilities of large distribute...
Enhancing RSA algorithm using Mersenne Primes with reduced size of encrypted file
Message passing from source to destination is one of the important aspects of communication. However, it is requiredmany times that this message gets transmitted secretly, so that no unauthorized person gets knowledge of...
Investigations into Hybrid Magneto-hydrodynamic (MHD) Antenna
Dielectric Resonator Antennas (DRAs) have received lots of attention in the last two decades due to several attractive characteristics such as high radiation efficiency, light weight, and low profile. There is also incre...
P-Codec: Parallel Compressed File Decompression Algorithm for Hadoop
The increasing amount and size of data being handled by data analytic applications running on Hadoop has created a need for faster data processing. One of the effective methods for handling big data sizes is compression....