Continuous-time hidden Markov models for network performance evaluation

In this paper, we study the use of continuous-time hidden Markov models (CT-HMMs) for network protocol and application performance evaluation. We develop an algorithm to infer the CT-HMM from a series of end-to-end delay and loss observations of probe packets. This model can then be used to simulate network environments for network performance evaluation. We validate the simulation method through a series of experiments both in ns and over the Internet. Our experimental results show that this simulation method can represent a wide range of real network scenarios. It is easy to use, accurate and time efficient.     

基于隐马尔可夫模型的非侵入式负荷监测泛化性能改进

隐马尔可夫模型(HMM)是非侵入式负荷监测常用的算法.由于电压波动与负荷自身电气特性变化等原因,负荷的测量状态如功率可能持续变化,运行过程中出现新的状态转移,但当前基于HMM的非侵入式负荷监测方法并未考虑如何处理该情况,缺乏状态辨识与功率分解的泛化能力.针对这一问题,本文提出并构建二元参数隐马尔科夫模型(BPHMM),结合DBSCAN聚类算法,基于有功功率和稳态电流对负荷状态进行聚类,降低了因电压波动和噪声数据对负荷状态聚类结果造成干扰的可能性;改进维特比算法使其考虑到HMM模型参数更新以实现对负荷状态预测泛化性能的改进;考虑到功率的随机波动性,基于极大似然估计原理构建功率计算优化模型并实现负荷的功率分解.本文采用公共数据集AMPds2对所述方法进行验证,测试算例验证了所述方法的有效性.     

Classic cryptanalysis using hidden Markov models

In this article, the authors present a detailed introduction to hidden Markov models (HMM). They then apply HMMs to the problem of solving simple substitution ciphers, and they empirically determine the accuracy as a function of the ciphertext length and the number of random restarts. Application to homophonic substitutions and other classic ciphers is briefly considered.     

Masquerade detection using profile hidden Markov models

In this paper, we consider the problem of masquerade detection, based on user-issued UNIX commands. We present a novel detection technique based on profile hidden Markov models (PHMMs). For comparison purposes, we implement an existing modeling technique based on hidden Markov models (HMMs). We compare these approaches and show that, in general, our PHMM technique is competitive with HMMs. However, the standard test data set lacks positional information. We conjecture that such positional information would give our PHMM a significant advantage over HMM-based detection. To lend credence to this conjecture, we generate a simulated data set that includes positional information. Based on this simulated data, experimental results show that our PHMM-based approach outperforms other techniques when limited training data is available.     

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.     

基于连续隐马尔可夫模型的人脸识别方法

提出了一种基于连续隐马尔可夫模型的人脸图像识别方法,主要内容包括以下方面:①由于奇异值向量具有稳定性.转置不变性等特点,对归一化的人脸图像,采用奇异值分解抽取人脸图像特征作为观察值序列;②在人脸识别中应用连续隐马尔可夫模型,采用双高斯概率密度函数训练,建立HMM模型,再利用建好的HMM模型进行识别.实验结果显示,所提出的方法减少了数据计算量,运行速度快,并提高了识别率,完全满足人脸识别系统实时性要求.     

基于最大熵马尔科夫模型的绩效评价方法

本文提出了一种基于最大熵马尔科夫模型的绩效评价方法.该方法采用马氏模型来定量化建模专家打分过程,采用特征函数表征打分规则,通过在训练集上最大化熵来获得符合专家经验的最优的打分模型.与传统方法相比,所提出的方法可以融合各种打分规则、专家经验和指标逻辑关系得到综合打分结果.为了提高模型的训练和打分的效率,本文提出了基于改进迭代算法的参数估计方法,并利用Viterbi算法进行快速打分计算.利用中国大洋协会绩效评价指标体系历史数据进行的仿真实验表明,与BP神经网络方法和最大熵方法进行对比,本文所提出的方法具有更高的打分正确率.     

混合遗传算法和隐马尔可夫模型的Web信息抽取

传统Web信息抽取的隐马尔可夫模型对初值十分敏感和在实际训练中极易得到局部最优模型参数。提出了一种使用遗传算法优化HMM模型参数的Web信息抽取混合算法。该算法使用实数矩阵编码表示染色体,似然概率值为适应度取值,将GA与Baum-Welch算法相结合对HMM模型参数进行全局优化,并且调整GA-HMM的Baum-Welch算法参数实现Web信息抽取。实验结果表明,新的算法在精确度和召回率指标上比传统HMM具有更好的性能。     

Handwritten word-spotting using hidden Markov models and universal vocabularies

Handwritten word-spotting is traditionally viewed as an image matching task between one or multiple query word-images and a set of candidate word-images in a database. This is a typical instance of the query-by-example paradigm. In this article, we introduce a statistical framework for the word-spotting problem which employs hidden Markov models (HMMs) to model keywords and a Gaussian mixture model (GMM) for score normalization. We explore the use of two types of HMMs for the word modeling part: continuous HMMs (C-HMMs) and semi-continuous HMMs (SC-HMMs), i.e. HMMs with a shared set of Gaussians. We show on a challenging multi-writer corpus that the proposed statistical framework is always superior to a traditional matching system which uses dynamic time warping (DTW) for word-image distance computation. A very important finding is that the SC-HMM is superior when labeled training data is scarce—as low as one sample per keyword—thanks to the prior information which can be incorporated in the shared set of Gaussians.     

基于隐马尔可夫模型的3D手写识别方法

为实现便捷高效的人机交互,提高交互能力,在基于隐马尔可夫模型(HMM)的基础上,提出了一种新的3D手写识别方法。该方法使用带有三轴加速度传感器的手持设备去采集各种手写数据;使用插值及快速傅里叶变换(FFT)滤波等方法对采集的数据进行预处理;使用隐马尔可夫模型对每个手写动作进行模型训练;使用训练过的手写模型对采集的数据进行手写识别。数据测试结果表明,该方法在手持移动设备上数据分类的准确性可达到84.5%。     

基于改进粒子群算法的隐马尔可夫模型训练

针对隐马尔可夫模型传统训练算法易收敛于局部极值的问题,提出一种带极值扰动的自适应调整惯性权重和加速系数的粒子群算法,将改进后的粒子群优化算法引入到隐马尔可夫模型的训练中,分别对隐马尔可夫模型的状态数与参数进优化.通过对手写数字识别的实验说明,提出的基于改进粒子群优化算法的隐马尔可夫模型训练算法与传统隐马尔可夫模型训练算法Baum-Welch算法相比,能有效地跳出局部极值,从而使训练后的隐马尔可夫模型具有较高的识别能力.     

Similarity-based classification of sequences using hidden Markov models

Hidden Markov models (HMM) are a widely used tool for sequence modelling. In the sequence classification case, the standard approach consists of training one HMM for each class and then using a standard Bayesian classification rule. In this paper, we introduce a novel classification scheme for sequences based on HMMs, which is obtained by extending the recently proposed similarity-based classification paradigm to HMM-based classification. In this approach, each object is described by the vector of its similarities with respect to a predetermined set of other objects, where these similarities are supported by HMMs. A central problem is the high dimensionality of resulting space, and, to deal with it, three alternatives are investigated. Synthetic and real experiments show that the similarity-based approach outperforms standard HMM classification schemes.     

基于隐马尔可夫模型的入侵场景构建

提出了一种基于隐马尔可夫模型的入侵场景构建方法,实现自动地从大量低级的入侵检测告警信息中构建出更高层次的入侵场景的目的。为了简化处理过程,对数据流采用两次抽象描述和一次回溯处理过程完成对入侵场景的构建,在DARPA2000测试数据集上的实验表明该方法是有效的。     

Blind separation of non-stationary sources using continuous density hidden Markov models

Blind source separation (BSS) has attained much attention in signal processing society due to its ‘blind’ property and wide applications. However, there are still some open problems, such as underdetermined BSS, noise BSS. In this paper, we propose a Bayesian approach to improve the separation performance of instantaneous mixtures with non-stationary sources by taking into account the internal organization of the non-stationary sources. Gaussian mixture model (GMM) is used to model the distribution of source signals and the continuous density hidden Markov model (CDHMM) is derived to track the non-stationarity inside the source signals. Source signals can switch between several states such that the separation performance can be significantly improved. An expectation-maximization (EM) algorithm is derived to estimate the mixing coefficients, the CDHMM parameters and the noise covariance. The source signals are recovered via maximum a posteriori (MAP) approach. To ensure the convergence of the proposed algorithm, the proper prior densities, conjugate prior densities, are assigned to estimation coefficients for incorporating the prior information. The initialization scheme for the estimates is also discussed. Systematic simulations are used to illustrate the performance of the proposed algorithm. Simulation results show that the proposed algorithm has more robust separation performance in terms of similarity score in noise environments in comparison with the classical BSS algorithms in determined mixture case. Additionally, since the mixing matrix and the sources are estimated jointly, the proposed EM algorithm also works well in underdetermined case. Furthermore, the proposed algorithm converges quickly with proper initialization.     

改进的HMM应用于哈萨克语词性标注

哈萨克语的词性标注在自然语言信息处理领域中扮演着重要角色,是句法分析、信息抽取、机器翻译等自然语言处理的基础。在传统的HMM的基础上改进了HMM模型参数的计算、数据平滑以及未登录词的处理方法,使之更好地体现词语的上下文依赖关系。利用基于统计的方法对哈萨克语熟语料进行训练,然后用Viterbi算法实现词性标注。实验结果表明利用改进的HMM进行词性标注的效果比传统的HMM好。     

Classification of process trends based on fuzzified symbolic representation and hidden Markov models

This paper presents a strategy to represent and classify process data for detection of abnormal operating conditions. In representing the data, a wavelet-based smoothing algorithm is used to filter the high frequency noise. A shape analysis technique called triangular episodes then converts the smoothed data into a semi-qualitative form. Two membership functions are implemented to transform the quantitative information in the triangular episodes to a purely symbolic representation. The symbolic data is classified with a set of sequence matching hidden Markov models (HMMs), and the classification is improved by utilizing a time correlated HMM after the sequence matching HMM. The method is tested on simulations with a non-isothermal CSTR and compared with methods that use a back-propagation neural network with and without an ARX model.     

基于最大似然线性回归的随机段模型说话人自适应研究

提出了一种随机段模型系统的说话人自适应方法。根据随机段模型的模型特性,将最大似然线性回归方法引入到随机段模型系统中。在“863 test”测试集上进行的汉语连续语音识别实验显示,在不同的解码速度下,说话人自适应后汉字错误率均有明显的下降。实验结果表明,最大似然线性回归方法在随机段模型系统中同样能取得较好的效果。     

Detection of heart valve diseases by using fuzzy discrete hidden Markov model

In the present study, biomedical based application was developed to classify the data belongs to normal and abnormal samples generated by Doppler ultrasound. This study consists of raw data obtaining and pre-processing, feature extraction and classification steps. In the pre-processing step, a high-pass filter, white de-noising and normalization were used. During the feature extraction step, wavelet entropy was applied by wavelet transform and short time fourier transform. Obtained features were classified by fuzzy discrete hidden Markov model (FDHMM). For this purpose, a FDHMM that consists of Sugeno and Choquet integrals and λ fuzzy measurement was defined to eliminate statistical dependence assumptions to increase the performance and to have better flexibility. Moreover, Sugeno integral was used together with triangular norms that are mentioned frequently in the literature in order to increase the performance. Experimental results show that recognition rate obtained by Sugeno fuzzy integral with triangular norm is more successful than recognition rates obtained by standard discrete HMM (DHMM) and Choquet integral based FDHMM. In addition to this, it is shown in this study that the performance of the Sugeno integral based method is better than the performances of artificial neural network (ANN) and HMM based classification systems that were used in previous studies of the authors.