{"title":"Layout and language: exploring text block discovery in tables using linguistic resources","authors":"Matthew F. Hurst","doi":"10.1109/ICDAR.2001.953844","DOIUrl":"https://doi.org/10.1109/ICDAR.2001.953844","url":null,"abstract":"Identifying the textual content of table cells requires, in part, the successful resolution of ambiguities confusing multi-row cells and single-row cells, as well as the resolution of other layout based ambiguities. This paper investigates the application of linguistic resources to this problem and discusses algorithms that exploit both phrasal dictionaries and bigram language models for discovering the content of cells in flat text files.","PeriodicalId":277816,"journal":{"name":"Proceedings of Sixth International Conference on Document Analysis and Recognition","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133047640","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}
{"title":"Document image matching and annotation lifting","authors":"Ming Ye, M. Bern, David Goldberg","doi":"10.1109/ICDAR.2001.953890","DOIUrl":"https://doi.org/10.1109/ICDAR.2001.953890","url":null,"abstract":"Two images of the same document could differ significantly due to faxing, scanner distortions, or degradation through multigeneration copying. Additionally, one of the images may have extensive annotations not present in the other. We give a method for registering two such images and separating out annotations. We further present an algorithm for detecting and repairing broken strokes in the annotations. Our methods have been tested on a wide variety of documents with reliable results; for the special case of form dropout our results are better than had been obtained previously with special-purpose algorithms.","PeriodicalId":277816,"journal":{"name":"Proceedings of Sixth International Conference on Document Analysis and Recognition","volume":"386 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132530593","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}
Sungsoo Yoon, Yillbyung Lee, Gyeonghwan Kim, Yeongwoo Choi
{"title":"New paradigm for segmentation and recognition of handwritten numeral string","authors":"Sungsoo Yoon, Yillbyung Lee, Gyeonghwan Kim, Yeongwoo Choi","doi":"10.1109/ICDAR.2001.953784","DOIUrl":"https://doi.org/10.1109/ICDAR.2001.953784","url":null,"abstract":"String recognition is rather paradoxical problem because it requires the segmentation of the string into understandable units, but proper segmentation needs a-priori knowledge of the units and this implies a recognition capability. To solve this dilemma therefore, both a-priori knowledge of meaningful units and a segmentation method have to be used together, and they should dynamically interact with each other. In other words, the results of segmentation are used as fundamental information to suppose what is most likely to be, and then its a-priori knowledge is used to help the segmentation. This model makes explicit segmentation unnecessary because it does not speculate on possible break positions. It is also possible to recognize a digit even if it contains strokes that do not belong to to it. Using this paradigm for 100 handwritten numeral strings belonging to the NIST database has resulted in 95% recognition.","PeriodicalId":277816,"journal":{"name":"Proceedings of Sixth International Conference on Document Analysis and Recognition","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133265301","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}
{"title":"On-line signature verification using model-guided segmentation and discriminative feature selection for skilled forgeries","authors":"Taik-Heon Rhee, Sung-Jung Cho, Jinho Kim","doi":"10.1109/ICDAR.2001.953869","DOIUrl":"https://doi.org/10.1109/ICDAR.2001.953869","url":null,"abstract":"The paper describes an online signature verification system using model-guided segmentation and discriminative feature selection for skilled forgeries. The system is based on segment-to-segment comparison between the input signature and the reference model. To obtain a consistent segmentation, we propose a model-guided segmentation, which segments an input signature by the correspondence with the reference model. To reject skilled forgeries effectively, we use a discriminative feature selection. It is motivated from the observation that a skilled forger can imitate the shape of the genuine signature better than even the owner, that is some features distinguish skilled forgeries from genuine signatures, though some features distinguish only random forgeries. For random forgeries and skilled forgeries respectively, we select the discriminative features among all the features according to the distance between references and forgeries. In the experiment, we collected 1000 genuine signatures and 1000 skilled forgeries. The result showed that the proposed method gave more stable segmentation, and the discriminative feature selection eliminated about 62% of the errors.","PeriodicalId":277816,"journal":{"name":"Proceedings of Sixth International Conference on Document Analysis and Recognition","volume":"754 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132682180","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}
{"title":"Accuracy improvement of handwritten numeral recognition by mirror image learning","authors":"T. Wakabayashi, Meng Shi, W. Ohyama, F. Kimura","doi":"10.1109/ICDAR.2001.953810","DOIUrl":"https://doi.org/10.1109/ICDAR.2001.953810","url":null,"abstract":"This paper proposes a new corrective learning algorithm and evaluates the performance by a handwritten numeral recognition test. The algorithm generates a mirror image of a pattern that belongs to one class of a pair of confusing classes and utilizes it as a learning pattern of the other class. This paper also studies how to extract confusing patterns within a certain margin of a decision boundary to generate enough mirror images, and how to perform an effective mirror image compensation to increase the margin. Recognition accuracies of the minimum distance classifier and the projection distance method were improved from 93.17% to 98.38% and from 99.11% to 99.41% respectively in the recognition test for handwritten numeral database IPTP CD-ROM1.","PeriodicalId":277816,"journal":{"name":"Proceedings of Sixth International Conference on Document Analysis and Recognition","volume":"52 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114009100","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}
{"title":"A ruled-line extraction method for digital camera images","authors":"K. Fujimoto, Atsuko Ohara, S. Naoi","doi":"10.1109/ICDAR.2001.953802","DOIUrl":"https://doi.org/10.1109/ICDAR.2001.953802","url":null,"abstract":"We propose a high-accuracy ruled-line extraction method for digital camera images containing shadows. The conventional method that uses adaptive binarization has a problem in that light line segments become blurred due to the adverse effect of the adaptive binarization process. Then, we propose an accurate method which uses an intentionally collapsing binary image as a clue and exploits the linearity and gray level stability of each line segment. By the experiment, we demonstrated the effectiveness of the proposed method, which reduced the extraction error by half.","PeriodicalId":277816,"journal":{"name":"Proceedings of Sixth International Conference on Document Analysis and Recognition","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131879593","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}
{"title":"Cadastre map assembling: a puzzle game resolution","authors":"Jean-Marc Viglino, L. Guigues","doi":"10.1109/ICDAR.2001.953979","DOIUrl":"https://doi.org/10.1109/ICDAR.2001.953979","url":null,"abstract":"The French cadastral map consists of over 500,000 map sheets that cover the whole territory. The raster digitisation of these paper maps is in progress. In order to exploit them, we have to assemble and geo-reference the set of maps to make them superimposable on other geographic information in a GIS. The problem can be seen as a complex jigsaw puzzle where the pieces are the cadastre sections extracted from the maps. In this paper, we present an automatic solution to this geographic jigsaw puzzle, based on a non-combinatorial optimisation method that maximises the \"sticking\" between every piece and its neighbours. The first step is to extract image features from the documents. Then we compute the sticking relationships between each pair of pieces. The puzzle resolution itself is based on an L1 norm optimisation. A method to detect process faults is discussed. The final goal of the process is to integrate every piece of the puzzle (i.e. the cadastre maps) into a national geographic reference frame and database.","PeriodicalId":277816,"journal":{"name":"Proceedings of Sixth International Conference on Document Analysis and Recognition","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128537628","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}
M. Morita, R. Sabourin, M. El-Yacoubi, Flávio Bortolozzi, C. Suen
{"title":"Handwritten month word recognition on Brazilian bank cheques","authors":"M. Morita, R. Sabourin, M. El-Yacoubi, Flávio Bortolozzi, C. Suen","doi":"10.1109/ICDAR.2001.953930","DOIUrl":"https://doi.org/10.1109/ICDAR.2001.953930","url":null,"abstract":"This paper describes an off-line system under development to process unconstrained handwritten dates on Brazilian bank cheques in an omni-writer context. We show here some improvements on our previous work on isolated month word recognition using hidden Markov models (HMM). After preprocessing, a word image is explicitly segmented into characters or pseudo-characters and represented by two feature sequences of equal length, which are combined using HMM. The word models are generated from the concatenation of appropriate character models. In addition to the small date database, we also make use of the legal amount database to increase the frequency of characters in the training and the validation sets. Although this study deals with a limited lexicon, the many similarities among the word classes can affect the performance of the recognition. Experiments show an increase in the average recognition rate from 84% to 91%. Finally, we present our perspectives of future work.","PeriodicalId":277816,"journal":{"name":"Proceedings of Sixth International Conference on Document Analysis and Recognition","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134220648","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}
{"title":"Performance evaluation of a robust method for mathematical expression recognition","authors":"Masayuki Okamoto, Hiroki Imai, K. Takagi","doi":"10.1109/ICDAR.2001.953767","DOIUrl":"https://doi.org/10.1109/ICDAR.2001.953767","url":null,"abstract":"We proposed two methods for mathematical expression recognition. One is based on projection profile cutting and the other uses top-down and bottom-up strategies to analyze the two-dimensional structure of expressions. The paper describes the improvement of the latter method in terms of structural analysis robustness and application to matrix recognition. To evaluate the performance of our method, intensive experiments were carried out on a large variety of mathematical expression images which were collected from many mathematical journals.","PeriodicalId":277816,"journal":{"name":"Proceedings of Sixth International Conference on Document Analysis and Recognition","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134645391","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}
{"title":"Use of colour in form layout analysis","authors":"W. Wong, N. Sherkat, Tony Allen","doi":"10.1109/ICDAR.2001.953924","DOIUrl":"https://doi.org/10.1109/ICDAR.2001.953924","url":null,"abstract":"Colour has long been viewed as one of the unnecessary features in any form processing system, due not only to the large storage requirement and computational cost its inclusion imposes but also to the complexities of hue, chroma and brightness variation. However, as technology has advanced and computing costs have reduced, the processing of documents in colour has now become practical. This paper describes a prototype form extraction system that utilises colour information to help facilitate data extraction from a form. Blank forms are first automatically analysed to obtain their layout, colour and statistical information. The filled data is then extracted from the filled forms using techniques based upon the colour characteristic changes that have occurred with respect to the blank form. The improved performance of the proposed method has been verified by comparing the processing time, data extraction precision and recall rate of the proposed system to that of an archetypal black and white form extraction system.","PeriodicalId":277816,"journal":{"name":"Proceedings of Sixth International Conference on Document Analysis and Recognition","volume":"335 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133121212","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}