{"title":"Segmentation of Unconstrained Handwritten Hindi Words Using Polygonal Approximation","authors":"Kapil K. Upreti, Soumen Bag","doi":"10.1109/ICFHR.2016.0039","DOIUrl":"https://doi.org/10.1109/ICFHR.2016.0039","url":null,"abstract":"Segmentation of unconstrained handwritten words into characters in an optically scanned document image data is an essential task and presents challenges to researchers with a wide variety of handwritings, large varieties of pen-types, poor image quality, and a lack of ordering information of strokes. This paper contributes methods for accurate full segmentation of Hindi word images into constituent characters and modifiers. It follows the polygonal approximation approach for the segmentation, and makes use of structural properties along with directional measures to determine segmentation points in Hindi word images. The main methodological contribution of this paper is the use of polygonal approximation technique for word segmentation which is based on certain structural properties of Hindi language. Second focus of this work lies on the fact that segmentation is done without removal of shirorekha which eliminates the complexities present in earlier works. Experiments on real-world data show that our novel method is always competitive and results in more top performances than any of the other measures.","PeriodicalId":194844,"journal":{"name":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123222775","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":"Robust Output Modeling in Bag-of-Features HMMs for Handwriting Recognition","authors":"Leonard Rothacker, G. Fink","doi":"10.1109/ICFHR.2016.0047","DOIUrl":"https://doi.org/10.1109/ICFHR.2016.0047","url":null,"abstract":"Bag-of-Features HMMs have been successfully applied to handwriting recognition and word spotting. In this paper we extend our previous work and present methods for modeling sequences of Bag-of-Features representations with Hidden Markov Models. We will discuss our previous approach that uses a pseudo-discrete model. Afterwards, we present a novel semi-continuous integration. The method is effective for probabilistic text clustering and is suitable for statistically modeling the characteristics of Bag-of-Features representations extracted from document images. Furthermore, its statistical expectation-maximization estimation can directly be integrated in Baum-Welch HMM training. In our experiments we present competitive results on the IfN/ENIT word recognition benchmark and state-of-the-art results for word spotting on the George Washington benchmark. Our evaluation gives insights into the properties of the models from the perspectives of modern as well as historic document analysis.","PeriodicalId":194844,"journal":{"name":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125344832","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 Handwritten Chinese Character Recognition Method Combining Sub-structure Recognition","authors":"Yuanping Zhu, X. An, Kuang Zhang","doi":"10.1109/ICFHR.2016.0101","DOIUrl":"https://doi.org/10.1109/ICFHR.2016.0101","url":null,"abstract":"Many Chinese characters are composed of sub-structures. Extracting and recognizing radicals or sub-structures are benefit to character recognition. This paper proposed a new handwritten Chinese character recognition method combining sub-structure recognition. Firstly, a density-based clustering method is adopted to find sub-structure patterns in sub-structure pattern discovering. Secondly, for multiple sub-structure characters, the single Chinese character recognition problem is converted to a sub-structure string recognition problem. By searching the most matched sub-structure string pattern to a character, the additional character recognition candidates are obtained. These candidates and the single character recognition results are combined to yield the final character recognition result. Experiment results on CASIA dataset show that this work is effective on improving handwritten Chinese character recognition as well as sub-structure pattern discovering.","PeriodicalId":194844,"journal":{"name":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126310038","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":"Scribble Based Interactive Page Layout Segmentation Using Gabor Filter","authors":"M. Kassis, Jihad El-Sana","doi":"10.1109/ICFHR.2016.0016","DOIUrl":"https://doi.org/10.1109/ICFHR.2016.0016","url":null,"abstract":"This paper presents an interactive approach for fast and accurate page layout segmentation. It is a scribble-based interactive segmentation approach, where the user draws scribbles on the various regions and the system performs page layout segmentation. The user can correct and refine the resulting segmentation by drawing new scribbles. To classify the various regions of the page, we apply a bank of Gabor filters, in several orientations and multiple frequencies, to capture the orientation, the stroke width, and size of the text. These properties also implicitly encode the writing style of the document. After combining the responses of the Gabor filter into a feature matrix, we classify various regions of the document by applying graph cuts, while taking into account the user made scribbles. The presented approach is very fast, easy to use, robust to user interaction, and provides accurate results.","PeriodicalId":194844,"journal":{"name":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","volume":"89 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126319447","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 Human in the Loop Approach to Historical Handwritten Documents Transcription","authors":"Adolfo Santoro, Antonio Parziale, A. Marcelli","doi":"10.1109/ICFHR.2016.0051","DOIUrl":"https://doi.org/10.1109/ICFHR.2016.0051","url":null,"abstract":"We propose a novel approach for helping content transcription of handwritten digital documents. The approach adopts a segmentation based keyword retrieval approach that follows query-by-string paradigm and exploits the user validation of the retrieved words to improve its performance during operation. Our approach starts with an initial training set, which contains only a few pages and a tentative list of words supposedly in the document, and iteratively interleaves a word retrieval step by the system with a validation step by the user. After each iteration, the system exploits the results of the validation to update its internal model, so as to use that evidence in further iterations of the search. Experimental results on the Bentham dataset show that the system may start with a few word images and their transcripts, exhibits an improvement of the performance during operation, and after a few iterations is able to correctly transcribe more than 68% of the word of the list.","PeriodicalId":194844,"journal":{"name":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129330634","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":"Deep LSTM Networks for Online Chinese Handwriting Recognition","authors":"Li Sun, Tonghua Su, Ce Liu, Ruigang Wang","doi":"10.1109/ICFHR.2016.0059","DOIUrl":"https://doi.org/10.1109/ICFHR.2016.0059","url":null,"abstract":"Currently two heavy burdens are borne in online Chinese handwriting recognition: a large-scale training data needs to be annotated with the boundaries of each character and effective features should be handcrafted by domain experts. To relieve such issues, the paper presents a novel end-to-end recognition method based on recurrent neural networks. A mixture architecture of deep bidirectional Long Short-Term Memory (LSTM) layers and feed forward subsampling layers is used to encode the long contextual history trajectories. The Connectionist Temporal Classification (CTC) objective function makes it possible to train the model without providing alignment information between input trajectories and output strings. During decoding, a modified CTC beam search algorithm is devised to integrate the linguistic constraints wisely. Our method is evaluated both on test set and competition set of CASIA-OLHWDB 2. x. Comparing with state-of-the-art methods, over 30% relative error reductions are observed on test set in terms of both correct rate and accurate rate. Even to the more challenging competition set, better results can be achieved by our method if the out-of-vocabulary problem can be ignored.","PeriodicalId":194844,"journal":{"name":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131491701","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 Text Recognition for Bengali","authors":"Joan Andreu Sánchez, U. Pal","doi":"10.1109/ICFHR.2016.0105","DOIUrl":"https://doi.org/10.1109/ICFHR.2016.0105","url":null,"abstract":"Handwritten text recognition of Bengali is a difficult task because of complex character shapes due to the presence of modified/compound characters as well as zone-wise writing styles of different individuals. Most of the research published so far on Bengali handwriting recognition deals with either isolated character recognition or isolated word recognition, and just a few papers have researched on recognition of continuous handwritten Bengali. In this paper we present a research on continuous handwritten Bengali. We follow a classical line-based recognition approach with a system based on hidden Markov models and n-gram language models. These models are trained with automatic methods from annotated data. We research both on the maximum likelihood approach and the minimum error phone approach for training the optical models. We also research on the use of word-based language models and character-based language models. This last approach allow us to deal with the out-of-vocabulary word problem in the test when the training set is of limited size. From the experiments we obtained encouraging results.","PeriodicalId":194844,"journal":{"name":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123786886","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":"DNN-HMM for Large Vocabulary Mongolian Offline Handwriting Recognition","authors":"Fan Daoerji, Gao Guang-lai","doi":"10.1109/ICFHR.2016.0026","DOIUrl":"https://doi.org/10.1109/ICFHR.2016.0026","url":null,"abstract":"In this paper, we propose a large vocabulary Mongolian offline handwriting recognition system, using hidden Markov models (HMMs)-deep neural networks (DNN) hybrid architectures which shows superior performance on auto speech recognize (ASR) tasks. We select 50 sub-characters from all shape of Mongolian letters as the smallest modeling unit. First, a set of intensity features are extracted from each of the segmented word, which is based on a sliding window moving across each word image. Then, Multiple contextdependent Gaussian mixture model (GMM)-HMMs are trained by the features. At last a DNN which have 4 hidden layers are trained as a frame classifier, where the class labels are state labels assigned to each input frame through forced alignment using the context-dependent model. In order to validate the proposed model, extensive experiments were carried out using the MHW database which contains 100,000 handwritten words in training set, 5,000 in test set I and 14,085 in Test set II. The DNN-HMM w hich is trained on raw image pixels yields best performance on Test set I with an accuracy of 97.61% and on Test set II with an accuracy of 94.14%.","PeriodicalId":194844,"journal":{"name":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","volume":"384 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122438514","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":"Writer Code Based Adaptation of Deep Neural Network for Offline Handwritten Chinese Text Recognition","authors":"Zirui Wang, Jun Du","doi":"10.1109/ICFHR.2016.0106","DOIUrl":"https://doi.org/10.1109/ICFHR.2016.0106","url":null,"abstract":"Recently, we propose deep neural network based hidden Markov models (DNN-HMMs) for offline handwritten Chinese text recognition. In this study, we design a novel writer code based adaptation on top of the DNN-HMM to further improve the accuracy via a customized recognizer. The writer adaptation is implemented by incorporating the new layers with the original input or hidden layers of the writer-independent DNN. These new layers are driven by the so-called writer code, which guides and adapts the DNN-based recognizer with the writer information. In the training stage, the writer-aware layers are jointly learned with the conventional DNN layers in an alternative manner. In the recognition stage, with the initial recognition results from the first-pass decoding with the writer-independent DNN, an unsupervised adaptation is performed to generate the writer code via the cross-entropy criterion for the subsequent second-pass decoding. The experiments on the most challenging task of ICDAR 2013 Chinese handwriting competition show that our proposed adaptation approach can achieve consistent and significant improvements of recognition accuracy over a highperformance writer-independent DNN-HMM based recognizer across all 60 writers, yielding a relative character error rate reduction of 23.62% in average.","PeriodicalId":194844,"journal":{"name":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128344058","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-incremental Recognition of Online Handwritten Mathematical Expressions","authors":"K. Phan, A. D. Le, M. Nakagawa","doi":"10.1109/ICFHR.2016.0057","DOIUrl":"https://doi.org/10.1109/ICFHR.2016.0057","url":null,"abstract":"This paper presents a semi-incremental recognition method for online handwritten mathematical expressions (MEs). The method reduces the waiting time after an ME is written until the result of recognition is output. Our method has two main processes, one is to process the latest stroke, the other is to find and correct wrong recognitions in the strokes up to the latest stroke. In the first process, the segmentation, recognition and Cocke-Younger-Kasami (CYK) algorithm are only executed for the latest stroke. In the second process, all the previous segmentations are updated if they are significantly changed after the latest stroke is input, and then, all the symbols related to the updated segmentations will be updated with their recognition scores. These changes are reflected into the CYK table. In addition, the waiting time is further reduced by employing multi-thread processes. Experiments on our data set show the effectiveness of this semi-incremental method which not only has higher recognition rate than our previous pure-incremental method but also keeps the waiting time unnoticeable.","PeriodicalId":194844,"journal":{"name":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133009103","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}