Please use this identifier to cite or link to this item: http://repo.lib.jfn.ac.lk/ujrr/handle/123456789/813
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRamanan, M.-
dc.contributor.authorRamanan, A.-
dc.contributor.authorCharles Eugene Y.-
dc.date.accessioned2016-01-04T06:59:18Z-
dc.date.accessioned2022-06-28T04:51:44Z-
dc.date.available2016-01-04T06:59:18Z-
dc.date.available2022-06-28T04:51:44Z-
dc.date.issued2015-08-25-
dc.identifier.urihttp://repo.lib.jfn.ac.lk/ujrr/handle/123456789/813-
dc.description.abstractOptical character recognition (OCR) is one of the important research areas in image processing and pattern recognition. OCR for printed Tamil text is considered as a challenging problem due to the large number of (i.e., 247) characters with complicated structures and, similarity between characters as well as different font styles. This paper proposes a novel approach for multiclass classification to recognise Tamil characters using binary support vector machines (SVMs) organised in a hybrid decision tree. The proposed decision tree is a binary rooted directed acyclic graph (DAG) which is succeeded by unbalanced decision trees (UDT). DAG implements OVO-based SVMs whereas UDT implements OVA-based SVMs. Each node of the hybrid decision tree exploits optimal feature subset in classifying the Tamil characters. The features used by the decision tree are basic, density, histogram of oriented gradients (HOG) and transition. Experiments have been carried out with a dataset of 12400 samples and the recognition rate observed is 98.80% with the hybrid approach of DAG and UDT SVMs using RBF kernel.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectTamil OCR, HOG, UDT-SVM, DAG-SVMen_US
dc.titleA Hybrid Decision Tree for Printed Tamil Character Recognition Using SVMsen_US
dc.typeArticleen_US
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
HybridDecisionTree.pdf174.52 kBAdobe PDFThumbnail
View/Open


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