改进的contourlet变换域隐马尔可夫树模型

Contourlet域隐马尔科夫树(C_HMT)模型不但可以描述尺度间的相关性,而且可以对方向子带间contourlet系数的相关性做出统计描述,是一种比小波域HMT模型更为有效的系数相关性描述方法.本文提出了一种改进的contourlet变换域HMT模型,节点的状态不只依赖于其父节点的状态,而且兼顾到其父节点相邻节点的状态.这种模型可以进一步捕捉尺度间contourlet变换系数更为丰富的相关性,从而能够更准确和有效的刻画contourlet变换系数的非高斯性和持续性.将该模型应用于图像的去噪,并与另外几种典型的去噪算法作定性比较,验证了本文提出的改进的C_HMT模型在图像去噪性能方面有一定的优越性.     

Partially hidden Markov models

Partially hidden Markov models (PHMM) are introduced. They differ from the ordinary HMMs in that both the transition probabilities of the hidden states and the output probabilities are conditioned on past observations. As an illustration they are applied to black and white image compression where the hidden variables may be interpreted as representing noncausal pixels     

Universal classification for hidden Markov models

Binary hypotheses testing using empirically observed statistics is studied in the Neyman-Pearson formulation for the hidden Markov model (HMM). An asymptotically optimal decision rule is proposed and compared to the generalized likelihood ratio test (GLRT), which has been shown in earlier studies to be asymptotically optimal for simpler parametric families. The proof of the main theorem is provided. The result can be applied to several types of HMMs commonly used in speech recognition and communication applications. Several applications are demonstrated     

Training approach for hidden Markov models

The authors propose a new training approach based on maximum model distance (MMD) for HMMs. MMD uses the entire training set to estimate the parameters of each HMM, while the traditional maximum likelihood (ML) only uses those data labelled for the model. Experimental results showed that significant error reduction can be achieved through the proposed approach. In addition, the relationship between MMD and corrective training was discussed, and we have proved that the corrective training is a special case of the MMD approach     

Phoneme classification using semicontinuous hidden Markov models

Speaker-dependent phoneme recognition experiments were conducted using variants of the semicontinuous hidden Markov model (SCHMM) with explicit state duration modeling. Results clearly demonstrated that the SCHMM with state duration offers significantly improved phoneme classification accuracy compared to both the discrete HMM and the continuous HMM; the error rate was reduced by more than 30% and 20%, respectively. The use of a limited number of mixture densities significantly reduced the amount of computation. Explicit state duration modeling further reduced the error rate     

ECG signal analysis through hidden Markov models

This paper presents an original hidden Markov model (HMM) approach for online beat segmentation and classification of electrocardiograms. The HMM framework has been visited because of its ability of beat detection, segmentation and classification, highly suitable to the electrocardiogram (ECG) problem. Our approach addresses a large panel of topics some of them never studied before in other HMM related works: waveforms modeling, multichannel beat segmentation and classification, and unsupervised adaptation to the patient's ECG. The performance was evaluated on the two-channel QT database in terms of waveform segmentation precision, beat detection and classification. Our waveform segmentation results compare favorably to other systems in the literature. We also obtained high beat detection performance with sensitivity of 99.79% and a positive predictivity of 99.96%, using a test set of 59 recordings. Moreover, premature ventricular contraction beats were detected using an original classification strategy. The results obtained validate our approach for real world application.     

Asymptotic smoothing errors for hidden Markov models

In this paper, the asymptotic smoothing error for hidden Markov models (HMMs) is investigated using hypothesis testing ideas. A family of HMMs is studied parametrised by a positive constant /spl epsiv/, which is a measure of the frequency of change. Thus, when /spl epsiv//spl rarr/0, the HMM becomes increasingly slower moving. We show that the smoothing error is O(/spl epsiv/). These theoretical predictions are confirmed by a series of simulations.     

Reduced-complexity estimation for large-scale hidden Markov models

In this paper, we address the problem of reduced-complexity estimation of general large-scale hidden Markov models (HMMs) with underlying nearly completely decomposable discrete-time Markov chains and finite-state outputs. An algorithm is presented that computes O(/spl epsi/) (where /spl epsi/ is the related weak coupling parameter) approximations to the aggregate and full-order filtered estimates with substantial computational savings. These savings are shown to be quite large when the chains have blocks with small individual dimensions. Some simulation studies are presented to demonstrate the performance of the algorithm.     

Recursive algorithms for estimation of hidden Markov models andautoregressive models with Markov regime

This paper is concerned with recursive algorithms for the estimation of hidden Markov models (HMMs) and autoregressive (AR) models under the Markov regime. Convergence and rate of convergence results are derived. Acceleration of convergence by averaging of the iterates and the observations are treated. Finally, constant step-size tracking algorithms are presented and examined     

On the first order equalization of hidden Markov models

The article exploits some properties of the “first order equalization” technique, used to increase the recognition performance of speech. It shows that if the eigenvalues of the covariance matrix of observations are restricted, then a solution exists for this problem, although it may not be unique,     

Adaptation scheme for hidden Markov models in noisy speechrecognition

Shrinkage of the mean vectors and the variances in HMM due to additive white noise is an important issue for the speech recogniser. By giving an assumed relation between the adaptation factors for mean vector and variances, an optimal adaptation factor can be found by using the maximum likelihood method     

Multiscale image segmentation using wavelet-domain hidden Markovmodels

We introduce a new image texture segmentation algorithm, HMTseg, based on wavelets and the hidden Markov tree (HMT) model. The HMT is a tree-structured probabilistic graph that captures the statistical properties of the coefficients of the wavelet transform. Since the HMT is particularly well suited to images containing singularities (edges and ridges), it provides a good classifier for distinguishing between textures. Utilizing the inherent tree structure of the wavelet HMT and its fast training and likelihood computation algorithms, we perform texture classification at a range of different scales. We then fuse these multiscale classifications using a Bayesian probabilistic graph to obtain reliable final segmentations. Since HMTseg works on the wavelet transform of the image, it can directly segment wavelet-compressed images without the need for decompression into the space domain. We demonstrate the performance of HMTseg with synthetic, aerial photo, and document image segmentations.     

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 .     

Planar shape recognition based on hidden Markov models

A new deformed shape recognition method based on hidden Markov models (HMMs), which is very resistant against transformations and non-rigid deformations, is presented. Since shape features are not referred to an absolute point, the method is also resistant to severe shape distortions. The method has been successfully tested using different databases     

Curvature based image recognition using hidden Markov models

A new deformed shape recognition method that relies on hidden Markov models to evaluate the sequentiality of the relevant points of the shape is proposed. These points are extracted from its adaptively calculated curvature function to give stability against noise transformations and deformations. The proposed method is very fast. Comparative tests for different shapes have been successful.     

Color image retrieval based on hidden Markov models

In this correspondence, a new approach to retrieving images from a color image database is proposed. Each image in the database is represented by a two-dimensional pseudo-hidden Markov model (2-D PHMM), which characterizes the chromatic and spatial information about the image. In addition, a flexible pictorial querying method is used, by which users can paint the rough content of the desired images in a query picture. Image matching is achieved by comparing the query picture with each 2-D PHMM in the database. Experimental results show that the proposed approach is indeed effective.     

Combining hidden Markov source models and parallel concatenatedcodes

We present here a framework for modifying a decoder for parallel concatenated codes to incorporate a general hidden Markov source model. This allows the receiver to utilize the statistical characteristics of the source during the decoding process, and leads to significantly improved performance relative to systems in which source statistics are not exploited. One of the constituent decoders makes use of a modified trellis which jointly describes the source and the encoder. The number of states in this modified trellis is the product of the number of states in the hidden Markov source and the number of states in the encoder     

Infinite hidden Markov models for unusual-event detection in video.

We address the problem of unusual-event detection in a video sequence. Invariant subspace analysis (ISA) is used to extract features from the video, and the time-evolving properties of these features are modeled via an infinite hidden Markov model (iHMM), which is trained using "normal"/"typical" video. The iHMM retains a full posterior density function on all model parameters, including the number of underlying HMM states. Anomalies (unusual events) are detected subsequently if a low likelihood is observed when associated sequential features are submitted to the trained iHMM. A hierarchical Dirichlet process framework is employed in the formulation of the iHMM. The evaluation of posterior distributions for the iHMM is achieved in two ways: via Markov chain Monte Carlo and using a variational Bayes formulation. Comparisons are made to modeling based on conventional maximum-likelihood-based HMMs, as well as to Dirichlet-process-based Gaussian-mixture models.     

基于不同隐马尔科夫模型的图像识别方法

为了更详细地研究隐马尔科夫模型在图像识别中的应用,以指纹识别为例,纵向总结了几种基于隐马尔科夫模型的指纹图像识别算法,包括一维隐马尔科夫模型、伪二维隐马尔科夫模型、二维模型及一维模型组。分别从时间复杂度、识别精确度等方面总结出这四种隐马尔科夫模型在图像识别时的优缺点,得出不同待识别图像适合使用的识别模型的结论。     

Image segmentation using hidden Markov Gauss mixture models.

Image segmentation is an important tool in image processing and can serve as an efficient front end to sophisticated algorithms and thereby simplify subsequent processing. We develop a multiclass image segmentation method using hidden Markov Gauss mixture models (HMGMMs) and provide examples of segmentation of aerial images and textures. HMGMMs incorporate supervised learning, fitting the observation probability distribution given each class by a Gauss mixture estimated using vector quantization with a minimum discrimination information (MDI) distortion. We formulate the image segmentation problem using a maximum a posteriori criteria and find the hidden states that maximize the posterior density given the observation. We estimate both the hidden Markov parameter and hidden states using a stochastic expectation-maximization algorithm. Our results demonstrate that HMGMM provides better classification in terms of Bayes risk and spatial homogeneity of the classified objects than do several popular methods, including classification and regression trees, learning vector quantization, causal hidden Markov models (HMMs), and multiresolution HMMs. The computational load of HMGMM is similar to that of the causal HMM.