发布求助
文献互助 智能选刊 最新文献

2009 10th International Conference on Document Analysis and Recognition最新文献

筛选
英文 中文
Hierarchical On-line Arabic Handwriting Recognition 分层在线阿拉伯语手写识别
2009 10th International Conference on Document Analysis and Recognition Pub Date : 2009-07-26 DOI: 10.1109/ICDAR.2009.263
Raid Saabni, Jihad El-Sana
{"title":"Hierarchical On-line Arabic Handwriting Recognition","authors":"Raid Saabni, Jihad El-Sana","doi":"10.1109/ICDAR.2009.263","DOIUrl":"https://doi.org/10.1109/ICDAR.2009.263","url":null,"abstract":"In this paper, we present a multi-level recognizer for online Arabic handwriting. In Arabic script (handwritten and printed), cursive writing – is not a style – it is an inherent part of the script. In addition, the connection between letters is done with almost no ligatures, which complicates segmenting a word into individual letters. In this work, we have adopted the holistic approach and avoided segmenting words into individual letters. To reduce the search space, we apply a series of filters in a hierarchical manner. The earlier filters perform light processing on a large number of candidates, and the later filters perform heavy processing on a small number of candidates. In the first filter, global features and delayed strokes patterns are used to reduce candidate word-part models. In the second filter, local features are used to guide a dynamic time warping (DTW) classification. The resulting k top ranked candidates are sent for shape context based classifier, which determines the recognized word-part. In this work, we have modified the classic DTW to enable different costs for the different operations and control their behavior. We have performed several experimental tests and have received encouraging results.","PeriodicalId":433762,"journal":{"name":"2009 10th International Conference on Document Analysis and Recognition","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132164359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
Conspicuous Character Patterns 显著特征模式
2009 10th International Conference on Document Analysis and Recognition Pub Date : 2009-07-26 DOI: 10.1109/ICDAR.2009.196
S. Uchida, Ryoji Hattori, M. Iwamura, S. Omachi, K. Kise
{"title":"Conspicuous Character Patterns","authors":"S. Uchida, Ryoji Hattori, M. Iwamura, S. Omachi, K. Kise","doi":"10.1109/ICDAR.2009.196","DOIUrl":"https://doi.org/10.1109/ICDAR.2009.196","url":null,"abstract":"Detection of characters in scenery images is often a very difficult problem. Although many researchers have tackled this difficult problem and achieved a good performance, it is still difficult to suppress many false alarms and although missings. This paper investigates a conspicuous character pattern, which is a special pattern designed for easier detection. In order to have an example of the conspicuous character pattern, we select a character font with a larger distance from a non-character pattern distribution and, simultaneously, with a smaller distance from a character pattern distribution. Experimental results showed that the character font selected by this method is actually more conspicuous (i.e., detected more easily) than other fonts.","PeriodicalId":433762,"journal":{"name":"2009 10th International Conference on Document Analysis and Recognition","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122418050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Recurrent HMMs and Cursive Handwriting Recognition Graphs 反复出现的hmm和草书手写识别图
2009 10th International Conference on Document Analysis and Recognition Pub Date : 2009-07-26 DOI: 10.1109/ICDAR.2009.217
M. Schambach
{"title":"Recurrent HMMs and Cursive Handwriting Recognition Graphs","authors":"M. Schambach","doi":"10.1109/ICDAR.2009.217","DOIUrl":"https://doi.org/10.1109/ICDAR.2009.217","url":null,"abstract":"Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives ranked by confidence. Present-day applications use very large language models, leading to high computational costs and reduced accuracy. For a standard HMM-based word recognition system, a new recurrent HMM approach for very fast lexicon-free recognition will be presented. The evaluation of this model creates a \"recognition graph\", a compact representation of result alternatives of lexicon-free recognition. This structure is formally identical to results of single character segmentation and recognition. Thus it can be directly evaluated by interpretation algorithms following this process, and can even be merged with these results. In addition, the recognition graph is a basis for further evaluation in terms of word recognition. It allows fast evaluation of word hypotheses, easy integration of various language models like n-grams, and the efficient extraction of lexicon-free n-best result alternatives.","PeriodicalId":433762,"journal":{"name":"2009 10th International Conference on Document Analysis and Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129349459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Indian Multi-Script Full Pin-code String Recognition for Postal Automation 用于邮政自动化的印度多脚本全pin码字符串识别
2009 10th International Conference on Document Analysis and Recognition Pub Date : 2009-07-26 DOI: 10.1109/ICDAR.2009.171
U. Pal, Rami Kumar Roy, K. Roy, F. Kimura
{"title":"Indian Multi-Script Full Pin-code String Recognition for Postal Automation","authors":"U. Pal, Rami Kumar Roy, K. Roy, F. Kimura","doi":"10.1109/ICDAR.2009.171","DOIUrl":"https://doi.org/10.1109/ICDAR.2009.171","url":null,"abstract":"Under three-language formula, the destination address block of postal document of an Indian state is generally written in three languages: English, Hindi and the State official language. Because of inter-mixing of these scripts in postal address writings, it is very difficult to identify the script by which a pin-code is written. Also, because of the writing style of different individuals some of the digits in a pin-code string may touch with its neighboring digits. Accurate segmentation of such touching components into individual digits is a difficult task. To avoid such difficulties, in this paper we proposed a tri-lingual (English, Hindi and Bangla) 6-digit full pin-code string recognition. We obtained 99.01% reliability from our proposed system when error and rejection rates are 0.83% and 15.27%, respectively.","PeriodicalId":433762,"journal":{"name":"2009 10th International Conference on Document Analysis and Recognition","volume":"51 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115978875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 45
A New Method for Writer Identification of Handwritten Farsi Documents 波斯语手写体文献作者鉴定的新方法
2009 10th International Conference on Document Analysis and Recognition Pub Date : 2009-07-26 DOI: 10.1109/ICDAR.2009.290
F. Shahabi, M. Rahmati
{"title":"A New Method for Writer Identification of Handwritten Farsi Documents","authors":"F. Shahabi, M. Rahmati","doi":"10.1109/ICDAR.2009.290","DOIUrl":"https://doi.org/10.1109/ICDAR.2009.290","url":null,"abstract":"Most studies about writer identification are based on English documents and to our knowledge no research has been reported on Farsi or Arabic documents. In this paper, we have proposed a new method for off-line writer identification which is based on Farsi handwriting and text-independent. Based on the idea that has been presented in the previous studies, here we assume handwriting as texture image and a set of features which are based on multi-channel Gabor filters are extracted from preprocessed image of documents. Substantially, the property of proposed method is using of the bank of Gabor filters which is appropriate for structure of Farsi handwritten texts and vision system. Also, a new feature extraction method is proposed which is based on Gabor-energy and moments. For the first, we survey different methods for feature extraction from output of Gabor filters. These methods with co-occurrence matrix and Said method are implemented and experimental results on handwriting of 40 peoples demonstrate that the proposed method achieves better performance on Farsi handwritten documents.","PeriodicalId":433762,"journal":{"name":"2009 10th International Conference on Document Analysis and Recognition","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116017611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
A Generic Form Processing Approach for Large Variant Templates 大型变体模板的通用表单处理方法
2009 10th International Conference on Document Analysis and Recognition Pub Date : 2009-07-26 DOI: 10.1109/ICDAR.2009.121
Y. Navon, Ella Barkan, B. Ophir
{"title":"A Generic Form Processing Approach for Large Variant Templates","authors":"Y. Navon, Ella Barkan, B. Ophir","doi":"10.1109/ICDAR.2009.121","DOIUrl":"https://doi.org/10.1109/ICDAR.2009.121","url":null,"abstract":"In today’s world, form processing systems must be able to recognize mutant forms that appear to be based on differing templates but are actually only a variation of the original. A single definition of a representative template actually covers large varieties of the same logical templates. We developed a method and system, similar to the human visual system, which differentiates between templates via features such as logos, dominant words, and geometrical shapes, while ignoring minor details and variations. When the system finds an appropriate template, it then decodes the content of the form. Our approach has been applied in several scenarios with encouraging results.","PeriodicalId":433762,"journal":{"name":"2009 10th International Conference on Document Analysis and Recognition","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117288622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Scaling Up Whole-Book Recognition 提高整本书的认可度
2009 10th International Conference on Document Analysis and Recognition Pub Date : 2009-07-26 DOI: 10.1109/ICDAR.2009.22
Pingping Xiu, H. Baird
{"title":"Scaling Up Whole-Book Recognition","authors":"Pingping Xiu, H. Baird","doi":"10.1109/ICDAR.2009.22","DOIUrl":"https://doi.org/10.1109/ICDAR.2009.22","url":null,"abstract":"We describe the results of large-scale experiments with algorithms for unsupervised improvement of recognition of book-images using fully automatic mutual-entropy-based model adaptation. Each experiment is initialized with an imperfect iconic model derived from errorful OCR results, and a more or less perfect linguistic model, after which our fully automatic adaptation algorithm corrects the iconic model to achieve improved accuracy, guided only by evidence within the test set. Mutual-entropy scores measure disagreements between the two models and identify candidates for iconic model correction. Previously published experiments have shown that word error rates fall monotonically with passage length. Here we show similar results for character error rates extending over far longer passages up to fifty pages in length: we observed error rates were driven from 25% down to 1.9%. We present new experimental results to support the motivating principle of our strategy: that error rates and mutual-entropy scores are strongly correlated. Also, we discuss theoretical, algorithmic, and methodological challenges that we have encountered as we scale up experiments towards complete books.","PeriodicalId":433762,"journal":{"name":"2009 10th International Conference on Document Analysis and Recognition","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115211419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Rearrangement of Recognized Strokes in Online Handwritten Gurmukhi Words Recognition 在线手写体古慕克词识别中识别笔画的重新排列
2009 10th International Conference on Document Analysis and Recognition Pub Date : 2009-07-26 DOI: 10.1109/ICDAR.2009.36
A. Sharma, R. Kumar, R. Sharma
{"title":"Rearrangement of Recognized Strokes in Online Handwritten Gurmukhi Words Recognition","authors":"A. Sharma, R. Kumar, R. Sharma","doi":"10.1109/ICDAR.2009.36","DOIUrl":"https://doi.org/10.1109/ICDAR.2009.36","url":null,"abstract":"This paper presents a system to recognize online handwritten Gurmukhi words. We have proposed a new step as rearrangement of recognized strokes in online handwriting recognition procedure. The rearrangement of recognized strokes includes: strokes identification as dependent and major dependent strokes; the rearrangement of strokes with respect to their positions; the combination of strokes to recognize character. We have achieved an overall recognition rate as 81.02% in online handwritten cursive handwriting for a set of 2576 Gurmukhi dictionary words.","PeriodicalId":433762,"journal":{"name":"2009 10th International Conference on Document Analysis and Recognition","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115330943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 53
Shape Descriptor Based Document Image Indexing and Symbol Recognition 基于形状描述符的文档图像索引和符号识别
2009 10th International Conference on Document Analysis and Recognition Pub Date : 2009-07-26 DOI: 10.1109/ICDAR.2009.63
Ehtesham Hassan, S. Chaudhury, M. Gopal
{"title":"Shape Descriptor Based Document Image Indexing and Symbol Recognition","authors":"Ehtesham Hassan, S. Chaudhury, M. Gopal","doi":"10.1109/ICDAR.2009.63","DOIUrl":"https://doi.org/10.1109/ICDAR.2009.63","url":null,"abstract":"In this paper we present a novel shape descriptor based on shape context, which in combination with hierarchical distance based hashing is used for word and graphical pattern based document image indexing and retrieval. The shape descriptor represents the relative arrangement of points sampled on the boundary of the shape of object. We also demonstrate the applicability of the novel shape descriptor for classification of characters and symbols. For indexing, we provide anew formulation for distance based hierarchical locality sensitive hashing. Experiments have yielded promising results.","PeriodicalId":433762,"journal":{"name":"2009 10th International Conference on Document Analysis and Recognition","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116216715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Semi-automatic Forensic Reconstruction of Ripped-up Documents 撕碎文件的半自动法医重建
2009 10th International Conference on Document Analysis and Recognition Pub Date : 2009-07-26 DOI: 10.1109/ICDAR.2009.7
P. Smet
{"title":"Semi-automatic Forensic Reconstruction of Ripped-up Documents","authors":"P. Smet","doi":"10.1109/ICDAR.2009.7","DOIUrl":"https://doi.org/10.1109/ICDAR.2009.7","url":null,"abstract":"Manual reconstruction of ripped-up documents can be a very difficult and time-consuming task. This paper discusses a semi-automatic toolset that can be used for reconstructing ripped-up documents. First, we present a brief overview of our current fragment scanning,image segmentation and feature computation methods. Then, we discuss how fragments can be matched using their computed features. Next, we report on our global multi-fragment matching strategy and discuss the interactive components of the toolset that can be used to control and iterate through an entire reconstruction process. Finally, we illustrate the efficiency of the proposed approach with experimental results.","PeriodicalId":433762,"journal":{"name":"2009 10th International Conference on Document Analysis and Recognition","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114886891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信