首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Sparse representation-based classification algorithm for optical Tibetan character recognition
Authors:Heming Huang  Feipeng Da
Institution:1. School of Automation, Southeast University, Nanjing, Jiangsu 210096, China;2. School of Computer Science, Qinghai Normal University, Xining, Qinghai 810008, China
Abstract:A sparse representation-based two-phase classification algorithm is proposed for off-line handwritten Tibetan character recognition. The first phase realizes coarse classification with the K-NN classifier by finding the K nearest neighbours of a test sample in the dictionary constructed by K-SVD with samples of all classes, and the classes of these neighbours are regarded as the candidate classes of the test sample. The second phase performs fine classification with the sparse representation classifier by sparsely representing the test sample with all elements of the dictionary constructed by K-SVD with samples of all candidate classes, and the test sample is finally classified into the candidate class with the maximal contribution in sparse representation. Experiments on the Tibetan off-line handwritten character database show that an optimal recognition rate of 97.17% has been reached and it is 2.12% higher than that of K-NN.
Keywords:Sparse representation  K-NN  Tibetan  Off-line  Character recognition
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号