一种新颖的基于sift的编码本生成方法,用于手写泰米尔字符识别

A. Subashini, N. Kodikara
{"title":"一种新颖的基于sift的编码本生成方法,用于手写泰米尔字符识别","authors":"A. Subashini, N. Kodikara","doi":"10.1109/ICIINFS.2011.6038077","DOIUrl":null,"url":null,"abstract":"A method for the off-line recognition of Tamil handwriting characters based on local feature extraction is investigated. In the proposed method each pre-processed character is represented by a set of local SIFT feature vectors. From a large set of SIFT descriptors, the key idea is to create a codebook for each character using K-means clustering algorithm. K-means is an optimisation algorithm but this algorithm takes very long time to converge. We construct an initial codebook by using the Linde Buzo and Gray (LBG) algorithm so that the convergence time for K-means is reduced considerably. Target character is recognised into one of twenty categories by k-nearest neighbour classification. An average recognition rate of 87% on the character level has been achieved in experiments using six thousand training and two thousand testing images of twenty selected characters. Further study may include more characters and more samples being recognised with better classifier.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"285 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"A novel SIFT-based codebook generation for handwritten Tamil character recognition\",\"authors\":\"A. Subashini, N. Kodikara\",\"doi\":\"10.1109/ICIINFS.2011.6038077\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method for the off-line recognition of Tamil handwriting characters based on local feature extraction is investigated. In the proposed method each pre-processed character is represented by a set of local SIFT feature vectors. From a large set of SIFT descriptors, the key idea is to create a codebook for each character using K-means clustering algorithm. K-means is an optimisation algorithm but this algorithm takes very long time to converge. We construct an initial codebook by using the Linde Buzo and Gray (LBG) algorithm so that the convergence time for K-means is reduced considerably. Target character is recognised into one of twenty categories by k-nearest neighbour classification. An average recognition rate of 87% on the character level has been achieved in experiments using six thousand training and two thousand testing images of twenty selected characters. Further study may include more characters and more samples being recognised with better classifier.\",\"PeriodicalId\":353966,\"journal\":{\"name\":\"2011 6th International Conference on Industrial and Information Systems\",\"volume\":\"285 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 6th International Conference on Industrial and Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIINFS.2011.6038077\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 6th International Conference on Industrial and Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIINFS.2011.6038077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

摘要

研究了一种基于局部特征提取的泰米尔语手写字符离线识别方法。在该方法中,每个预处理字符由一组局部SIFT特征向量表示。从大量的SIFT描述符中,关键思想是使用K-means聚类算法为每个字符创建一个码本。K-means是一种优化算法,但该算法需要很长时间才能收敛。我们使用Linde Buzo和Gray (LBG)算法构造了一个初始码本,从而大大缩短了K-means的收敛时间。通过k近邻分类将目标字符识别为20个类别中的一个。在选取20个字符的6000张训练图像和2000张测试图像进行实验,在字符水平上的平均识别率达到了87%。进一步的研究可能包括使用更好的分类器识别更多的字符和更多的样本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A novel SIFT-based codebook generation for handwritten Tamil character recognition
A method for the off-line recognition of Tamil handwriting characters based on local feature extraction is investigated. In the proposed method each pre-processed character is represented by a set of local SIFT feature vectors. From a large set of SIFT descriptors, the key idea is to create a codebook for each character using K-means clustering algorithm. K-means is an optimisation algorithm but this algorithm takes very long time to converge. We construct an initial codebook by using the Linde Buzo and Gray (LBG) algorithm so that the convergence time for K-means is reduced considerably. Target character is recognised into one of twenty categories by k-nearest neighbour classification. An average recognition rate of 87% on the character level has been achieved in experiments using six thousand training and two thousand testing images of twenty selected characters. Further study may include more characters and more samples being recognised with better classifier.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Selective load control to provide primary frequency response in the wake of introducing new large thermal power plants to Sri Lanka A trust computing mechanism for cloud computing with multilevel thresholding Distributed beamforming techniques for dual-hop decode-and-forward MIMO relay networks Performance comparison of optical receivers using different filtering algorithms and modulation schemes A radial basis function neural network approach for multi-hour short term load-price forecasting with type of day parameter
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1