基于二阶隐马尔可夫模型的文本信息抽取

隐马尔可夫模型是文本信息抽取的重要方法之一.在一阶隐马尔可夫模型中,假设状态转移概率和观察值输出概率仅依赖于模型当前的状态,一定程度降低了信息抽取的精确度.而二阶隐马尔可夫模型合理地考虑了概率和模型历史状态的关联性,对错误信息有更强的识别能力.提出了基于二阶隐马尔可夫模型的文本信息抽取算法;分析了二阶隐马尔可夫模型在文本信息抽取中的有效性;仿真实验表明,新的算法比基于一阶隐马尔可夫模型的算法具有更高的抽取精确度.     

一种改进的隐马尔可夫模型训练方法及其在声目标识别中的应用

提出了一种基于最大相对界的改进隐马尔可夫模型训练方法.为解决隐马尔可夫模型的传统Baum_Welch训练算法在识别声目标时的局限以及现存区分训练算法泛化能力不足的问题,在经典隐马尔可夫模型为初始模型的基础上,定义了相对界,并通过最大化最小相对界建立一个最优化问题,用梯度下降法进行迭代求解,得到基于相对界的隐马尔可夫模型...     

一种基于加权隐马尔可夫的 自回归状态预测模型

针对电子系统状态趋势预测问题,提出了一种加权隐马尔可夫模型的自回归趋势预测方法.该方法以自回归模型作为隐马尔可夫的状态输出,利用加权预测思想对马尔可夫链中的隐状态进行混合高斯模型的加权序列预测,并利用最大概率隐状态下的自回归系数计算模型输出.通过对实际的复杂混沌序列和电子系统BIT状态数据进行趋势预测,并针对不同模型参数下的预测结果进行实验分析,结果表明该方法对系统状态变化的趋势具有较好的预测性能.     

HMT与HMRF联合的SAR图像小波去斑方法

该文将隐马尔可夫树(HMT)和隐马尔可夫随机场(HMRF)两种模型相结合,提出了一种新的估计SAR图像小波系数隐状态的迭代算法.使用该算法可以充分利用小波系数尺度间和尺度内的相关性,更准确地估计隐状态.在此基础上,通过贝叶斯估计分离出小波系数中的信号成分即可消除噪声影响.实验结果表明,该算法能够有效抑制SAR图像相干斑,同时可较好地保持边缘等图像结构特征.     

基于改进HMM的半结构化文本信息抽取算法研究

在分析半结构化文本特点与隐马尔可夫模型的基础上,提出了一种新的基于隐马尔可夫模型的信息抽取算法,并与传统的基于单一隐马尔可夫模型的信息抽取算法进行了比较分析。实验结果表明,所提算法在精确度上有明显优化,特别在状态特征不明显的情况下仍能保持良好的精确度。将该算法应用于半结构化文本的信息抽取中,具有较好的可行性和有效性。     

基于隐马尔可夫模型的车牌自动识别技术

文中提出了一种车牌字符识别的新方法,用二维隐马尔可夫模型方法识别车牌中的汉字,用伪二维隐马尔可夫模型（P2D－HMM）方法识别车牌中的英文字符及阿拉伯数字。该算法适用于不同的字符大小、字符倾斜、污损等情况,抗噪声能力强。字符识别正确率达94％以上,满足实用技术的要求。     

OFDM系统的受限隐马尔可夫模型

本文采用隐马尔可夫模型(HMM)的一种特例--受限隐马尔可夫模型(CHMM)对正交频分复用(OFDM)系统进行建模,给出了CHMM参数估计算法的改进,可避免计算机编程实现时出现下溢导致的计算失败.通过仿真讨论了CHMM状态数的选取问题,并给出了HIPERLAN/2室内无线信道环境下OFDM系统的一组CHMM,该模型可用于比较不同编码方案的性能或者分析高层协议性能.     

基于最大熵的隐马尔可夫模型文本信息抽取

文本信息抽取是处理海量文本的重要手段之一.最大熵模型提供了一种自然语言处理的方法.提出了一种基于最大熵的隐马尔可夫模型文本信息抽取算法.该算法结合最大熵模型在处理规则知识上的优势,以及隐马尔可夫模型在序列处理和统计学习上的技术基础,将每个观察文本单元所有特征的加权之和用来调整隐马尔可夫模型中的转移概率参数,实现文本信息抽取.实验结果表明,新的算法在精确度和召回率指标上比简单隐马尔可夫模型具有更好的性能.     

基于隐马尔可夫模型局部最优状态路径的数据重建算法

该文提出了基于隐马尔可夫模型局部最优状态路径的数据重建(LOPDI)算法。该算法假设语音特征矢量是一个L状态隐马尔可夫模型的输出序列,基于局部最优状态路径估计产生语音特征矢量的次最优状态序列,并按最大后验概率准则(MAP)重建出缺失矢量。实验表明,LOPDI算法能够显著提高语音识别系统对加性噪声的鲁棒性。     

隐马尔可夫模型在P2P僵尸网络检测中的应用

针对P2P僵尸网络的特点,将隐马尔可夫模型应用于P2P僵尸网络检测技术中.首先根据当前僵尸网络的发展状况及存在的问题分析了P2P僵尸网络的生命周期和行为特征;然后对僵尸主机的状态划分采用隐马尔可夫模型对P2P僵尸网络进行数学建模,并提出一种P2P僵尸网络的检测方法.通过实验,验证了检测方法的可靠性和合理性.     

A computationally efficient approach to the estimation of two- and three-dimensional hidden Markov models.

Statistical modeling methods are becoming indispensable in today's large-scale image analysis. In this paper, we explore a computationally efficient parameter estimation algorithm for two-dimensional (2-D) and three-dimensional (3-D) hidden Markov models (HMMs) and show applications to satellite image segmentation. The proposed parameter estimation algorithm is compared with the first proposed algorithm for 2-D HMMs based on variable state Viterbi. We also propose a 3-D HMM for volume image modeling and apply it to volume image segmentation using a large number of synthetic images with ground truth. Experiments have demonstrated the computational efficiency of the proposed parameter estimation technique for 2-D HMMs and a potential of 3-D HMM as a stochastic modeling tool for volume images.     

Improved image decoding over noisy channels using minimummean-squared estimation and a Markov mesh

Joint source-channel (JSC) decoding based on residual source redundancy is a technique for providing channel robustness to quantized data. Previous work assumed a model equivalent to viewing the encoder/noisy channel tandem as a discrete hidden Markov model (HMM) with transmitted indices the hidden states. We generalize this HMM-based (1-D) approach for images, using the more powerful hidden Markov mesh random field (HMMRF) model. While previous state estimation methods for HMMRFs base estimates on only a causal subset of the observed data, our new method uses both causal and anticausal subsets. For JSC-based image decoding, the new method provides significant benefits over several competing techniques.     

Bilateral polynomial matrix equations in two indeterminates

Two special cases of the bilateral 2-D polynomial matrix equationDU +VN=C whenC=I andC=I with being a -stable 2-D polynomial, which are related respectively to deadbeat and asymptotic control problems of 2-D systems, are first considered. By generalizing the concepts of factor coprimeness, zero coprimeness and zero skew primeness in the 2-D polynomial ring to the ring of causal -stable 2-D rational functions, a constructive solution of these two problems mentioned is proposed. Based on these results, we derive a solvability condition for the bilateral equiation whereC is a general 2-D polynomial matrix. The general solutions are investigated as well.     

Training a Hidden Markov Model with a Bayesian Spiking Neural Network

It is of some interest to understand how statistically based mechanisms for signal processing might be integrated with biologically motivated mechanisms such as neural networks. This paper explores a novel hybrid approach for classifying segments of sequential data, such as individual spoken works. The approach combines a hidden Markov model (HMM) with a spiking neural network (SNN). The HMM, consisting of states and transitions, forms a fixed backbone with nonadaptive transition probabilities. The SNN, however, implements a biologically based Bayesian computation that derives from the spike timing-dependent plasticity (STDP) learning rule. The emission (observation) probabilities of the HMM are represented in the SNN and trained with the STDP rule. A separate SNN, each with the same architecture, is associated with each of the states of the HMM. Because of the STDP training, each SNN implements an expectation maximization algorithm to learn the emission probabilities for one HMM state. The model was studied on synthesized spike-train data and also on spoken word data. Preliminary results suggest its performance compares favorably with other biologically motivated approaches. Because of the model’s uniqueness and initial promise, it warrants further study. It provides some new ideas on how the brain might implement the equivalent of an HMM in a neural circuit.     

A fundamental theorem of algebra, spectral factorization, and stability of two-dimensional systems

In his doctoral dissertation in 1797, Gauss proved the fundamental theorem of algebra, which states that any one-dimensional (1-D) polynomial of degree n with complex coefficients can be factored into a product of n polynomials of degree 1. Since then, it has been an open problem to factorize a two-dimensional (2-D) polynomial into a product of basic polynomials. Particularly for the last three decades, this problem has become more important in a wide range of signal and image processing such as 2-D filter design and 2-D wavelet analysis. In this paper, a fundamental theorem of algebra for 2-D polynomials is presented. In applications such as 2-D signal and image processing, it is often necessary to find a 2-D spectral factor from a given 2-D autocorrelation function. In this paper, a 2-D spectral factorization method is presented through cepstral analysis. In addition, some algorithms are proposed to factorize a 2-D spectral factor finely. These are applied to deriving stability criteria of 2-D filters and nonseparable 2-D wavelets and to solving partial difference equations and partial differential equations.     

基于探测过程建模的探地雷达多目标识别

在探地雷达探测过程中,天线相对目标的远近变化反映在面向深度的一维时域信号（A-scan）所组成的序列的变化过程中,由此提出一种针对变化过程建模的目标识别方法。在特征提取环节,提出将时频分析与图像纹理分析相结合,首先计算A-scan信号的二维时频联合分布图像,再利用特定的图像纹理描述算子构造特征向量。识别过程根据目标与天线间距离的变化,采用无跨越单向连续隐马尔可夫模型（HMM）对序列的变化过程建模。实验表明这种基于变化过程的HMM方法比无序地利用单条A-scan特征的支持向量机方法具有更好的效果。     

Hidden Markov Models With Stick-Breaking Priors

The number of states in a hidden Markov model (HMM) is an important parameter that has a critical impact on the inferred model. Bayesian approaches to addressing this issue include the nonparametric hierarchical Dirichlet process, which does not extend to a variational Bayesian (VB) solution. We present a fully conjugate, Bayesian approach to determining the number of states in a HMM, which does have a variational solution. The infinite-state HMM presented here utilizes a stick-breaking construction for each row of the state transition matrix, which allows for a sparse utilization of the same subset of observation parameters by all states. In addition to our variational solution, we discuss retrospective and collapsed Gibbs sampling methods for MCMC inference. We demonstrate our model on a music recommendation problem containing 2250 pieces of music from the classical, jazz, and rock genres.     

Optimal error exponents in hidden Markov models order estimation

We consider the estimation of the number of hidden states (the order) of a discrete-time finite-alphabet hidden Markov model (HMM). The estimators we investigate are related to code-based order estimators: penalized maximum-likelihood (ML) estimators and penalized versions of the mixture estimator introduced by Liu and Narayan (1994). We prove strong consistency of those estimators without assuming any a priori upper bound on the order and smaller penalties than previous works. We prove a version of Stein's lemma for HMM order estimation and derive an upper bound on underestimation exponents. Then we prove that this upper bound can be achieved by the penalized ML estimator and by the penalized mixture estimator. The proof of the latter result gets around the elusive nature of the ML in HMM by resorting to large-deviation techniques for empirical processes. Finally, we prove that for any consistent HMM order estimator, for most HMM, the overestimation exponent is .     

Comparison of Khasi Speech Representations with Different Spectral Features and Hidden Markov States

In this paper, we present a comparison of Khasi speech representations with four different spectral features and novel extension towards the development of Khasi speech corpora. These four features include linear predictive coding (LPC), linear prediction cepstrum coefficient (LPCC), perceptual linear prediction (PLP), and Mel frequency cepstral coefficient (MFCC). The 10-hour speech data were used for training and 3-hour data for testing. For each spectral feature, different hidden Markov model (HMM) based recognizers with variations in HMM states and different Gaussian mixture models (GMMs) were built. The performance was evaluated by using the word error rate (WER). The experimental results show that MFCC provides a better representation for Khasi speech compared with the other three spectral features.