基于多分类器集成的维吾尔文联机手写字母识别

多分类器组合能够在一定程度上弥补单个分类器的缺陷,因此它在模式识别中得到了广泛应用。深入调研国内外联机手写识别技术的研究动态,结合维吾尔文字母的独特书写风格,研究了基于多分类器集成的维吾尔语联机手写字母识别。利用5种不同的特征提取方法构造了5个独立的维吾尔语字母分类识别器,采用了等权投票和不等权投票等两种策略将5种维吾尔语字母分类识别器进行了有效组合。其中,单分类器采用了基于动态时间弯折（DTW）匹配距离的最近邻分类方法。实验结果表明,提出的集成策略的识别率明显高于单分类器的识别率,而且为特征的综合集成提供了多种有效途径。     

A robust method for coarse classifier construction from a large number of basic recognizers for on-line handwritten Chinese/Japanese character recognition

In this paper, a systematic method is described that constructs an efficient and a robust coarse classifier from a large number of basic recognizers obtained by different parameters of feature extraction, different discriminant methods or functions, etc. The architecture of the coarse classification is a sequential cascade of basic recognizers that reduces the candidates after each basic recognizer. A genetic algorithm determines the best cascade with the best speed and highest performance. The method was applied for on-line handwritten Chinese and Japanese character recognitions. We produced hundreds of basic recognizers with different classification costs and different classification accuracies by changing parameters of feature extraction and discriminant functions. From these basic recognizers, we obtained a rather simple two-stage cascade, resulting in the whole recognition time being reduced largely while maintaining classification and recognition rates.     

Combining diverse systems for handwritten text line recognition

In this paper, we present a recognition system for on-line handwritten texts acquired from a whiteboard. The system is based on the combination of several individual classifiers of diverse nature. Recognizers based on different architectures (hidden Markov models and bidirectional long short-term memory networks) and on different sets of features (extracted from on-line and off-line data) are used in the combination. In order to increase the diversity of the underlying classifiers and fully exploit the current state-of-the-art in cursive handwriting recognition, commercial recognition systems have been included in the combined system, leading to a final word level accuracy of 86.16%. This value is significantly higher than the performance of the best individual classifier (81.26%).     

基于字素分割的蒙古文手写识别研究

隐马尔科夫模型(HMM)对序列数据有很强的建模能力,在语音和手写识别中都得到了广泛的应用。利用HMM研究蒙古文手写识别,首先需要解决的问题是手写文字的序列化。从蒙古文的构词和书写特点看,蒙古文由多个字素从上到下串联构成。选择字素集合和词的字素分割是手写识别的基础,也是影响识别效果的关键因素。该文根据蒙古文音节和编码知识确定了蒙古文字母集合,共包括1 171个字母。通过相关性处理、HMM排序筛选等手段得到长字素集合,共包括378个字素。对长字素经过人工分解,获得了50个短字素。最后利用两层映射给出了词转字素序列的算法。为了验证长短字素在手写识别中的效果,我们在HTK(hidden Markov model toolkit)环境下利用小规模字库实现了手写识别系统,实验结果表明短字素比长字素有更好的性能。文中给出的字素集合和词转字素序列的算法为后续基于HMM的蒙古文手写识别研究奠定了基础。     

Confidence modeling for handwriting recognition: algorithms and applications

Confidence scoring can assist in determining how to use imperfect handwriting-recognition output. We explore a confidence-scoring framework for post-processing recognition for two purposes: deciding when to reject the recognizer's output, and detecting when to change recognition parameters e.g., to relax a word-set constraint. Varied confidence scores, including likelihood ratios and posterior probabilities, are applied to an Hidden-Markov-Model (HMM) based on-line recognizer. Receiver-operating characteristic curves reveal that we successfully reject 90% of word recognition errors while rejecting only 33% of correctly-recognized words. For isolated digit recognition, we achieve 90% correct rejection while limiting false rejection to 13%.     

On-line recognition of Korean characters using ART neural network and hidden Markov model

This paper proposes an efficient method for on-line recognition of cursive Korean characters. The recognition of cursive strokes and the representation of a large character set are important determinants in the recognition rate of Korean characters. To deal with cursive strokes, we classify them automatically by using an ART-2 neural network. This neural network has the advantage of assembling similar patterns together to form classes in a self-organized manner. To deal with the large character set, we construct a character recognition model by using the hidden Markov model (HMM), which has the advantages of providing an explicit representation of time-varying vector sequence and probabilistic interpretation. Probabilistic parameters of the HMM are initialized using the combination rule for Korean characters and a set of primitive strokes that are classified by the ART stroke classifier, and trained with sample data. This is an efficient means of representing all the 11,172 possible Korean characters. We tested the model on 7500 on-line cursive Korean characters and it proved to perform well in recognition rate and speed.     

Comparing ANN to HMM in implementing limited Arabic vocabulary ASR systems

In this paper we investigated Artificial Neural Networks (ANN) based Automatic Speech Recognition (ASR) by using limited Arabic vocabulary corpora. These limited Arabic vocabulary subsets are digits and vowels carried by specific carrier words. In addition to this, Hidden Markov Model (HMM) based ASR systems are designed and compared to two ANN based systems, namely Multilayer Perceptron (MLP) and recurrent architectures, by using the same corpora. All systems are isolated word speech recognizers. The ANN based recognition system achieved 99.5% correct digit recognition. On the other hand, the HMM based recognition system achieved 98.1% correct digit recognition. With vowels carrier words, the MLP and recurrent ANN based recognition systems achieved 92.13% and 98.06, respectively, correct vowel recognition; but the HMM based recognition system achieved 91.6% correct vowel recognition.     

Multi-environment model adaptation based on vector Taylor series for robust speech recognition

In this paper, we propose a multi-environment model adaptation method based on vector Taylor series (VTS) for robust speech recognition. In the training phase, the clean speech is contaminated with noise at different signal-to-noise ratio (SNR) levels to produce several types of noisy training speech and each type is used to obtain a noisy hidden Markov model (HMM) set. In the recognition phase, the HMM set which best matches the testing environment is selected, and further adjusted to reduce the environmental mismatch by the VTS-based model adaptation method. In the proposed method, the VTS approximation based on noisy training speech is given and the testing noise parameters are estimated from the noisy testing speech using the expectation-maximization (EM) algorithm. The experimental results indicate that the proposed multi-environment model adaptation method can significantly improve the performance of speech recognizers and outperforms the traditional model adaptation method and the linear regression-based multi-environment method.     

HMM-based handwritten word recognition: on the optimization of the number of states, training iterations and Gaussian components

In off-line handwriting recognition, classifiers based on hidden Markov models (HMMs) have become very popular. However, while there exist well-established training algorithms which optimize the transition and output probabilities of a given HMM architecture, the architecture itself, and in particular the number of states, must be chosen “by hand”. Also the number of training iterations and the output distributions need to be defined by the system designer. In this paper we examine several optimization strategies for an HMM classifier that works with continuous feature values. The proposed optimization strategies are evaluated in the context of a handwritten word recognition task.     

Mapping vegetation and land cover in a large urban area using a multiple classifier system

Vegetation and land-cover information is critical for sustainable environmental management in urban areas. Remote sensing has increasingly been used to derive such information, yet it has been challenged by the spectral and spatial complexity in the urban environment. In this study, we developed a multiple classifier system (MCS) to help improve remote-sensing-based vegetation and land-cover mapping in a large metropolitan area. MCSs, although considered as an emerging hot topic and a promising trend in pattern recognition, have not received the attention it deserves in the remote-sensing community. Our work consisted of several components. First, we identified a group of commonly used pattern recognizers from different families of statistical learning algorithms as base classifiers. Then, we implemented them to derive land-cover information from a satellite image covering the study site. Last, we adopted a weighting and combination method to generate the final map. Results indicate that there is statistically significant difference in the classification accuracy between the MCS developed and each base classifier considered. Comparing with the base classifiers, the MCS produced not only about 5–8% higher overall classification accuracy but also the most stable categorical accuracies. Moreover, the MCS generated a larger accuracy improvement for spectrally complex classes than for relatively homogenous ones, suggesting its comparative advantage in reducing classification errors caused by class ambiguity. The novelties of our work are with the demonstration of how MCSs can be operationally used to improve image classification from large remote sensor data sets with complex patterns and with the insight into the behaviour of MCSs in relation to the complexity of individual classes. These findings can help promote the use of MCSs as an emerging premier approach for image classification by the remote-sensing community.     

Recognition of legal amounts on bank cheques

This article describes the recognition of legal amounts of a bank cheque processing system developed at CENPARMI. The preprocessing, sentence to word segmentation and word recognition approaches are presented along with some critical reviews. The overall engine is a combination of a global feature scheme with an HMM module. The global features consist of the encoding of the relative position of the ascenders, descenders and loops within a word. The HMM uses one feature set based on the orientation of contour points as well as their distance to the baselines. Our system is fully trainable, reducing to a strict minimum the number of hand-set parameters. The system is also modular and independent of specific languages as we have to deal with at least two languages in Canada, namely English and French. The system can be easily adapted to read other European languages based on the Roman alphabet. The system is continuously tested on data from the local phone company, and we report here the results on a balanced French database of approximately 2000 cheques with specified amounts.     

基于可训练机制的联机维吾尔手写字母识别技术研究

在深入研究英文和汉字手写识别的基础上,结合维吾尔文字母的特点,提出一种基于支持向量机机器学习算法的维吾尔文联机手写字母识别方法,系统研究了样本采集、预处理、特征提取和分类等模块。在预处理中,为了消除干扰和噪声及比较中的相似性,采用了平滑滤波和线性归一化处理;考虑到维吾尔文相似字母较多,为了有效提取特征,将结构特征和统计特征相结合,提取了字符的梯度方向特征;分类器采用支持向量机。实验表明,随着训练样本的增加,识别率可以从90.62%提高到96.09%。     

Analysis of a Plurality Voting-based Combination of Classifiers

In various studies, it has been demonstrated that combining the decisions of multiple classifiers can lead to better recognition result. Plurality voting is one of the most widely used combination strategies. In this paper, we both theoretically and experimentally analyze the performance of a plurality voting based ensemble classifier. Theoretical expressions for system performance are derived as a function of the model parameters: N (number of classifiers), m (number of classes), and p (probability that a single classifier is correct). Experimental results on the human face recognition problem show that the voting strategy can successfully achieve high detection and identification rates, and, simultaneously, low false acceptance rates.     

一种基于联合得分的孤立词语音识别系统

介绍了一种基于联合得分的实时孤立词语音识别系统。在识别阶段,通过内插向最得到两种改进的DTW算法,并且和基本的DTW联合起来对语音进行识别,得出各自的识别结果,最后把所有的结果联合起来得到最终的识别结果。通过在TI46语音库和实时运行的实验表明,系统在低信噪比的环境下和实时运行的环境中,都可以获得比一般只应用DTW算法的识别系统更高的识别率。     

面向中文矢量笔迹中单字详细分类的特征和方法比较*

在识别矢量笔迹文本时,不同类型单字需要采用不同识别器,确定详细类别是单字识别的前提。对实际中文矢量笔迹文本中单字进行汉字、标点、数字、字母和单词的详细分类,提出了自身和相对（包括近邻和同行）特征,选用决策树、逻辑模型树、贝叶斯网络和支持向量机四种分类器。针对大量实际数据,测试和比较了多种特征和分类器的性能。实验表明,近邻单字的组合特征具有较好的分类能力,支持向量机对各种单字均有较好分类性能。     

基于HMM与RBF的混合语音识别新方法

提出了一种隐马尔可夫模型（ＨＭＭ）和径向基函数神经网络（ＲＢＦ）相结合的语音识别新方法。该方法首先利用ＨＭＭ生成最佳语音状态序列,然后用函数逼近技术产生对最佳状态序列进行时间规正,最后通过ＲＢＦ神经网络进行分类识别。理论和实验结果表明,该系统比ＨＭＭ具有更好的识别效果,特别对提高易混淆词的识别性能尤为显著。     

一种维吾尔语联机手写识别系统

该文介绍一种维吾尔语联机手写体识别系统。其针对维吾尔语词语的书写特点采用了基于多分类器融合的系统和方法,分别使用混合高斯模型模拟整词的静态特征和隐马尔科夫模型模拟书写笔迹的动态特征,有效地提升了识别系统的准确率。在第一期实验中,整词识别率达到97%;第二期的实验中,整词识别率达到99%。     

一种基于改进CP网络与HMM相结合的混合音素识别方法

提出了一种基于改进对偶传播（ＣＰ）神经网络与隐驰尔可夫模型（ＨＭＭ）相结合的混合音素识别方法．这一方法的特点是用一个具有有指导学习矢量量化（ＬＶＱ）和动态节点分配等特性的改进的ＣＰ网络生成离散ＨＭＭ音素识别系统中的码书。因此,用这一方法构造的混合音素识别系统中的码书实际上是一个由有指导ＬＶＱ算法训练的具有很强分类能力的高性能分类器,这就意味着在用ＨＭＭ对语音信号进行建模之前,由码书产生的观测序列中     

On-line signature recognition based on VQ-DTW

This paper studies some pattern recognition algorithms for on-line signature recognition: vector quantization (VQ), nearest neighbor (NN), dynamic time warping (DTW) and hidden Markov models (HMM). We have used a database of 330 users which includes 25 skilled forgeries performed by five different impostors. This database is larger than the typical ones found in the literature.Experimental results reveal that our first proposed combination of VQ and DTW (by means of score fusion) outperforms the other algorithms (DTW, HMM) and achieves a minimum detection cost function (DCF) value equal to 1.37% for random forgeries and 5.42% for skilled forgeries. In addition, we present another combined DTW-VQ scheme which enables improvement of privacy for remote authentication systems, avoiding the submission of the whole original dynamical signature information (using codewords, instead of feature vectors). This system achieves similar performance than DTW.