一种改进的脱机手写汉字四角特征粗分类方法

将粗分类应用于脱机手写汉字识别中,采用这种多层次分类策略,能有效地改善识别的性能,提高识别精度。本文提出了一种利用四角区域结构特征对手写汉字进行粗分类的方法。在对汉字基本笔画进行分析的基础之上,根据手写汉字形变的特点以及识别算法的要求,定义一组新的笔画单元,并将这些笔画单元与汉字特定区域内的结构进行比对,得到一组4位结构特征编码,以此作为脱机手写汉字粗分类的依据。对GB2312一级字库中的部分手写汉字进行采样和识别实验,结果证明改进的四角结构特征用于粗分类的有效性。     

Recognition of Bangla compound characters using structural decomposition

In this paper we propose a novel character recognition method for Bangla compound characters. Accurate recognition of compound characters is a difficult problem due to their complex shapes. Our strategy is to decompose a compound character into skeletal segments. The compound character is then recognized by extracting the convex shape primitives and using a template matching scheme. The novelty of our approach lies in the formulation of appropriate rules of character decomposition for segmenting the character skeleton into stroke segments and then grouping them for extraction of meaningful shape components. Our technique is applicable to both printed and handwritten characters. The proposed method performs well for complex-shaped compound characters, which were confusing to the existing methods.     

A robust statistical set of features for Amazigh handwritten characters

The main problem in the handwritten character recognition systems (HCR) is to describe each character by a set of features that can distinguish it from the other characters. Thus, in this paper, we propose a robust set of features extracted from isolated Amazigh characters based on decomposing the character image into zones and calculate the density and the total length of the histogram projection in each zone. In the experimental evaluation, we test the proposed set of features, to show its performance, with different classification algorithms on a large database of handwritten Amazigh characters. The obtained results give recognition rates that reach 99.03% which we presume good and satisfactory compared to other approaches and show that our proposed set of features is useful to describe the Amazigh characters.     

Learning Sparse Feature Representations Using Probabilistic Quadtrees and Deep Belief Nets

Learning sparse feature representations is a useful instrument for solving an unsupervised learning problem. In this paper, we present three labeled handwritten digit datasets, collectively called n-MNIST by adding noise to the MNIST dataset, and three labeled datasets formed by adding noise to the offline Bangla numeral database. Then we propose a novel framework for the classification of handwritten digits that learns sparse representations using probabilistic quadtrees and Deep Belief Nets. On the MNIST, n-MNIST and noisy Bangla datasets, our framework shows promising results and outperforms traditional Deep Belief Networks.     

Handwritten Chinese character recognition using fuzzy image alignment

The task of handwritten Chinese character recognition is one of the most challenging areas of human handwriting classification. The main reason for this is related to the writing system itself which encompasses thousands of characters, coupled with high levels of diversity in personal writing styles and attributes. Much of the existing work for both online and off-line handwritten Chinese character recognition has focused on methods which employ feature extraction and segmentation steps. The preprocessed data from these steps form the basis for the subsequent classification and recognition phases. This paper proposes an approach for handwritten Chinese character recognition and classification using only an image alignment technique and does not require the aforementioned steps. Rather than extracting features from the image, which often means building models from very large training data, the proposed method instead uses the mean image transformations as a basis for model building. The use of an image-only model means that no subjective tuning of the feature extraction is required. In addition by employing a fuzzy-entropy-based metric, the work also entails improved ability to model different types of uncertainty. The classifier is a simple distance-based nearest neighbour classification system based on template matching. The approach is applied to a publicly available real-world database of handwritten Chinese characters and demonstrates that it can achieve high classification accuracy and is robust in the presence of noise.     

基于神经网络和模糊匹配算法的手写汉字预分类研究

对手写汉字识别问题,提出了一种在识别之前对手写汉字预分类的新方法,该方法用Neocognitron网提取字符笔画特征,然后采用有监督的扩展ART神经网络（SEART）产生一定数量的预分类组并通过基于模糊相似测量的匹配算法进行预分类。实验表明,该方法用于手写汉字分类效果良好,预分类正确率达到98.22％。     

SVM-based hierarchical architectures for handwritten Bangla character recognition

We propose support vector machine (SVM) based hierarchical classification schemes for recognition of handwritten Bangla characters. A comparative study is made among multilayer perceptron, radial basis function network and SVM classifier for this 45 class recognition problem. SVM classifier is found to outperform the other classifiers. A fusion scheme using the three classifiers is proposed which is marginally better than SVM classifier. It is observed that there are groups of characters having similar shapes. These groups are determined in two different ways on the basis of the confusion matrix obtained from SVM classifier. In the former, the groups are disjoint while they are overlapped in the latter. Another grouping scheme is proposed based on the confusion matrix obtained from neural gas algorithm. Groups are disjoint here. Three different two-stage hierarchical learning architectures (HLAs) are proposed using the three grouping schemes. An unknown character image is classified into a group in the first stage. The second stage recognizes the class within this group. Performances of the HLA schemes are found to be better than single stage classification schemes. The HLA scheme with overlapped groups outperforms the other two HLA schemes.     

Off-line Bangla handwritten word recognition: a holistic approach

Neural Computing and Applications - Due to the cursive nature, segmentation of handwritten Bangla words into characters and also recognition of the same sometimes become a very challenging problem...     

基于主曲线算法的手写字符特征分析与提取

模式特征的提取与选择是提高手写体字符识别率的关键因素。主曲线是主成分分析的非线性推广,它是通过数据分布“中间”并满足“自相合”的光滑曲线,能够很好地描述数据分布的结构特征。利用软K段主曲线算法提取训练数据的特征,在分析手写体字符结构特点的基础上,选出手写体字符识别所使用的粗分类与细分类特征,利用这些分类特征对手写字符进行识别。该方法在CEDAR手写体数字和字符数据库上的实验表明：选取的分类特征能够有效区分相似的手写体字符,提高手写字符的识别率,为脱机手写字符识别研究提供了一种新的方法。     

Semi-supervised learning for character recognition in historical archive documents

Training recognizers for handwritten characters is still a very time consuming task involving tremendous amounts of manual annotations by experts. In this paper we present semi-supervised labeling strategies that are able to considerably reduce the human effort. We propose two different methods to label and later recognize characters in collections of historical archive documents. The first one is based on clustering of different feature representations and the second one incorporates a simultaneous retrieval on different representations. Hence, both approaches are based on multi-view learning and later apply a voting procedure for reliably propagating annotations to unlabeled data. We evaluate our methods on the MNIST database of handwritten digits and introduce a realistic application in form of a database of handwritten historical weather reports. The experiments show that our method is able to significantly reduce the human effort that is required to build a character recognizer for the data collection considered while still achieving recognition rates that are close to a supervised classification experiment.