基于Levenshtein距离度量的整体手写单词识别

MOCR '13 Pub Date : 2013-08-24 DOI:10.1145/2505377.2505378
S. D. Chowdhury, U. Bhattacharya, S. K. Parui
{"title":"基于Levenshtein距离度量的整体手写单词识别","authors":"S. D. Chowdhury, U. Bhattacharya, S. K. Parui","doi":"10.1145/2505377.2505378","DOIUrl":null,"url":null,"abstract":"The rapid spread of pen-based digital devices and touch screen devices coupled with their affordability, and capability to take technology and digitization of data to the grassroots, has made online handwriting recognition an active field of research. The relevance of research on on-line handwriting recognition for Indian scripts is particularly high because the challenges posed by Indian scripts are different from other scripts. This is not only because of their extremely large alphabet size but also because the inter class variability among several classes is very small. In this article, we introduce a limited vocabulary online unconstrained handwritten Bangla (a major Indian script) word recognizer based on a novel word level feature representation. Here, we consider three different features extracted from a word sample and three event strings are generated corresponding to these three features. A distance function is formulated which uses the Levenshtein distance metric to compute the distance between two triplets of event strings representing two word samples. The nearest neighbour scheme is used to classify the input sample. We have simulated the proposed approach on vocabularies of varying sizes and the recognition performances are encouraging.","PeriodicalId":288465,"journal":{"name":"MOCR '13","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Levenshtein distance metric based holistic handwritten word recognition\",\"authors\":\"S. D. Chowdhury, U. Bhattacharya, S. K. Parui\",\"doi\":\"10.1145/2505377.2505378\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid spread of pen-based digital devices and touch screen devices coupled with their affordability, and capability to take technology and digitization of data to the grassroots, has made online handwriting recognition an active field of research. The relevance of research on on-line handwriting recognition for Indian scripts is particularly high because the challenges posed by Indian scripts are different from other scripts. This is not only because of their extremely large alphabet size but also because the inter class variability among several classes is very small. In this article, we introduce a limited vocabulary online unconstrained handwritten Bangla (a major Indian script) word recognizer based on a novel word level feature representation. Here, we consider three different features extracted from a word sample and three event strings are generated corresponding to these three features. A distance function is formulated which uses the Levenshtein distance metric to compute the distance between two triplets of event strings representing two word samples. The nearest neighbour scheme is used to classify the input sample. We have simulated the proposed approach on vocabularies of varying sizes and the recognition performances are encouraging.\",\"PeriodicalId\":288465,\"journal\":{\"name\":\"MOCR '13\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MOCR '13\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2505377.2505378\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MOCR '13","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2505377.2505378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

笔式数字设备和触摸屏设备的迅速普及,加上它们的可负担性,以及将技术和数据数字化带到基层的能力,使得在线手写识别成为一个活跃的研究领域。由于印度文字所面临的挑战不同于其他文字,因此印度文字在线手写识别研究的相关性特别高。这不仅是因为它们的字母非常大,而且还因为几个班级之间的班级差异非常小。在本文中,我们介绍了一个基于一种新颖的词级特征表示的有限词汇量的在线无约束手写孟加拉语(一种主要的印度文字)词识别器。这里,我们考虑从一个单词样本中提取三个不同的特征,并生成三个与这三个特征相对应的事件字符串。距离函数使用Levenshtein距离度量来计算代表两个单词样本的事件字符串的两个三元组之间的距离。使用最近邻方案对输入样本进行分类。我们对不同大小的词汇表进行了模拟,结果表明该方法的识别效果令人鼓舞。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Levenshtein distance metric based holistic handwritten word recognition
The rapid spread of pen-based digital devices and touch screen devices coupled with their affordability, and capability to take technology and digitization of data to the grassroots, has made online handwriting recognition an active field of research. The relevance of research on on-line handwriting recognition for Indian scripts is particularly high because the challenges posed by Indian scripts are different from other scripts. This is not only because of their extremely large alphabet size but also because the inter class variability among several classes is very small. In this article, we introduce a limited vocabulary online unconstrained handwritten Bangla (a major Indian script) word recognizer based on a novel word level feature representation. Here, we consider three different features extracted from a word sample and three event strings are generated corresponding to these three features. A distance function is formulated which uses the Levenshtein distance metric to compute the distance between two triplets of event strings representing two word samples. The nearest neighbour scheme is used to classify the input sample. We have simulated the proposed approach on vocabularies of varying sizes and the recognition performances are encouraging.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Can we build language-independent OCR using LSTM networks? Recognition of offline handwritten numerals using an ensemble of MLPs combined by Adaboost Word level script recognition for Uighur document mixed with English script An approach for Bangla and Devanagari video text recognition HMM-based script identification for OCR
×
引用
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