International Workshop on Document Analysis Systems最新文献_第5页

The Benefits of Close-Domain Fine-Tuning for Table Detection in Document Images 近域微调对文档图像表检测的好处

International Workshop on Document Analysis Systems Pub Date : 2019-12-12 DOI: 10.1007/978-3-030-57058-3_15

Á. Casado-García, C. Domínguez, Jónathan Heras, Eloy J. Mata, Vico Pascual

引用次数: 15

Associating figures with descriptions for patent documents 将图形与专利文件的描述相关联

International Workshop on Document Analysis Systems Pub Date : 2010-06-09 DOI: 10.1145/1815330.1815380

Linlin Li, C. Tan

引用次数: 4

Document image segmentation using discriminative learning over connected components 文档图像分割使用判别学习在连接的组件

International Workshop on Document Analysis Systems Pub Date : 2010-06-09 DOI: 10.1145/1815330.1815354

S. S. Bukhari, M. A. Azawi, F. Shafait, T. Breuel

{"title":"Document image segmentation using discriminative learning over connected components","authors":"S. S. Bukhari, M. A. Azawi, F. Shafait, T. Breuel","doi":"10.1145/1815330.1815354","DOIUrl":"https://doi.org/10.1145/1815330.1815354","url":null,"abstract":"Segmentation of a document image into text and non-text regions is an important preprocessing step for a variety of document image analysis tasks, like improving OCR, document compression etc. Most of the state-of-the-art document image segmentation approaches perform segmentation using pixel-based or zone(block)-based classification. Pixel-based classification approaches are time consuming, whereas block-based methods heavily depend on the accuracy of block segmentation step. In contrast to the state-of-the-art document image segmentation approaches, our segmentation approach introduces connected component based classification, thereby not requiring a block segmentation beforehand. Here we train a self-tunable multi-layer perceptron (MLP) classifier for distinguishing between text and non-text connected components using shape and context information as a feature vector. Experimental results prove the effectiveness of our proposed algorithm. We have evaluated our method on subset of UW-III, ICDAR 2009 page segmentation competition test images and circuit diagrams datasets and compared its results with the state-of-the-art leptonica's page segmentation algorithm.","PeriodicalId":111374,"journal":{"name":"International Workshop on Document Analysis Systems","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127516760","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}

引用次数: 80

Automatic unsupervised parameter selection for character segmentation 字符分割的自动无监督参数选择

International Workshop on Document Analysis Systems Pub Date : 2010-06-09 DOI: 10.1145/1815330.1815383

G. Vamvakas, N. Stamatopoulos, B. Gatos, S. Perantonis

{"title":"Automatic unsupervised parameter selection for character segmentation","authors":"G. Vamvakas, N. Stamatopoulos, B. Gatos, S. Perantonis","doi":"10.1145/1815330.1815383","DOIUrl":"https://doi.org/10.1145/1815330.1815383","url":null,"abstract":"A major difficulty for designing a document image segmentation methodology is the proper value selection for all involved parameters. This is usually done after experimentations or after involving a training supervised phase which is a tedious process since the corresponding segmentation ground truth has to be created. In this paper, we propose a novel automatic unsupervised parameter selection methodology that can be applied to the character segmentation problem. It is based on clustering of the entities obtained as a result of the segmentation for different values of the parameters involved in the segmentation method. The clustering is performed using features extracted from the segmented entities based on zones and from the area that is formed from the projections of the upper/lower and left/right profiles. Optimization of an appropriate intra-class distance measure yields the optimal parameter vector. The method is evaluated on two segmentation algorithms, namely a recently proposed character segmentation technique based on skeleton segmentation paths, as well as the well known RLSA technique. The proposed parameter selection method is capable of finding the segmentation parameters that correspond to the optimal or near optimal segmentation result, as this is determined by counting the number of matches between the entities detected by the segmentation algorithm and the entities in the ground truth.","PeriodicalId":111374,"journal":{"name":"International Workshop on Document Analysis Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123928541","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

Improved classification through runoff elections 通过决选改进分类

International Workshop on Document Analysis Systems Pub Date : 2010-06-09 DOI: 10.1145/1815330.1815338

O. Golubitsky, S. Watt

{"title":"Improved classification through runoff elections","authors":"O. Golubitsky, S. Watt","doi":"10.1145/1815330.1815338","DOIUrl":"https://doi.org/10.1145/1815330.1815338","url":null,"abstract":"We consider the problem of dealing with irrelevant votes when a multi-case classifier is built from an ensemble of binary classifiers. We show how run-off elections can be used to limit the effects of irrelevant votes and the occasional errors of binary classifiers, improving classification accuracy. We consider as a concrete classification problem the recognition of handwritten mathematical characters. A succinct representation of handwritten symbol curves can be obtained by computing truncated Legendre-Sobolev expansions of the coordinate functions. With this representation, symbol classes are well linearly separable in low dimension which yields fast classification algorithms based on linear support vector machines. A set of 280 different symbols was considered, which gave 1635 classes when different variants are labelled separately. With this number of classes, however, the effect of irrelevant classifiers becomes significant, often causing the correct class to be ranked lower. We introduce a general technique to correct this effect by replacing the conventional majority voting scheme with a runoff election scheme. We have found that such runoff elections further cut the top-1 mis-classification rate by about half.","PeriodicalId":111374,"journal":{"name":"International Workshop on Document Analysis Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121218035","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}

引用次数: 8

Document analysis applied to fragments: feature set for the reconstruction of torn documents 应用于碎片的文档分析:用于重建撕裂文档的特征集

International Workshop on Document Analysis Systems Pub Date : 2010-06-09 DOI: 10.1145/1815330.1815381

Markus Diem, Florian Kleber, Robert Sablatnig

{"title":"Document analysis applied to fragments: feature set for the reconstruction of torn documents","authors":"Markus Diem, Florian Kleber, Robert Sablatnig","doi":"10.1145/1815330.1815381","DOIUrl":"https://doi.org/10.1145/1815330.1815381","url":null,"abstract":"Document analysis is done to analyze entire forms (e.g. intelligent form analysis, table detection) or to describe the layout/structure of a document. In this paper document analysis is applied to snippets of torn documents to calculate features that can be used for reconstruction. The main intention is to handle snippets of varying size and different contents (e.g. handwritten or printed text). Documents can either be destroyed by the intention to make the printed content unavailable (e.g. business crime) or due to time induced degeneration of ancient documents (e.g. bad storage conditions). Current reconstruction methods for manually torn documents deal with the shape, or e.g. inpainting and texture synthesis techniques. In this paper the potential of document analysis techniques of snippets to support a reconstruction algorithm by considering additional features is shown. This implies a rotational analysis, a color analysis, a line detection, a paper type analysis (checked, lined, blank) and a classification of the text (printed or hand written). Preliminary results show that these features can be determined reliably on a real dataset consisting of 690 snippets.","PeriodicalId":111374,"journal":{"name":"International Workshop on Document Analysis Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124187942","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

Table detection in heterogeneous documents 异构文档中的表检测

International Workshop on Document Analysis Systems Pub Date : 2010-06-09 DOI: 10.1145/1815330.1815339

F. Shafait, Raymond W. Smith

引用次数: 107

Touch & Write: a multi-touch table with pen-input Touch & Write:带笔输入的多点触控表

International Workshop on Document Analysis Systems Pub Date : 2010-06-09 DOI: 10.1145/1815330.1815392

M. Liwicki, Oleg Rostanin, Saher Mohamed El-Neklawy, A. Dengel

引用次数: 22

Document inspection using text-line alignment 使用文本行对齐进行文档检查

International Workshop on Document Analysis Systems Pub Date : 2010-06-09 DOI: 10.1145/1815330.1815364

J. V. Beusekom, F. Shafait, T. Breuel

{"title":"Document inspection using text-line alignment","authors":"J. V. Beusekom, F. Shafait, T. Breuel","doi":"10.1145/1815330.1815364","DOIUrl":"https://doi.org/10.1145/1815330.1815364","url":null,"abstract":"Passports, ID cards, banknotes, and degrees are considered as valuable documents that need to be secured against forgery. Apart from those, there are many other document types that are valuable, too, but that do not have any security features, as e.g. bills and vouchers. These may be used by fraudulent people to defraud money from e.g. a car insurance company. The wide availability of scanning and printing hardware allows even non-experts to easily forge a document. We therefore present a new aspect in the examination of intrinsic document features for optical document security: the goal is to automatically detect text-lines that have been manipulated or additionally inserted in a document by inspecting their alignment (left, right or center) with respect to the other text-lines in the document. This constitutes an additional feature in the goal of developing a powerful toolbox for automatic document inspection. Using the extracted text-lines, the alignment margins are extracted. Statistics on the distances of the text-lines to the alignment margins are used to identify lines that might have been forged. Such documents can then be presented to a human operator for further inspection. Due to lack of public datasets containing forged documents, a new dataset had to be created. Evaluation showed a classification accuracy of 90.5%.","PeriodicalId":111374,"journal":{"name":"International Workshop on Document Analysis Systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121996132","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}

引用次数: 12

A post-processing scheme for malayalam using statistical sub-character language models 基于统计子字符语言模型的马拉雅拉姆语后处理方案

International Workshop on Document Analysis Systems Pub Date : 2010-06-09 DOI: 10.1145/1815330.1815394

Karthika Mohan, C. V. Jawahar

{"title":"A post-processing scheme for malayalam using statistical sub-character language models","authors":"Karthika Mohan, C. V. Jawahar","doi":"10.1145/1815330.1815394","DOIUrl":"https://doi.org/10.1145/1815330.1815394","url":null,"abstract":"Most of the Indian scripts do not have any robust commercial OCRs. Many of the laboratory prototypes report reasonable results at recognition/classification stage. However, word level accuracies are still poor. It is well known that word accuracy decreases as the number of characters in a word increase. For Malayalam, the average number of characters in a word is almost twice that of English. Moreover, the number of words required to cover 80% of the Malayalam language is more than forty times that of other Indian languages such as Hindi. Hence a direct dictionary based post-processing scheme is not suitable for Malayalam.\u0000 In this paper, we propose a post-processing scheme which uses statistical language models at the sub-character level to boost word level recognition results. We use a multi-stage graph representation and formulate the recognition task as an optimization problem. Edges of the graph encode the language information and nodes represent the visual similarities. An optimal path from source node to destination node represents the recognized text. We validate our method on more than 10,000 words from a Malayalam corpus.","PeriodicalId":111374,"journal":{"name":"International Workshop on Document Analysis Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129528249","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