{"title":"Handwriting Segmentation Contest","authors":"B. Gatos, A. Antonacopoulos, N. Stamatopoulos","doi":"10.1109/ICDAR.2007.127","DOIUrl":"https://doi.org/10.1109/ICDAR.2007.127","url":null,"abstract":"This paper presents the results of the handwriting segmentation contest that was organized in the context of ICDAR2007. The aim of this contest was to use well established evaluation practices and procedures in order to record recent advances in off-line handwriting segmentation. Two benchmarking datasets (one for text line and one for word segmentation) were used in a common evaluation platform in order to test and compare all submitted algorithms for handwritten document segmentation in realistic circumstances. The results of the evaluation of five algorithms submitted by participants as well as of two state-of-the-art algorithms are presented. The performance evaluation method is based on counting the number of matches between the text lines or words detected by the algorithms and the text line or words of the ground truth.","PeriodicalId":294655,"journal":{"name":"IEEE International Conference on Document Analysis and Recognition","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115251635","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":"New Metrics for Evaluating Performance in Document Analysis Tasks_Application to the Table Case","authors":"A. C. E. Silva","doi":"10.1109/ICDAR.2007.176","DOIUrl":"https://doi.org/10.1109/ICDAR.2007.176","url":null,"abstract":"Is an algorithm capable of high precision and recall at classifying lines as part of table really good at locating tables? Several document analysis tasks require gluing or cutting certain document elements to form others. The suitability of the commonly used precision and recall for such division/aggregation tasks is arguable, since their underlying assumption is that the granularity of the items at input is the same as at output. We propose new evaluation metrics especially suited for this type of tasks, and show their application in several table tasks. In the process we present robust table location and cell segmentation algorithms.","PeriodicalId":294655,"journal":{"name":"IEEE International Conference on Document Analysis and Recognition","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126399579","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":"Assessing and Improving the Quality of Document Images Acquired with Portable Digital Cameras","authors":"R. Lins, G. Silva, A. R. G. E. Silva","doi":"10.1109/ICDAR.2007.64","DOIUrl":"https://doi.org/10.1109/ICDAR.2007.64","url":null,"abstract":"Professionals and students of many different areas start to use portable digital cameras to take photos of documents, instead of photocopying them. This article analyses the quality of such documents for optical character recognition and proposes ways of improving their transcription and readability.","PeriodicalId":294655,"journal":{"name":"IEEE International Conference on Document Analysis and Recognition","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114907562","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":"Dynamic TimeWarping Applied to Tamil Character Recognitio","authors":"R. Niels, L. Vuurpijl","doi":"10.1109/ICDAR.2005.96","DOIUrl":"https://doi.org/10.1109/ICDAR.2005.96","url":null,"abstract":"This paper describes the use of dynamic time warping (DTW) for classifying handwritten Tamil characters. Since DTW can match characters of arbitrary length, it is particularly suited for this domain. We built a prototype based classifier that uses DTW both for generating prototypes and for calculating a list of nearest prototypes. Prototypes were automatically generated and selected. Two tests were performed to measure the performance of our classifier in a writer dependent, and in a writer independent setting. Furthermore, several strategies were developed for rejecting uncertain cases. Two different rejection variables were implemented and using a Monte Carlo simulation, the performance of the system was tested in various configurations. The results are promising and show that the classifier can be of use in both writer dependent and writer independent automatic recognition of handwritten Tamil characters.","PeriodicalId":294655,"journal":{"name":"IEEE International Conference on Document Analysis and Recognition","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123627231","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":"From Humans to Handwriting to Computer and Back","authors":"C. Suen","doi":"10.1109/ICDAR.2005.116","DOIUrl":"https://doi.org/10.1109/ICDAR.2005.116","url":null,"abstract":"Summary form only given. There has been much research on human thought processes, but little on the inference of such knowledge into the computer, for the purpose of handwriting recognition. Although modern recognition engines can recognize many handwritten symbols and cursive scripts with a high level of accuracy, they often make foolish or unreasonable mistakes. These engines often act like black boxes, which is why they make such mistakes on characters that would normally be easily recognized by human beings. To break through this level of accuracy, we have to look back and explore more human aspects, to better understand their thought processes and to discover the ways and means humans acquire recognition knowledge. After that, we can infer this knowledge to the computer to create more intelligent computational recognizers. This talk aims to share our findings with you related to the recognition of handwritten characters. It summarizes the results of several experiments we conducted in the past while attempting to understand the way humans write and recognize handwritten characters. Our investigations include handwriting education in elementary schools, handwriting models, stroke sequences, the legibility of different character shapes, left-handedness and right-handedness, the creation of databases for learning and testing, the derivation of the boundary between similar samples, and the pitfalls of current recognition algorithms and remedies. This talk concludes with highlights on the results of these studies and their applications to improve the reliability of computer recognition of handwritten characters.","PeriodicalId":294655,"journal":{"name":"IEEE International Conference on Document Analysis and Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127390700","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":"Arabic Handwriting Recognition Competition","authors":"V. Märgner, H. E. Abed","doi":"10.1109/ICDAR.2007.60","DOIUrl":"https://doi.org/10.1109/ICDAR.2007.60","url":null,"abstract":"This paper describes the Arabic handwriting recognition competition held at ICDAR 2007. This second competition (the first was at ICDAR 2005) again uses the IFN/ENIT-database with Arabic handwritten Tunisian town names. Today, more than 54 research groups from universities, research centers, and industry are working with this database worldwide. This year, 8 groups with 14 systems are participating in the competition. The systems were tested on known data and on two datasets which are unknown to the participants. The systems are compared on the most important characteristic, the recognition rate. Additionally, the relative speed of the different systems were compared. A short description of the participating groups, their systems, and the results achieved are finally presented.","PeriodicalId":294655,"journal":{"name":"IEEE International Conference on Document Analysis and Recognition","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125355067","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":"Text Locating from Natural Scene Images Using Image Intensitie","authors":"Ji Soo Kim, Sang-Cheol Park, Soohyung Kim","doi":"10.1109/ICDAR.2005.232","DOIUrl":"https://doi.org/10.1109/ICDAR.2005.232","url":null,"abstract":"In this paper, we propose three text extraction methods based on intensity information for natural scene images. The first method is composed of gray value stretching and binarization by an average intensity of the image. This method is appropriate to extract texts from complex backgrounds. The second method is a split and merge approach which is one of well-known algorithms for image segmentation. The third one is a combination of the two. Experimental results show that the proposed approaches are superior to conventional methods both in simple and complex images.","PeriodicalId":294655,"journal":{"name":"IEEE International Conference on Document Analysis and Recognition","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115618692","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":"Handwritten Numeral Recognition by means of Evolutionary Algorithms","authors":"C. Stefano, A. D. Cioppa, A. Marcelli","doi":"10.1109/ICDAR.1999.791910","DOIUrl":"https://doi.org/10.1109/ICDAR.1999.791910","url":null,"abstract":"We present a handwritten numeral recognition system centered on a novel method for extracting the set of prototypes to be used during the classification. The method is based on an evolutionary learning mechanism that exploits a genetic algorithm with niching for producing the best set of prototypes. By combining the search power of genetic algorithms and the ability of niching mechanisms to maintain different prototypes during the evolution, the proposed method allows to obtain as many prototypes as needed to model the variability exhibited by the samples belonging to each class. Such a learning mechanism overcomes the limitations of other evolutionary learning methods proposed in the literature for dealing with problems characterized by a large amount of variability in the data set as in the case of handwriting recognition. Experiments have proved that the performance of the system is comparable with, or even better than that exhibited by a neural classifier.","PeriodicalId":294655,"journal":{"name":"IEEE International Conference on Document Analysis and Recognition","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127087189","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":"Introducing New Multiple Expert Decision Combination Topologies: A Case Study using Recognition of Handwritten Characters","authors":"F. Rahman, M. Fairhurst","doi":"10.1109/ICDAR.1997.620639","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.620639","url":null,"abstract":"A new topology for classifying decision combinations of multiple experts in the framework of a multiple expert character recognition platform is introduced. It is demonstrated that many existing multiple expert configurations for character recognition can be categorised by using this method of defining classification strategies. It is also demonstrated that the design of multiple expert character recognition configurations can be streamlined by classifying these structures in terms of how the channels used for carrying information among different experts are interconnected irrespective of the algorithms used by cooperating experts and by the final decision combination expert. Case studies of actual multiple expert character recognition configurations have been investigated and it is shown how they can be categorised with respect to the decision combination topologies introduced in the paper.","PeriodicalId":294655,"journal":{"name":"IEEE International Conference on Document Analysis and Recognition","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125483823","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":"Problems and Approaches for Oriental Document Analysis","authors":"J. H. Kim","doi":"10.1109/ICDAR.1997.10004","DOIUrl":"https://doi.org/10.1109/ICDAR.1997.10004","url":null,"abstract":"Machine understanding of hand,filled documents in China, Japan and Korea requires not only general solutions of document analysis but also ability to handle peculiarities of the Oriental languages. As expected, handwritten Chinese character recognition is the major task for it. In addition, Japanese Kana, Korean Hangul, Roman alphabet as well as numerals are targets of recognition. The main difficulties of Oriental character recognition originate from their large character sets. A practical system should be able to handle at least 5000 classes from possibly 50000 over classes. For Hangul, 11720 classes can be made in theory. The difficulty closely depends on writing styles. Oriental script is generally classified into regular, fluent, cursive style. Needless to say, cursive style is deformed most seriously and, therefore, most difficult to recognize. Regular style writing is often attacked successfully by feature matching and statistical analysis, while fluent style is now actively under investigation by stroke analyses and structural matching. Cursive style recognition is seldom found even in research papers. Since Chinese and Hangul characters are intrinsically hierarchical, often hierarchical analysis has been applied. A Hangul character, which corresponds a syllable, is formed by 2 to 5 basic graphemes, drawn from 24 classes, deploying them in two dimensional way. Recognizing component graphemes is, we believe, the viable approach to handle the large set of Hangul classes. Therefore, segmentation into graphemes, which is another difficult task, is the key for hierarchical recognition For robust recognition of fluent to cursive style, the following research directions are suggested.","PeriodicalId":294655,"journal":{"name":"IEEE International Conference on Document Analysis and Recognition","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128722916","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}