一种多分类器集成的手写体汉字识别方法

多分类器集成是手写体汉字识别领域的新方向。本文提出的多分类器集成方法通过改进的欧氏距离分类器将待识别汉字分类到某个粗分结果集中,然后根据粗分结果集选择1-N(one-against-rest)的SVM分类器对待识别汉字进行细分,最后用贝叶斯集成两级分类器。实验对国标一级汉字中的1034个手写汉字进行识别,证明了方案的有效性。     

一种手写体汉字识别的神经网络多分类器集成方案

提出了一种基于单字单网的手写体汉字识别纯神经网络的多分类器集成方案,并通过实验证明用该方案实现的神经网络集成系统性能均比任一个神经网络单分类器都好,对1 000种不同的手写体汉字的1 000×10个字进行测试,集成后的识别率最高达到95.22%,比单分类器的识别率高出5.0%-8.7%。     

一种用于手写体汉字识别的候选字加权多分类器集成方法

提出了一种基于候选字加权的多分类器集成方法,并将其应用于手写体汉字的识别研究中。利用４种不同的特征提取方法构造了４个独立的分类器;利用不同分类器各候选字加权处理得到的置信度函数来构造集成函数,从而将４个独立的分类器集成为一个多分类器系统。通过实验分析了几种分类器集成的方法,验证了具有一定互补性的多分类器集成对手写体汉字的识别率有较大的提高。实验结果表明、所提出的方法是行之有效的。     

一种用于手写体汉字识别的侯选字加权多分类器集成方法

提出了一种基于候选字加权的多分类器集成方法,并将其应用于手写体汉字的识别研究中。利用4种不同的特征提取方法构造了4个独立的分类器,利用不同分类器各候选字加权处理得到的置信度函数来构成集成函数,从而将4个独立的分类器集成为一个多分类器系统。通过实验分析了几种分类器集成的方法,验证了具有一定互补性的多分类器集成对手写体汉字的识别率有较大的提高。实验结果表明,所提出的方法是行之有效的。     

脱机手写汉字识别研究

脱机手写体汉字识别是当前OCR技术研究的热点之一.本文提出了一种用于手写体汉字识别的多特征多分类器集成的系统模型,并利用Matlab工具箱对50个汉字5000个样本进行了初步仿真实验,实验表明该模型是十分可行和有效的.     

一个联机识别自然手写汉字的多分类器集成系统

本文提出一种联机识别自然手写体汉字的多分类器集成模型。该模型中,我们把依照01、WB和SO特征码设计的不同分类器进行集成,综合模式多种全局和局部特征,从汉字的多个结构层进行识别。初步实验结果为,识别率98.6%。     

一种简单有效的多分类器综合方法

针对小字符集脱机手写体汉字识别中的多分类器集成问题，提出了一种简单有效的综合方法，实验表明综合后系统的识别率明显高于单个分类器的识别率。     

手写体字符识别的多特征多分类器设计

特征选取和分类器设计是字符识别系统设计的关键。文章针对手写体汉字和阿拉伯数字混和字符集的识别提出了依据不同的分类要求,分别选取不同的字符特征并采用神经网络多分类器进行识别的设计方法。实验结果表明,该方法用于手写体混合字符集的识别是行之有效的。     

基于手写体汉字的成绩单自动识别系统

本文针对基于手写体汉字的成绩单自动识别系统的实际需要,基于目前脱机手写体汉字识别技术的一些研究成果,提出一种新的基于聚类方法和多个分类器的线性集成的综合方法,并且采用分级判决策略,进上步降低误识率,实验结果表明,本系统具有较高的识别率和较低的误识率,并且具有较好的扩展性,具有实用的可行性。     

SVM多值分类器在脱机手写体相似汉字识别中的应用

相似字的普遍存在是影响脱机手写体汉字识别率低的主要原因之一。论文研究了支持向量机(SVM)多值分类器在手写相似汉字识别中的应用,所提出的方法采用了小波弹性网格技术提取汉字的特征,通过实验比较了三种不同的SVM分类器组合策略的分类效果。     

深度学习在手写汉字识别中的应用综述

手写汉字识别（Handwritten Chinese character recognition,HCCR）是模式识别的一个重要研究领域,最近几十年来得到了广泛的研究与关注,随着深度学习新技术的出现,近年来基于深度学习的手写汉字识别在方法和性能上得到了突破性的进展.本文综述了深度学习在手写汉字识别领域的研究进展及具体应用.首先介绍了手写汉字识别的研究背景与现状.其次简要概述了深度学习的几种典型结构模型并介绍了一些主流的开源工具,在此基础上详细综述了基于深度学习的联机和脱机手写汉字识别的方法,阐述了相关方法的原理、技术细节、性能指标等现状情况,最后进行了分析与总结,指出了手写汉字识别领域仍需要解决的问题及未来的研究方向.     

Markov random field-based statistical character structure modeling for handwritten Chinese character recognition

This paper proposes a statistical-structural character modeling method based on Markov random fields (MRFs) for handwritten Chinese character recognition (HCCR). The stroke relationships of a Chinese character reflect its structure, which can be statistically represented by the neighborhood system and clique potentials within the MRF framework. Based on the prior knowledge of character structures, we design the neighborhood system that accounts for the most important stroke relationships. We penalize the structurally mismatched stroke relationships with MRFs using the prior clique potentials, and derive the likelihood clique potentials from Gaussian mixture models, which encode the large variations of stroke relationships statistically. In the proposed HCCR system, we use the single-site likelihood clique potentials to extract many candidate strokes from character images, and use the pairsite clique potentials to determine the best structural match between the input candidate strokes and the MRF-based character models by relaxation labeling. The experiments on the KAIST character database demonstrate that MRFs can statistically model character structures, and work well in the HCCR system.     

结合距离分类器的神经网络手写体汉字识别

手写体汉字识别技术中如何解决复杂的大类别识别问题,是汉字识别中的一个难点。该文介绍了基于笔划的手写体汉字特征抽取方法,提出了一种基于预分类的神经网络汉字识别方法,该方法用一个传统的距离分类器先对汉字进行预分类,神经网络根据预分类结果进行有选择的训练和识别,能有效解决神经网络大类别模式识别中的训练和分类问题,学习时间很短,识别效果较理想。     

手写体汉字扇形弹性网格特征提取的新方法

近年来，网格方向特征已广泛应用于许多手写体汉字识别系统中，并认为是目前较成熟的手写体汉字特征之一，网格技术和方向分解是网格方向特征的两个关键技术，该文提出了一种新的网格技术一扇形网格法，结合边缘方向分解技术^[1]，构造了一种新的手写体汉字特征提取方法一扇形网格边缘方向分解特征，实验结果验证了本方法的有效效。     

Building efficient CNN architecture for offline handwritten Chinese character recognition

Deep convolutional neural networks-based methods have brought great breakthrough in image classification, which provides an end-to-end solution for handwritten Chinese character recognition (HCCR) problem through learning discriminative features automatically. Nevertheless, state-of-the-art CNNs appear to incur huge computational cost and require the storage of a large number of parameters especially in fully connected layers, which is difficult to deploy such networks into alternative hardware devices with limited computation capacity. To solve the storage problem, we propose a novel technique called weighted average pooling for reducing the parameters in fully connected layer without loss in accuracy. Besides, we implement a cascaded model in single CNN by adding mid output to complete recognition as early as possible, which reduces average inference time significantly. Experiments are performed on the ICDAR-2013 offline HCCR dataset. It is found that our proposed approach only needs 6.9 ms for classifying a character image on average and achieves the state-of-the-art accuracy of 97.1% while requires only 3.3 MB for storage.     

Parallel compact integration in handwritten Chinese character recognition

In this paper, a new parallel compact integration scheme based on multi-layer perceptron (MLP) networks is proposed to solve handwritten Chinese character recognition (HCCR) problems. The idea of metasynthesis is applied to HCCR, and compact MLP network classifier is defined. Human intelligence and computer capabilities are combined together effectively through a procedure of two-step supervised learning. Compared with previous integration schemes, this scheme is characterized with parallel compact structure and better performance. It provides a promising way for applying MLP to large vocabulary classification.     

几种手写体汉字网格方向特征提取法的比较研究*

近年来,网格方向特征已广泛应用于许多手写体汉字识别系统中,并认为是目前较成熟的手写体汉字特征之一。网格技术和方向分解是网格方向特征的两个关键技术。方向特征提取方法有许多种并各有优劣。对几种方向特征提取方法进行了比较研究,对其中一些方法进行了改进,并将我们提出的局部网格的划分方法应用到这几种方向分解特征的提取上,取得了较好的识别效果。     

几种手写体汉字网格方向特征提取法的比较研究

近年来，网格方向特征已广泛应用于许多手写体汉字识别系统中，并认为是目前较成熟的手写体汉字特征之一。网格技术和方向分解是网格方向特征的两个关键技术。方向特征提取方法有许多种并各有优劣。对几种方向特征提取方法进行了比较研究，对其中一些方法进行了改进，并将我们提出的局部网格的划分方法应用到这几种方向分解特征的提取上，取得了较好的识别效果。     

Modeling inverse covariance matrices by expansion of tied basis matrices for online handwritten Chinese character recognition

The state-of-the-art modified quadratic discriminant function (MQDF) based approach for online handwritten Chinese character recognition (HCCR) assumes that the feature vectors of each character class can be modeled by a Gaussian distribution with a mean vector and a full covariance matrix. In order to achieve a high recognition accuracy, enough number of leading eigenvectors of the covariance matrix have to be retained in MQDF. This paper presents a new approach to modeling each inverse covariance matrix by basis expansion, where expansion coefficients are character-dependent while a common set of basis matrices are shared by all the character classes. Consequently, our approach can achieve a much better accuracy–memory tradeoff. The usefulness of the proposed approach to designing compact HCCR systems has been confirmed and demonstrated by comparative experiments on popular Nakayosi and Kuchibue Japanese character databases.     

High accuracy handwritten Chinese character recognition using LDA-based compound distances

To improve the accuracy of handwritten Chinese character recognition (HCCR), we propose linear discriminant analysis (LDA)-based compound distances for discriminating similar characters. The LDA-based method is an extension of previous compound Mahalanobis function (CMF), which calculates a complementary distance on a one-dimensional subspace (discriminant vector) for discriminating two classes and combines this complementary distance with a baseline quadratic classifier. We use LDA to estimate the discriminant vector for better discriminability and show that under restrictive assumptions, the CMF is a special case of our LDA-based method. Further improvements can be obtained when the discriminant vector is estimated from higher-dimensional feature spaces. We evaluated the methods in experiments on the ETL9B and CASIA databases using the modified quadratic discriminant function (MQDF) as baseline classifier. The results demonstrate the superiority of LDA-based method over the CMF and the superiority of discriminant vector learning from high-dimensional feature spaces. Compared to the MQDF, the proposed method reduces the error rates by factors of over 26%.