{"title":"A Morphological Approach for Text-Line Segmentation in Handwritten Documents","authors":"V. Papavassiliou, V. Katsouros, G. Carayannis","doi":"10.1109/ICFHR.2010.11","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.11","url":null,"abstract":"Document image segmentation to text lines is a critical stage towards unconstrained handwritten document recognition. Although morphological operations proved to be effective in processing machine-printed documents for several issues, similar methods for unconstraint-handwritten documents lack accuracy. We propose an efficient method based on binary morphology for text-line segmentation in such documents. The basic steps of our approach are: a) sub sampling and binary rank order filtering to enhance the text-line structures and b) applying dilations and (p,q)-th generalized foreground rank openings successively to join close and horizontally overlapping regions while preventing a merge in the vertical direction. The method tested on the benchmarking dataset of the ICDAR07 handwriting segmentation contest and show remarkable results.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128389780","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":"Off-line Recognition of Hand-Written Bengali Numerals Using Morphological Features","authors":"Pulak Purkait, B. Chanda","doi":"10.1109/ICFHR.2010.63","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.63","url":null,"abstract":"This paper proposes a technique for automatic recognition of Bengali handwritten numerals using multiple feature sets. We discuss about some novel Morphological features and k-curvature feature extraction technique to recognize handwritten scripts. We use different multi-layer perceptron (MLP) classifiers to train this feature spaces and then fuse those classifiers using modified ‘Naive’-Bayes combination to increase accuracy of recognition result. The individual feature sets give reasonably high accuracy up-to 96.25%, while fused classifier gives accuracy of 97.75%.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130188692","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}
Ruben Fernandez-de-Sevilla, F. Alonso-Fernandez, Julian Fierrez, J. Ortega-Garcia
{"title":"Forensic Writer Identification Using Allographic Features","authors":"Ruben Fernandez-de-Sevilla, F. Alonso-Fernandez, Julian Fierrez, J. Ortega-Garcia","doi":"10.1109/ICFHR.2010.54","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.54","url":null,"abstract":"Questioned document examination is extensively used by forensic specialists for criminal identification. This paper presents a writer recognition system based on allographic features operating in identification mode (one-to-many). It works at the level of isolated characters, considering that each writer uses a reduced number of shapes for each one. Individual characters of a writer are manually segmented and labeled by an expert as pertaining to one of 62 alphanumeric classes (10 numbers and 52 letters, including lowercase and uppercase letters), being the particular setup used by the forensic laboratory participating in this work. A codebook of shapes is then generated by clustering and the probability distribution function of allograph usage is the discriminative feature used for recognition. Results obtained on a database of 30 writers from real forensic documents show that the character class information given by the manual analysis provides a valuable source of improvement, justifying the proposed approach. We also evaluate the selection of different alphanumeric channels, showing a dependence between the size of the hit list and the number of channels needed for optimal performance.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128448284","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":"Are Characters Objects?","authors":"Markus Diem, Robert Sablatnig","doi":"10.1109/ICFHR.2010.93","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.93","url":null,"abstract":"This paper presents a character recognition system that handles degraded manuscript documents like the ones discovered at the St. Catherine’s Monastery. In contrast to state-of-the-art OCR systems, no early decision (image binarization) needs to be performed. Thus, an object recognition methodology is adapted for the recognition of ancient manuscripts. The proposed system is based on local descriptors which are clustered in order to localize characters. Finally, a class probability histogram is assigned to each character present in an image which allows for the character classification. The system achieves an F0.5 score of 0.77 on real world data that contains 13.5% highly degraded characters.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124307781","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":"Annotation Tool and XML Representation for Online Indic Data","authors":"S. Belhe, Chetan Paulzagade, Sanket Surve, Nitesh Jawanjal, Kapil Mehrotra, Anil Motwani","doi":"10.1109/ICFHR.2010.109","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.109","url":null,"abstract":"In this paper we describe the semi-automatic annotation tool for annotating online handwritten data of Indic scripts. The annotation of handwriting data is essential to train and test the recognizers. In this paper we briefly describe the XML representation for storing online handwritten data in Indian languages. We then describe the annotation tool which essentially annotates at stroke, character and word level and exploits the uniqueness of XML standard to provide quality labels at different levels of annotation. The tool also facilitates classification of data based on quality of handwriting, age & region of writers. The annotator can verify the outputs suggested by the tool. The tool is supplemented by a utility for data segregation and accuracy calculator which aids quick performance analysis of recognizer. This tool is extensively used for annotating large amount of Hindi data and promising time saving is obtained in otherwise tedious annotation activity.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128778305","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":"Analysis of Membership Functions for Voronoi-Based Classification","authors":"S. Impedovo, R. Modugno, G. Pirlo","doi":"10.1109/ICFHR.2010.42","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.42","url":null,"abstract":"This paper addresses the problem of membership function selection for zoning-based classification. Different types of membership functions are considered based on abstract-level, ranked-level and measurement-level models and their effectiveness is estimated under different Voronoi-based zoning methods. The experimental tests, carried out in the field of hand-written numeral recognition, show that the best results are obtained when measurement-level models based on exponential models are used as membership functions.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122697655","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 Full-Text Search System for Images of Hand-Written Cursive Documents","authors":"Hajime Imura, Yuzuru Tanaka","doi":"10.1109/ICFHR.2010.105","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.105","url":null,"abstract":"We propose a full-text search technique for image-scanned documents that does not recognize individual characters. The system is as fast as a full-text search of machine-readable documents. Such a system is important when working with historical handwritten manuscripts. The proposed method works independently of differences in language and font because it uses a new pseudo-coding scheme based on the statistical features of character shapes. We evaluated our method in recall-precision curves for n-gram-based query strings in Japanese manuscripts and word-based query strings in English manuscripts using two types of image features and two different pseudo-coding schemes. Results demonstrate that the precision reached over 50% at a recall point of 80% for 3-gram queries in the Japanese manuscripts. Results also indicate that our pseudo-code is suitable for applications that use machine-learning techniques. The combination of an HMM-based filtering method and our pseudo-code can significantly improve performance in terms of retrieval precision.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127186765","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":"Simply Partitioned DP Matching and Threshold Equalizing in DWT Domain On-line Signature Verification","authors":"I. Nakanishi, Shingo Nakatani, S. Koike","doi":"10.1109/ICFHR.2010.22","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.22","url":null,"abstract":"In this paper, we introduce simply partitioned DP (dynamic programming) matching and threshold equalizing into the verification process in DWT (discrete wavelet transform) domain on-line signature verification in order to improve the performance. The simply partitioned DP matching divides both data series (verification and template data) into several partitions and calculate sub DP distance every partition. Even if mismatched pairs are caused in each partition, they are initialized at the beginning of the next partition and matching errors could be reduced. The threshold equalizing suppresses the variation range of optimal thresholds for all users (signatures), so that it prevents the verification performance from degrading by common use of single threshold for all users. In particular, we propose two equalizing methods in which the relation between the number of sampled data and optimal thresholds in signatures are approximated and adjusted by linear and nonlinear functions. In verification experiments using the signature database: SVC2004, it is confirmed that the proposed methods are effective for improving the performance.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131320379","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 New Decision Making Approach for Improving the Performance of Automatic Signature Verification Using Multi-sets of Features","authors":"M. Ammar, Toyohide Watanabe, T. Fukumura","doi":"10.1109/ICFHR.2010.56","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.56","url":null,"abstract":"So far, Automatic Signature Verification (ASV) approaches using a threshold-based decision have depended on one feature set for distance measure and a threshold on this distance measure for verification. The best performance that can be reached in this case is the one obtained by using the best feature set (bfs). In this paper, we introduce a new decision making approach for ASV that uses Multi-Sets of Features (MSF). The MSF provides higher performance than that obtainable by using the bfs, with better forgery detection. The improvement is seen to be significant because it recovers some lost effectiveness and can add it to that of the bfs. This gain in effectiveness is highly desirable when we deal with signatures of high value documents.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127900173","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}
Fouad Slimane, R. Ingold, S. Kanoun, A. Alimi, J. Hennebert
{"title":"Impact of Character Models Choice on Arabic Text Recognition Performance","authors":"Fouad Slimane, R. Ingold, S. Kanoun, A. Alimi, J. Hennebert","doi":"10.1109/ICFHR.2010.110","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.110","url":null,"abstract":"We analyze in this paper the impact of sub-models choice for automatic Arabic printed text recognition based on Hidden Markov Models (HMM). In our approach, sub-models correspond to characters shapes assembled to compose words models. One of the peculiarities of Arabic writing is to present various character shapes according to their position in the word. With 28 basic characters, there are over 120 different shapes. Ideally, there should be one sub model for each different shape. However, some shapes are less frequent than others and, as training databases are finite, the learning process leads to less reliable models for the infrequent shapes. We show in this paper that an optimal set of models has then to be found looking for the trade-off between having more models capturing the intricacies of shapes and grouping the models of similar shapes with other. We propose in this paper different sets of sub-models that have been evaluated using the Arabic Printed Text Image (APTI) Database freely available for the scientific community.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129136808","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}