Tool wear state recognition based on linear chain conditional random field model

Tool condition monitoring (TCM) system is paramount for guaranteeing the quality of workpiece and improving the efficiency of the machining process. To overcome the shortcomings of Hidden Markov Model (HMM) and improve the accuracy of tool wear recognition, a linear chain conditional random field (CRF) model is presented. As a global conditional probability model, the main characteristic of this method is that the estimation of the model parameters depends not only on the current feature vectors but also on the context information in the training data. Therefore, it can depict the interrelationship between the feature vectors and the tool wear states accurately. To test the effectiveness of the proposed method, acoustic emission data are collected under four kinds of tool wear state and seven statistical features are selected to realize the tool wear classification by using CRF and hidden Markov model (HMM) based pattern recognition method respectively. Moreover, k-fold cross validation method is utilized to estimate the generation error accurately. The analysis and comparison under different folds schemes show that the CRF model is more accurate for the classification of the tool wear state. Moreover, the stability and the training speed of the CRF classifier outperform the HMM model. This method casts some new lights on the tool wear monitoring especially in the real industrial environment.     

基于数据模拟和HMM自适应的电话语音识别研究

该文研究了基于数据模拟方法和HMM(隐马尔科夫模型)自适应的电话信道条件下语音识别问题。模拟数据模仿了纯净语音在不同电话信道条件下的语音行为。各基线系统的HMM模型分别由纯净语音和模拟语音训练而成。语音识别实验评估了各基线系统HMM模型在采用MLLR算法(最大似然线性回归)做无监督式自适应前后的识别性能。实验证明,由纯净语音转换生成的模拟语音有效地减小了训练语音和测试语音声学性质的不匹配,很大程度上提高了电话语音识别率。基线模型的自适应结果显示模拟数据的自适应性能比纯净语音自适应的性能最大提高达到9.8%,表明了电话语音识别性能的进一步改善和系统稳健性的提高。     

Confidence- and margin-based MMI/MPE discriminative training for off-line handwriting recognition

We present a novel confidence- and margin-based discriminative training approach for model adaptation of a hidden Markov model (HMM)-based handwriting recognition system to handle different handwriting styles and their variations. Most current approaches are maximum-likelihood (ML) trained HMM systems and try to adapt their models to different writing styles using writer adaptive training, unsupervised clustering, or additional writer-specific data. Here, discriminative training based on the maximum mutual information (MMI) and minimum phone error (MPE) criteria are used to train writer-independent handwriting models. For model adaptation during decoding, an unsupervised confidence-based discriminative training on a word and frame level within a two-pass decoding process is proposed. The proposed methods are evaluated for closed-vocabulary isolated handwritten word recognition on the IFN/ENIT Arabic handwriting database, where the word error rate is decreased by 33% relative compared to a ML trained baseline system. On the large-vocabulary line recognition task of the IAM English handwriting database, the word error rate is decreased by 25% relative.     

Joint evaluation of multiple speech patterns for speech recognition and training

We are addressing the novel problem of jointly evaluating multiple speech patterns for automatic speech recognition and training. We propose solutions based on both the non-parametric dynamic time warping (DTW) algorithm, and the parametric hidden Markov model (HMM). We show that a hybrid approach is quite effective for the application of noisy speech recognition. We extend the concept to HMM training wherein some patterns may be noisy or distorted. Utilizing the concept of “virtual pattern” developed for joint evaluation, we propose selective iterative training of HMMs. Evaluating these algorithms for burst/transient noisy speech and isolated word recognition, significant improvement in recognition accuracy is obtained using the new algorithms over those which do not utilize the joint evaluation strategy.     

Semisupervised Learning of Hidden Markov Models via a Homotopy Method

Hidden Markov model (HMM) classifier design is considered for the analysis of sequential data, incorporating both labeled and unlabeled data for training; the balance between the use of labeled and unlabeled data is controlled by an allocation parameter lambda isin (0, 1), where lambda = 0 corresponds to purely supervised HMM learning (based only on the labeled data) and lambda = 1 corresponds to unsupervised HMM-based clustering (based only on the unlabeled data). The associated estimation problem can typically be reduced to solving a set of fixed-point equations in the form of a "natural-parameter homotopy." This paper applies a homotopy method to track a continuous path of solutions, starting from a local supervised solution (lambda = 0) to a local unsupervised solution (lambda = 1). The homotopy method is guaranteed to track with probability one from lambda = 0 to lambda = 1 if the lambda = 0 solution is unique; this condition is not satisfied for the HMM since the maximum likelihood supervised solution (lambda = 0) is characterized by many local optima. A modified form of the homotopy map for HMMs assures a track from lambda = 0 to lambda = 1. Following this track leads to a formulation for selecting lambda isin (0, 1) for a semisupervised solution and it also provides a tool for selection from among multiple local-optimal supervised solutions. The results of applying the proposed method to measured and synthetic sequential data verify its robustness and feasibility compared to the conventional EM approach for semisupervised HMM training.     

A hybrid immune model for unsupervised structural damage pattern recognition

This paper presents an unsupervised structural damage pattern recognition approach based on the fuzzy clustering and the artificial immune pattern recognition (AIPR). The fuzzy clustering technique is used to initialize the pattern representative (memory cell) for each data pattern and cluster training data into a specified number of patterns. To improve the quality of memory cells, the artificial immune pattern recognition method based on immune learning mechanisms is employed to evolve memory cells. The presented hybrid immune model (combined with fuzzy clustering and the artificial immune pattern recognition) has been tested using a benchmark structure proposed by the IASC–ASCE (International Association for Structural Control–American Society of Civil Engineers) Structural Health Monitoring Task Group. The test results show the feasibility of using the hybrid AIPR (HAIPR) method for the unsupervised structural damage pattern recognition.     

A probabilistic model for state sequence analysis in hidden Markov model for hand gesture recognition

The role of gesture recognition is significant in areas like human‐computer interaction, sign language, virtual reality, machine vision, etc. Among various gestures of the human body, hand gestures play a major role to communicate nonverbally with the computer. As the hand gesture is a continuous pattern with respect to time, the hidden Markov model (HMM) is found to be the most suitable pattern recognition tool, which can be modeled using the hand gesture parameters. The HMM considers the speeded up robust feature features of hand gesture and uses them to train and test the system. Conventionally, the Viterbi algorithm has been used for training process in HMM by discovering the shortest decoded path in the state diagram. The recursiveness of the Viterbi algorithm leads to computational complexity during the execution process. In order to reduce the complexity, the state sequence analysis approach is proposed for training the hand gesture model, which provides a better recognition rate and accuracy than that of the Viterbi algorithm. The performance of the proposed approach is explored in the context of pattern recognition with the Cambridge hand gesture data set.     

ADR-SPLDA: Activity discovery and recognition by combining sequential patterns and latent Dirichlet allocation

This paper presents ADR-SPLDA, an unsupervised model for human activity discovery and recognition in pervasive environments. The activities are encoded in sequences recorded by non-intrusive sensors placed at various locations in the environment. Our model studies the relationship between the activities and the sequential patterns extracted from the sequences. Activity discovery is formulated as an optimization problem in which sequences are modeled as probability distributions over activities, and activities are, in turn, modeled as probability distributions over sequential patterns. The optimization problem is solved by maximization of the likelihood of data. We present experimental results on real datasets gathered in smart homes where people perform various activities of daily living. The results obtained demonstrate the suitability of our model for activity discovery and characterization. Also, we empirically demonstrate the effectiveness of our model for activity recognition by comparing it with two of the widely used models reported in the literature, the Hidden Markov model and the Conditional Random Field model.     

Centroid neural network with a divergence measure for GPDF data clustering.

An unsupervised competitive neural network for efficient clustering of Gaussian probability density function (GPDF) data of continuous density hidden Markov models (CDHMMs) is proposed in this paper. The proposed unsupervised competitive neural network, called the divergence-based centroid neural network (DCNN), employs the divergence measure as its distance measure and utilizes the statistical characteristics of observation densities in the HMM for speech recognition problems. While the conventional clustering algorithms used for the vector quantization (VQ) codebook design utilize only the mean values of the observation densities in the HMM, the proposed DCNN utilizes both the mean and the covariance values. When compared with other conventional unsupervised neural networks, the DCNN successfully allocates more code vectors to the regions where GPDF data are densely distributed while it allocates fewer code vectors to the regions where GPDF data are sparsely distributed. When applied to Korean monophone recognition problems as a tool to reduce the size of the codebook, the DCNN reduced the number of GPDFs used for code vectors by 65.3% while preserving recognition accuracy. Experimental results with a divergence-based k-means algorithm and a divergence-based self-organizing map algorithm are also presented in this paper for a performance comparison.     

A unified framework of HMM adaptation with joint compensation of additive and convolutive distortions

In this paper, we present our recent development of a model-domain environment robust adaptation algorithm, which demonstrates high performance in the standard Aurora 2 speech recognition task. The algorithm consists of two main steps. First, the noise and channel parameters are estimated using multi-sources of information including a nonlinear environment-distortion model in the cepstral domain, the posterior probabilities of all the Gaussians in speech recognizer, and truncated vector Taylor series (VTS) approximation. Second, the estimated noise and channel parameters are used to adapt the static and dynamic portions (delta and delta–delta) of the HMM means and variances. This two-step algorithm enables joint compensation of both additive and convolutive distortions (JAC). The hallmark of our new approach is the use of a nonlinear, phase-sensitive model of acoustic distortion that captures phase asynchrony between clean speech and the mixing noise.In the experimental evaluation using the standard Aurora 2 task, the proposed Phase-JAC/VTS algorithm achieves 93.32% word accuracy using the clean-trained complex HMM backend as the baseline system for the unsupervised model adaptation. This represents high recognition performance on this task without discriminative training of the HMM system. The experimental results show that the phase term, which was missing in all previous HMM adaptation work, contributes significantly to the achieved high recognition accuracy.     

Training Wideband Acoustic Models Using Mixed-Bandwidth Training Data for Speech Recognition

One serious difficulty in the deployment of wideband speech recognition systems for new tasks is the expense in both time and cost of obtaining sufficient training data. A more economical approach is to collect telephone speech and then restrict the application to operate at the telephone bandwidth. However, this generally results in suboptimal performance compared to a wideband recognition system. In this paper, we propose a novel expectation-maximization (EM) algorithm in which wideband acoustic models are trained using a small amount of wideband speech and a larger amount of narrowband speech. We show how this algorithm can be incorporated into the existing training schemes of hidden Markov model (HMM) speech recognizers. Experiments performed using wideband speech and telephone speech demonstrate that the proposed mixed-bandwidth training algorithm results in significant improvements in recognition accuracy over conventional training strategies when the amount of wideband data is limited     

基于变帧率训练的HMM汉语人名识别

本文针对语音识别中HMM模型需要大量训练,而在某些实际应用中不可能训练多次的问题,提出一种基于余弦整形变换的变帧率训练方法,并在人名声控拨号系统中进行实验,在训练一次的条件下,系统识别率提高4.2%。实验表明,该方法对解决语音识别系统中训练数据少的问题具有明显效果。     

一种具有强分类能力的离散HMM训练算法

提出了一种具有强分类能力的离散HMM(hiddenMarkovmodels)训练算法.该算法利用矢量量化技术将来自不同话者的训练数据进行混合训练,以生成包含各个话者特征的话者特征图案.用该特征图案代替经典的离散HMM中的VQ码本,可以提高观察值符号序列的模式辨识能力,从而提高了离散HMM的分类能力.给出了该方法用于文本有关的话者识别的实验结果,表明该算法可提高系统的识别性能,并要降低HMM对训练集大小的依赖程度,且识别时计算量明显小于经典HMM训练算法,具有较大的实用价值.     

Recognizing Visual Focus of Attention From Head Pose in Natural Meetings

We address the problem of recognizing the visual focus of attention (VFOA) of meeting participants based on their head pose. To this end, the head pose observations are modeled using a Gaussian mixture model (GMM) or a hidden Markov model (HMM) whose hidden states correspond to the VFOA. The novelties of this paper are threefold. First, contrary to previous studies on the topic, in our setup, the potential VFOA of a person is not restricted to other participants only. It includes environmental targets as well (a table and a projection screen), which increases the complexity of the task, with more VFOA targets spread in the pan as well as tilt gaze space. Second, we propose a geometric model to set the GMM or HMM parameters by exploiting results from cognitive science on saccadic eye motion, which allows the prediction of the head pose given a gaze target. Third, an unsupervised parameter adaptation step not using any labeled data is proposed, which accounts for the specific gazing behavior of each participant. Using a publicly available corpus of eight meetings featuring four persons, we analyze the above methods by evaluating, through objective performance measures, the recognition of the VFOA from head pose information obtained either using a magnetic sensor device or a vision-based tracking system. The results clearly show that in such complex but realistic situations, the VFOA recognition performance is highly dependent on how well the visual targets are separated for a given meeting participant. In addition, the results show that the use of a geometric model with unsupervised adaptation achieves better results than the use of training data to set the HMM parameters.     

基于一种改进禁忌搜索算法优化离散隐马尔可夫模型

隐马尔可夫模型(HMM,HiddenMarkovModel)是语音识别和手势识别中广泛使用的统计模式识别方法。文章提出了一种改进的禁忌搜索(ITS,ImprovedTabuSearch)优化HMM的参数。传统的TabuSearch(TS)与局部搜索算法(极大似然法)交替进行,从而加快了算法的收敛速度,并得到优化解。分别用TS及ITS训练隐马尔可夫模型进行动态手势识别。结果表明ITS可获得更高的识别率,且能达到全局优化。     

Customer credit scoring based on HMM/GMDH hybrid model

Hidden Markov model (HMM) has made great achievements in many fields such as speech recognition and engineering. However, due to its assumption of state conditional independence between observations, HMM has a very limited capacity for recognizing complex patterns involving more than first-order dependencies in customer relationships management. Group Method of Data Handling (GMDH) could overcome the drawbacks of HMM, so we propose a hybrid model by combining the HMM and GMDH to score customer credit. There are three phases in this model: training HMM with multiple observations, adding GMDH into HMM and optimizing the hybrid model. The proposed hybrid model is compared with other exiting methods in terms of average accuracy, Type I error, Type II error and AUC. Experimental results show that the proposed method has better performance than HMM/ANN in two credit scoring datasets. The implementation of HMM/GMDH hybrid model allows lenders and regulators to develop techniques to measure customer credit risk.     

Locating Human Faces in a Cluttered Scene

In this paper, we present two new schemes for finding human faces in a photograph. The first scheme adopts a distribution-based model approach to face-finding. Distributions of the face and the face-like manifolds are approximated using higher order statistics (HOS) by deriving a series expansion of the density function in terms of the multivariate Gaussian and the Hermite polynomials in an attempt to get a better approximation to the unknown original density function. An HOS-based data clustering algorithm is then proposed to facilitate the decision process. The second scheme adopts a hidden Markov model (HMM) based approach to the face-finding problem. This is an unsupervised scheme in which face-to-nonface and nonface-to-face transitions are learned by using an HMM. The HMM learning algorithm estimates the HMM parameters corresponding to a given photograph and the faces are located by examining the optimal state sequence of the HMM. We present experimental results on the performance of both schemes. A training data base of face images was constructed in the laboratory. The performances of both the proposed schemes are found to be quite good when measured with respect to several standard test face images.     

一种基于隐马尔科夫模型的步态识别算法

步态是指人体走路时的姿态,步态识别是近年来生物特征识别领域一个备受关注的研究方向。步态阶段的区分是步态识别的重要内容。以隐马尔科夫模型(HMM)为基础,基于安装在膝关节的编码器和大腿部的加速度传感器,在外骨骼辅助行走中识别步态的不同阶段。首先进行数据预处理和特征提取;其次对隐马尔科夫步态识别算法进行设计,包括结构的建立、参数的训练和最终的识别;最后对性能进行评估,总体正确率达到91.06%,说明HMM用于步态阶段识别具有较好的性能。     

构件使用的序列模式发现研究

提出构件使用序列模式发现的处理过程和算法．将构件使用的序列模式发现分为日志数据向序列数据库的迁移、数据预处理、序列模式算法运算、结果的求精和解释、结果保存5个步骤。构件使用的序列模式发现算法有一个刻面参数,可以有针对性地对某一个感兴趣的刻面在不同概念层进行序列模式发现。     

基于HMM和微粒群优化算法的表情识别

提出基于微粒群优化算法(PSO)的隐马尔科夫模型(HMM)训练算法,分别用PSO和量子微粒群优化算法进行HMM的参数估计,以提高HMM的性能。将改进的HMM算法应用于人脸表情识别,采用离散余弦变换提取表情特征向量。实验结果表明,该算法能有效提高表情识别率,解决HMM的参数估计问题。