{"title":"Graph Similarity Features for HMM-Based Handwriting Recognition in Historical Documents","authors":"Andreas Fischer, Kaspar Riesen, H. Bunke","doi":"10.1109/ICFHR.2010.47","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.47","url":null,"abstract":"Automatic transcription of historical documents is vital for the creation of digital libraries. In this paper we propose graph similarity features as a novel descriptor for handwriting recognition in historical documents based on Hidden Markov Models. Using a structural graph-based representation of text images, a sequence of graph similarity features is extracted by means of dissimilarity embedding with respect to a set of character prototypes. On the medieval Parzival data set it is demonstrated that the proposed structural descriptor significantly outperforms two well-known statistical reference descriptors for single word recognition.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"544 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":"133488194","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 by Stroke-Dependent Representation Domains","authors":"D. Impedovo, G. Pirlo","doi":"10.1109/ICFHR.2010.102","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.102","url":null,"abstract":"In this paper a new system for dynamic signature verification is presented. It is based on the consideration that each region of an handwritten signature can convey personal characteristics in diverse domains. Therefore, a multi-expert approach is considered in which each stroke of the signature is evaluated in the most profitable domain of representation. The experimental results demonstrate the effectiveness of the proposed approach.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"216 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":"132360122","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 Two-Stage Scheme for the Recognition of Persian Handwritten Characters","authors":"Alireza Alaei, P. Nagabhushan, U. Pal","doi":"10.1109/ICFHR.2010.27","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.27","url":null,"abstract":"In this paper, a two-stage scheme for the recognition of Persian handwritten isolated characters is proposed. In the first stage, similar shaped characters are categorized into groups and as a result, 8 groups are obtained from 32 Persian basic characters. In the second stage, the groups containing more than one similar shape characters are considered further for the final recognition. Feature extraction is based on under sampled bitmaps technique and modified chain-code direction frequencies. For the first stage features, we compute 49-dimension features based on under sampled bitmaps from 49 non-overlapping 7×7 window-maps. 196-dimension chain-code direction frequencies from 49 overlapping 9×9 window-maps are computed and used as features for the second stage of the proposed scheme. Classifiers are one-against-other support vector machines (SVM). We evaluated our scheme on a standard dataset of Persian handwritten characters. Using 36682 samples for training, we tested our scheme on other 15338 samples and obtained 98.10% and 96.68% correct recognition rates when considered 8-class and 32-class problems, respectively.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"27 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":"134322925","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":"Leveraging the Mixed-Text Segmentation Problem to Design Secure Handwritten CAPTCHAs","authors":"A. Thomas, S. Choudhury, V. Govindaraju","doi":"10.1109/ICFHR.2010.10","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.10","url":null,"abstract":"In this paper we present a novel CAPTCHA that is based on the current hard AI problem of mixed-text (handwriting and printed-text) segmentation. The proposed CAPTCHA overlays generated handwritten word images on a generated printed-text background. We first propose a modification that allows for character level perturbations on an existing synthetic handwriting generation technique. These perturbations are parameterized allowing for varying levels of handwritten word complexity. We then use the output from the modified synthetic handwriting generator as the foreground for the mixed-text CAPTCHA. Experiments show that the proposed approach is effective at successfully distinguishing between humans and machines. Human recognition accuracy averages at 0.77 while machine accuracy is below 0.0001.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"67 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":"121869530","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 Novel Arabic Baseline Estimation Algorithm Based on Sub-Words Treatment","authors":"H. Boukerma, N. Farah","doi":"10.1109/ICFHR.2010.58","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.58","url":null,"abstract":"Baseline detection is an essential preprocessing step for many OCR systems, it has a direct effect on the efficiency and reliability of characters segmentation and features extraction stages, which contribute strongly to yielding higher recognition accuracy. For Arabic handwritten, the conventional methods which extract baseline as straight line are ill-suited because some Arabic words may be contracted from two or more sub-words (PAWs), and the distribution of these sub-words can produce different slant angles within the same word. Focused on the source of the problem, we propose a novel Arabic baseline estimation algorithm in which the PAW level is the real basic block to be processed rather than word level. Experimental results using IFN/ENIT [1] database demonstrate the efficiency of the proposed algorithm.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"63 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":"123823294","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":"Keyword Spotting from Online Chinese Handwritten Documents Using One-vs-All Trained Character Classifier","authors":"Heng Zhang, Da-Han Wang, Cheng-Lin Liu","doi":"10.1109/ICFHR.2010.49","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.49","url":null,"abstract":"This paper presents a text query-based method for keyword spotting from online Chinese handwritten documents. The similarity between a text word and handwriting is obtained by combining the character similiarity scores given by a character classifier. To overcome the ambiguity of character segmentation, multiple candidates of character patterns are generated by over-segmentation, and sequences of candidate characters are matched with the query word in beam search. The character classifier is trained by one-vs-all strategy so that it gives high similarity to the target class and low scores to the others. Particularly, we use a one-vs-all trained prototype classifier and a support vector machine (SVM) classifier for similarity scoring. The method yielded promising performance in experiments on a database containing 550 pages of 110 writers. For words of four characters, the recall, precision and F measure are 87.25%, 94.84% and 90.88%, respectively.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"20 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":"124953214","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 Signature Verification Using Flexible Grid Features and Classifier Fusion","authors":"Jacques P. Swanepoel, Johannes Coetzer","doi":"10.1109/ICFHR.2010.52","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.52","url":null,"abstract":"In this paper we present two novel off-line signature verification systems, constructed by combining an ensemble of eight base classifiers. Both score-based and decision-based fusion strategies are investigated. Each base classifier utilises the novel flexible grid-based feature extraction technique proposed in this paper. We show that the flexible grid-based approach consistently outperforms the existing rigid grid-based approach. We also show that the combined classifiers outperform the most proficient base classifier. When evaluated on Dolfing’s data set, a signature database containing 1530 genuine signatures and 3000 amateur skilled forgeries, we show that the combined classifiers presented in this paper outperform existing systems that were also evaluated on this data set.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"23 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":"125155045","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":"Semi-automatic Annotation Tool for Medieval Manuscripts","authors":"M. Baechler, Jean-Luc Bloechle, R. Ingold","doi":"10.1109/ICFHR.2010.36","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.36","url":null,"abstract":"Medieval manuscript layouts are quite complex. They contain textual elements such as insertions, annotations, and corrections. They may be richly decorated with ornaments, illustrations, and decorative initials making their layout even more complex. In this paper we describe a semi-automatic tool which annotates medieval manuscripts using our generic format. This format allows to represent the physical structure of such manuscripts. Our semi-automatic tool is composed of two parts. The first part achieves a layout analysis which automatically segments manuscripts into text blocks and text lines. That is, a Multi-Layer Perceptron (MLP) identifies layout elements by using color features, it extracts the textual content image of the manuscript. Then, a segmentation based on Connected Component (CC) is performed on the textual content in order to retrieve text blocks and lines. The second part provides an interactive interface allowing the user to customize the automatic analysis, to visualize its results, and to correct them. Our tool is still a prototype, nevertheless, first experiments give encouraging results. Thus, in this paper, we show how to generate a ground truth for medieval manuscripts layouts.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"393 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":"129195259","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":"Similar Handwritten Chinese Characters Recognition by Critical Region Selection Based on Average Symmetric Uncertainty","authors":"Bo Xu, Kaizhu Huang, Cheng-Lin Liu","doi":"10.1109/ICFHR.2010.87","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.87","url":null,"abstract":"We consider the problem of similar Chinese character recognition in this paper. Engaging the Average Symmetric Uncertainty (ASU) criterion to measure the correlation between different image regions and the class label, we manage to detect the most critical regions for each pair of similar characters. These critical regions are proved to contain more discriminative information and hence can largely benefit the classification accuracy for similar characters. We conduct a series of experiments on the CASIA Chinese character data set. Experimental results show that our proposed method is superior to three competitive approaches in terms of both accuracy and efficiency.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"132 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":"127591564","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":"Improving HMM-Based Chinese Handwriting Recognition Using Delta Features and Synthesized String Samples","authors":"Tonghua Su, Cheng-Lin Liu","doi":"10.1109/ICFHR.2010.18","DOIUrl":"https://doi.org/10.1109/ICFHR.2010.18","url":null,"abstract":"The HMM-based segmentation-free strategy for Chinese handwriting recognition has the advantage of training without annotation of character boundaries. However, the recognition performance has been limited by the small number of string samples. In this paper, we explore two techniques to improve the performance. First, Delta features are added to the static ones for alleviating the conditional independence assumption of HMMs. We then investigate into techniques for synthesizing string samples from isolated character images. We show that synthesizing linguistically natural string samples utilizes isolated samples insufficiently. Instead, we draw character samples without replacement and concatenate them into string images through between-character gaps. Our experimental results demonstrate that both Delta features and synthesized string samples significantly improve the recognition performance. Combining these with a bigram language model, the recognition accuracy has been increased by 36-38% compared to our previous system.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"20 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":"121542799","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}