{"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}
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.