2014 11th IAPR International Workshop on Document Analysis Systems最新文献

筛选
英文 中文
Forgery Detection Based on Intrinsic Document Contents 基于文档内在内容的伪造检测
2014 11th IAPR International Workshop on Document Analysis Systems Pub Date : 2014-04-07 DOI: 10.1109/DAS.2014.26
Amr Gamal Hamed Ahmed, F. Shafait
{"title":"Forgery Detection Based on Intrinsic Document Contents","authors":"Amr Gamal Hamed Ahmed, F. Shafait","doi":"10.1109/DAS.2014.26","DOIUrl":"https://doi.org/10.1109/DAS.2014.26","url":null,"abstract":"Nowadays, Document forgery detection is becoming increasingly important as forgery techniques are becoming available even to untrained users. Hence, documents that do not contain any extrinsic security features (e.g. invoices) have become easier to forge. We previously presented a method to detect manipulated documents based on distortions introduced during the forgery creation process. In this paper, several approaches are explored to improve accuracy and time taken to detect forgeries based on document distortions. The main idea behind the presented approaches is to automatically identify which parts of a document belong to the template (and hence would remain static across different documents originating from the same source) and then detect distortions in those parts only. An improvement up to 29% in accuracy of forgery detection is observed compared to our previous work. Furthermore, we also present an approximation of the original method that results in a reduction in run time of the method by several orders of magnitude, while having only a marginal reduction in its accuracy.","PeriodicalId":220495,"journal":{"name":"2014 11th IAPR International Workshop on Document Analysis Systems","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123181669","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}
引用次数: 28
Adapting Tesseract for Complex Scripts: An Example for Urdu Nastalique 为复杂的脚本改编Tesseract:以乌尔都语Nastalique为例
2014 11th IAPR International Workshop on Document Analysis Systems Pub Date : 2014-04-07 DOI: 10.1109/DAS.2014.45
Q. Akram, S. Hussain, A. Niazi, Umair Anjum, Faheem Irfan
{"title":"Adapting Tesseract for Complex Scripts: An Example for Urdu Nastalique","authors":"Q. Akram, S. Hussain, A. Niazi, Umair Anjum, Faheem Irfan","doi":"10.1109/DAS.2014.45","DOIUrl":"https://doi.org/10.1109/DAS.2014.45","url":null,"abstract":"Tesseract engine supports multilingual text recognition. However, the recognition of cursive scripts using Tesseract is a challenging task. In this paper, Tesseract engine is analyzed and modified for the recognition of Nastalique writing style for Urdu language which is a very complex and cursive writing style of Arabic script. Original Tesseract system has 65.59% and 65.84% accuracies for 14 and 16 font sizes respectively, whereas the modified system, with reduced search space, gives 97.87% and 97.71% accuracies respectively. The efficiency is also improved from an average of 170 milliseconds (ms) to an average of 84 ms for the recognition of Nastalique document images.","PeriodicalId":220495,"journal":{"name":"2014 11th IAPR International Workshop on Document Analysis Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121097162","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}
引用次数: 32
A Combined System for Text Line Extraction and Handwriting Recognition in Historical Documents 历史文献文本行提取与手写识别的组合系统
2014 11th IAPR International Workshop on Document Analysis Systems Pub Date : 2014-04-07 DOI: 10.1109/DAS.2014.51
Andreas Fischer, M. Baechler, A. Garz, M. Liwicki, R. Ingold
{"title":"A Combined System for Text Line Extraction and Handwriting Recognition in Historical Documents","authors":"Andreas Fischer, M. Baechler, A. Garz, M. Liwicki, R. Ingold","doi":"10.1109/DAS.2014.51","DOIUrl":"https://doi.org/10.1109/DAS.2014.51","url":null,"abstract":"Automated reading of historical handwriting is needed to search and browse ancient manuscripts in digital libraries based on their textual content. In this paper, we present a combined system for text localization and transcription in page images. It includes flexible learning-based methods for layout analysis and handwriting recognition, which were developed in the context of the Swiss research project HisDoc. A comprehensive experimental evaluation is provided for the medieval Parzival database, demonstrating a promising word recognition accuracy of 93.0% with closed vocabulary. In order to harmonize the evaluation of the two document analysis tasks, we introduce a novel evaluation measure for text line extraction that takes substitution, deletion, as well as insertion errors into account.","PeriodicalId":220495,"journal":{"name":"2014 11th IAPR International Workshop on Document Analysis Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125410571","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}
引用次数: 24
Word-Graph Based Handwriting Key-Word Spotting: Impact of Word-Graph Size on Performance 基于词图的手写关键词识别:词图大小对性能的影响
2014 11th IAPR International Workshop on Document Analysis Systems Pub Date : 2014-04-07 DOI: 10.1109/DAS.2014.65
A. Rossi, E. Vidal
{"title":"Word-Graph Based Handwriting Key-Word Spotting: Impact of Word-Graph Size on Performance","authors":"A. Rossi, E. Vidal","doi":"10.1109/DAS.2014.65","DOIUrl":"https://doi.org/10.1109/DAS.2014.65","url":null,"abstract":"Key-Word Spotting (KWS) in handwritten documents is approached here by means of Word Graphs (WG) obtained using segmentation-free handwritten text recognition technology based on N-gram Language Models and Hidden Markov Models. Linguistic context significantly boost KWS performance with respect to methods which ignore word contexts and/or rely on image-matching with pre-segmented isolated words. On the other hand, WG-based KWS can be significantly faster than other KWS approaches which directly work on the original images where, in general, computational demands are exceedingly high. A large WG contains most of the relevant information of the original text (line) image needed for KWS but, if it is too large, the computational advantages over traditional, image matching-based KWS become diminished. Conversely, if it is too small, relevant information may be lost, leading to degraded KWS precision/recall performance. We study the trade off between WG size and KWS information retrieval performance. Results show that small, computationally cheap WGs can be used without loosing the excellent KWS performance achieved with huge WGs.","PeriodicalId":220495,"journal":{"name":"2014 11th IAPR International Workshop on Document Analysis Systems","volume":"27 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124374128","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}
引用次数: 9
Business Forms Classification Using Earth Mover's Distance 利用推土机的距离对业务形式进行分类
2014 11th IAPR International Workshop on Document Analysis Systems Pub Date : 2014-04-07 DOI: 10.1109/DAS.2014.59
S. S. Bukhari, Markus Ebbecke, M. Gillmann
{"title":"Business Forms Classification Using Earth Mover's Distance","authors":"S. S. Bukhari, Markus Ebbecke, M. Gillmann","doi":"10.1109/DAS.2014.59","DOIUrl":"https://doi.org/10.1109/DAS.2014.59","url":null,"abstract":"Form Classification has not been focused on for the last decade. Unfortunately the algorithms published mainly in the 80s and 90s do not meet the requirements in our present commercial document analysis projects. There we are confronted with conditions and requirements unanticipated by that research, such as fax distortions and - even worse - form variations. In this work we introduce a new color-coded pixel-based form classification method using Earth Mover's Distance (EMD) that is robust against fax distortions and content variations. Experimental results prove the effectiveness of the presented method. It achieved more than 90% classification accuracy on a real-world business forms dataset, which is significantly better than the competing state-of-the-art methods.","PeriodicalId":220495,"journal":{"name":"2014 11th IAPR International Workshop on Document Analysis Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127628804","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}
引用次数: 3
Text Line Segmentation Based on Matched Filtering and Top-Down Grouping for Handwritten Documents 基于匹配过滤和自顶向下分组的手写文档文本行分割
2014 11th IAPR International Workshop on Document Analysis Systems Pub Date : 2014-04-07 DOI: 10.1109/DAS.2014.14
Youbao Tang, Xiangqian Wu, Wei Bu
{"title":"Text Line Segmentation Based on Matched Filtering and Top-Down Grouping for Handwritten Documents","authors":"Youbao Tang, Xiangqian Wu, Wei Bu","doi":"10.1109/DAS.2014.14","DOIUrl":"https://doi.org/10.1109/DAS.2014.14","url":null,"abstract":"This paper presents a novel text line segmentation method based on matched filtering and top-down grouping for handwritten documents. The proposed method consists of three distinct steps. Firstly, the foreground pixel density (FPD) of handwritten document image (HDI) is estimated, then FPD is used to decide the size of the generated filter which is the convolution of a band-shape filter and an isotropic LoG filter. Secondly, the centers of the text lines (CTLs) are extracted by performing filtering, binarizing, thinning and top-down grouping operation on HDI. Finally, the overlapping connected-components (OCCs) which travel through multiple text lines are separated, and then all OCCs are assigned to a label of CTLs by the nearest neighbor principle. The proposed method is tested on two public databases, and the experimental results show that the proposed method outperforms the state-of-the-art text line segmentation approaches in both of these databases.","PeriodicalId":220495,"journal":{"name":"2014 11th IAPR International Workshop on Document Analysis Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126817598","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}
引用次数: 7
Efficient Example-Based Super-Resolution of Single Text Images Based on Selective Patch Processing 基于选择性Patch处理的高效基于样例的单幅文本图像超分辨率
2014 11th IAPR International Workshop on Document Analysis Systems Pub Date : 2014-04-07 DOI: 10.1109/DAS.2014.25
Nibal Nayef, J. Chazalon, Petra Gomez-Krämer, J. Ogier
{"title":"Efficient Example-Based Super-Resolution of Single Text Images Based on Selective Patch Processing","authors":"Nibal Nayef, J. Chazalon, Petra Gomez-Krämer, J. Ogier","doi":"10.1109/DAS.2014.25","DOIUrl":"https://doi.org/10.1109/DAS.2014.25","url":null,"abstract":"Example-based super-resolution (SR) methods learn the correspondences between low resolution (LR) and high-resolution (HR) image patches, where the patches are extracted from a training database. To reconstruct a single LR image into a HR one, each LR image patch is processed by the previously trained model to recover its corresponding HR patch. For this reason, they are computationally inefficient. We propose the use of a selective patch processing technique to carry out the super-resolution step more efficiently, while maintaining the output quality. In this technique, only patches of high variance are processed by the costly reconstruction steps, while the rest of the patches are processed by fast bicubic interpolation. We have applied the proposed improvement on representative example-based SR methods to super-resolve text images. The results show a significant speed up for text SR without a drop in theocrat accuracy. In order to carry out an extensive and solid performance evaluation, we also present a public database of text images for training and testing example-based SR methods.","PeriodicalId":220495,"journal":{"name":"2014 11th IAPR International Workshop on Document Analysis Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125985178","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}
引用次数: 16
Text Classification via iVector Based Feature Representation 基于向量特征表示的文本分类
2014 11th IAPR International Workshop on Document Analysis Systems Pub Date : 2014-04-01 DOI: 10.1109/DAS.2014.10
Shengxin Zha, Xujun Peng, Huaigu Cao, Xiaodan Zhuang, P. Natarajan, P. Natarajan
{"title":"Text Classification via iVector Based Feature Representation","authors":"Shengxin Zha, Xujun Peng, Huaigu Cao, Xiaodan Zhuang, P. Natarajan, P. Natarajan","doi":"10.1109/DAS.2014.10","DOIUrl":"https://doi.org/10.1109/DAS.2014.10","url":null,"abstract":"In this paper, we address the problem of text classification: classifying modern machine-printed text, handwritten text and historical typewritten text from degraded noisy documents. We propose a novel text classification approach based on iVector, a newly developed concept in speaker verification. To a given text line, the iVector is a fixed-length feature vector representation, transformed from a high-dimensional super vector based on means of Gaussian mixture model (GMM), where the text dependent component is separated from a universal background model (UBM) and can be represented by a low dimensional set of factors. We classify the text lines with a discriminative classifier - support vector machine (SVM) in iVector space. A baseline approach of text classification using GMM in feature space is also presented for evaluation purpose. Experimental results on an Arabic document database show accuracy of 92.04% for text line classification using the proposed method. Furthermore, the relative word error rate (WER) of 9.6% is decreased in optical character recognition (OCR) when coupled with the proposed iVector-SVM classifier. The proposed iVector-SVM approach is language independent, thus, can be applied to other scripts as well.","PeriodicalId":220495,"journal":{"name":"2014 11th IAPR International Workshop on Document Analysis Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121247170","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}
引用次数: 4
A Cache Language Model for Whole Document Handwriting Recognition 一种全文档手写识别的缓存语言模型
2014 11th IAPR International Workshop on Document Analysis Systems Pub Date : 2014-04-01 DOI: 10.1109/DAS.2014.56
Volkmar Frinken, Dimosthenis Karatzas, Andreas Fischer
{"title":"A Cache Language Model for Whole Document Handwriting Recognition","authors":"Volkmar Frinken, Dimosthenis Karatzas, Andreas Fischer","doi":"10.1109/DAS.2014.56","DOIUrl":"https://doi.org/10.1109/DAS.2014.56","url":null,"abstract":"With increasing computational power, the trend in unconstrained text recognition is going towards whole document processing. For this task, more sophisticated language models can be employed. One approach is to take advantage the fact that the text of a document normally deals with a specific topic and hence the word occurrence probability is biased. Cache language models combine information about recent words, the cache, with a general statistical language model to increase the recognition rate. In this work we introduce a modified version of the cache language model to the task of handwriting recognition, where the N-best recognition output of the entire document is used to refine the language model for a consecutive recognition pass. An experimental evaluation on the IAM database demonstrates that the word error rate can be reduced with the proposed cache language model.","PeriodicalId":220495,"journal":{"name":"2014 11th IAPR International Workshop on Document Analysis Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130485566","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}
引用次数: 1
A System for Recognizing Online Handwritten Mathematical Expressions and Improvement of Structure Analysis 一个在线手写数学表达式识别系统及结构分析的改进
2014 11th IAPR International Workshop on Document Analysis Systems Pub Date : 2014-04-01 DOI: 10.1109/DAS.2014.52
A. D. Le, T. V. Phan, M. Nakagawa
{"title":"A System for Recognizing Online Handwritten Mathematical Expressions and Improvement of Structure Analysis","authors":"A. D. Le, T. V. Phan, M. Nakagawa","doi":"10.1109/DAS.2014.52","DOIUrl":"https://doi.org/10.1109/DAS.2014.52","url":null,"abstract":"This paper presents a system for recognizing online handwritten mathematical expressions (MEs) and improvement of structure analysis. We represent MEs in Context Free Grammars (CFGs) and employ the Cocke-Younger-Kasami (CYK) algorithm to parse 2D structure of on-line handwritten MEs and select the best interpretation in terms of symbol segmentation, recognition and structure analysis. We propose a method to learn structural relations from training patterns without any heuristic decisions by using two SVM models. We employ stroke order to reduce the complexity of the parsing algorithm. Moreover, we revise structure analysis. Even though CFG does not resolve ambiguities in some cases, our method still gives users a list of candidates that contain expecting result. We evaluate our method in the CROHME 2013 database and demonstrate the improvement of our system in recognition rate as well as processing time.","PeriodicalId":220495,"journal":{"name":"2014 11th IAPR International Workshop on Document Analysis Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127014882","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}
引用次数: 26
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学术文献互助群
群 号:604180095
Book学术官方微信