印度银行支票法定金额的文字识别

R. Jayadevan, U. Pal, F. Kimura
{"title":"印度银行支票法定金额的文字识别","authors":"R. Jayadevan, U. Pal, F. Kimura","doi":"10.1109/ICFHR.2010.33","DOIUrl":null,"url":null,"abstract":"Legal amount of Indian bank cheques contains 36 different words. Most of the Indian cheques in cities are written in English although some of them are written in Hindi and other state languages. As the legal amount words written in English can be case sensitive, the size of the lexicon for legal word recognition can go up to 108 (3´36). In this paper a lexicon driven segmentation-recognition scheme is proposed for the recognition of legal amount words from Indian bank cheques written in English. A water reservoir concept is used to pre-segment the words into primitive components and the primitive components of a word are then merged into possible characters to get the best word using the lexicon of 36 different legal words of bank cheque. To merge these primitive components into characters and to get optimum character segmentation, dynamic programming is employed using total likelihood of the characters of a word as an objective function. To calculate the likelihood of a character, Modified Quadratic Discriminant Function (MQDF) is used. The features used in the MQDF are mainly based on directional features of the contour points of the components. In the paper it is assumed that the words are already extracted from the cheque image for recognition. A database consisting of 5400 words, collected from 50 writers has been used for testing the system and an accuracy of 97.04% was observed.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Recognition of Words from Legal Amounts of Indian Bank Cheques\",\"authors\":\"R. Jayadevan, U. Pal, F. Kimura\",\"doi\":\"10.1109/ICFHR.2010.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Legal amount of Indian bank cheques contains 36 different words. Most of the Indian cheques in cities are written in English although some of them are written in Hindi and other state languages. As the legal amount words written in English can be case sensitive, the size of the lexicon for legal word recognition can go up to 108 (3´36). In this paper a lexicon driven segmentation-recognition scheme is proposed for the recognition of legal amount words from Indian bank cheques written in English. A water reservoir concept is used to pre-segment the words into primitive components and the primitive components of a word are then merged into possible characters to get the best word using the lexicon of 36 different legal words of bank cheque. To merge these primitive components into characters and to get optimum character segmentation, dynamic programming is employed using total likelihood of the characters of a word as an objective function. To calculate the likelihood of a character, Modified Quadratic Discriminant Function (MQDF) is used. The features used in the MQDF are mainly based on directional features of the contour points of the components. In the paper it is assumed that the words are already extracted from the cheque image for recognition. A database consisting of 5400 words, collected from 50 writers has been used for testing the system and an accuracy of 97.04% was observed.\",\"PeriodicalId\":335044,\"journal\":{\"name\":\"2010 12th International Conference on Frontiers in Handwriting Recognition\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 12th International Conference on Frontiers in Handwriting Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICFHR.2010.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 12th International Conference on Frontiers in Handwriting Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFHR.2010.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

印度银行支票的法定金额包含36个不同的单词。城市里的大多数印度支票都是用英语写的,尽管其中一些是用印地语和其他邦语写的。由于用英语书写的法定金额词可以区分大小写,因此用于法定金额词识别的词典的大小可以达到108(3´36)。本文提出了一种词典驱动的分词识别方法,用于识别英文印度银行支票中的法定金额词。利用水库概念将单词预先分割成原始成分,然后将单词的原始成分合并成可能的字符,利用银行支票的36个不同法律单词的词典得到最佳单词。为了将这些原语成分合并成字符并获得最优的字符分割,采用了以单词字符的总似然为目标函数的动态规划方法。为了计算一个字符的可能性,使用了修正二次判别函数(MQDF)。MQDF中使用的特征主要基于组件轮廓点的方向特征。在本文中,假设单词已经从支票图像中提取出来进行识别。采用50位作者5400个单词的数据库对系统进行了测试,准确率达到97.04%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Recognition of Words from Legal Amounts of Indian Bank Cheques
Legal amount of Indian bank cheques contains 36 different words. Most of the Indian cheques in cities are written in English although some of them are written in Hindi and other state languages. As the legal amount words written in English can be case sensitive, the size of the lexicon for legal word recognition can go up to 108 (3´36). In this paper a lexicon driven segmentation-recognition scheme is proposed for the recognition of legal amount words from Indian bank cheques written in English. A water reservoir concept is used to pre-segment the words into primitive components and the primitive components of a word are then merged into possible characters to get the best word using the lexicon of 36 different legal words of bank cheque. To merge these primitive components into characters and to get optimum character segmentation, dynamic programming is employed using total likelihood of the characters of a word as an objective function. To calculate the likelihood of a character, Modified Quadratic Discriminant Function (MQDF) is used. The features used in the MQDF are mainly based on directional features of the contour points of the components. In the paper it is assumed that the words are already extracted from the cheque image for recognition. A database consisting of 5400 words, collected from 50 writers has been used for testing the system and an accuracy of 97.04% was observed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信