Non-temporal Mutliple Silhouettes in Hidden Markov Model for View Independent Posture Recognition

Computational cancer phylogenetics can play an important role in delineating possible tumor progression pathways and identifying molecular subtypes and mechanisms of action. We previously developed a pipeline for constructing tumor phylogenies from recurring cell types computationally inferred from whole genome copy number data. The accuracy and detail of these tumor phylogenies, however, depends on the identification of accurate and high-resolution molecular markers of progression, i.e., reproducible regions of copy number variation that can be used to robustly differentiate different subtypes and stages of progression. Here we present a new method for the problem using hidden Markov models (HMMs) to derive robust, high resolution progression markers from sets of tumor samples. We demonstrate our method on a publicly available array comparative genome hybridization (aCGH) dataset (NCBI GEO GSE16672, Navin et al., 2010) from sectioned primary ductal breast tumors. Our method uses an HMM, a class of probabilistic models, to classify sets of aCGH data into a partitioning of samples into normal (diploid) or amplified at each copy number probe. It differs from other similar HMM methods primarily in seeking a parsimonious set of combinations of amplification states able to explain all aCGH profiles simultaneously in order to identify robust markers of progression across samples. The model learns frequencies with which different combinations of amplifications are observed across the samples by modeling individual probes as Gaussian random variables with either normal or tetraploid means, with data more consistent with tetraploid being classified as amplified and those more consistent with diploid classified as normal. To handle a combinatorial explosion in combinations of amplification states with increasing numbers of samples, the method introduces a Gibbs sampling algorithm to learn a parsimonious model of the most frequently occurring combinations of amplification states. We applied our methods to a previously constructed set of inferred cell types derived from the Navin et al. data (Tolliver et al., 2010) and to a comparison set of 9 random samples from the raw aCGH data. We validated our model relative to manual labeling of amplicons on the same data. In both experiments, the HMM method was able to pick up significantly larger numbers of robustly amplified segments per chromosome than did prior methods or manual analysis. The resulting segments can be directly fed into downstream analysis routines for phylogeny inference or other predictions. In future work, the HMM method may be improved by fine-tuning the underlying model for copy number variation. Citation Format: {Authors}. {Abstract title} [abstract]. In: Proceedings of the 103rd Annual Meeting of the American Association for Cancer Research; 2012 Mar 31-Apr 4; Chicago, IL. Philadelphia (PA): AACR; Cancer Res 2012;72(8 Suppl):Abstract nr 3964. doi:1538-7445.AM2012-3964

Speech to Text was one of speech recognition applications which speech signal was processed, recognized and converted into a textual representation. Hidden Markov Model (HMM) was the widely used method in speech recognition. However, the level of accuracy using HMM was strongly influenced by the optimalization of extraction process and modellling methods. Hence in this research, the use of genetic algorithm (GA) method to optimize the Ergodic HMM was tested. In Hybrid HMM-GA, GA was used to optimize the Baum-welch method in the training process. It was useful to improve the accuracy of the recognition result which is produced by the HMM parameters that generate the low accuracy when the HMM are tested. Based on the research, the percentage increases the level of accuracy of 20% to 41%. Proved that the combination of GA in HMM method can gives more optimal results when compared with the HMM system that not combine with any method.

A codebook design method for Hidden Markov Model (HMM) by using a Centroid Neural Network (CNN) is applied to a Korean monophone recognition problem in this paper. In order to alleviate the accuracy degradation problem in tied mixture HMM (TMHMM), this paper utilizes a clustering algorithm, called Centroid Neural Network with State Dependence measure (CNN(SD)), for TMHMMs. The CNN(SD) uses a novel distance measure that discriminates between two observation densities in the HMM from the same state and those from different states. When compared with other conventional unsupervised neural networks, the CNN(SD) successfully allocates more code vectors to the regions where Gaussian Probability Density Function (GPDF) data of different states overlap each other while it allocates fewer code vectors to the regions where GPDF data are from the same states. Experiments and results on a Korean monophone data, the CNN(SD) shows improvements on the recognition accuracy over CNN and the traditional k-means algorithm.

Facies identification from basic well logs is essential for optimizing well operation or constructing reservoir model. The sequential nature of well log data makes the Hidden Markov Model (HMM) a suitable unsupervised machine learning approach for clustering. This study investigates the effectiveness of HMM combined with window filtering for unsupervised facies detection and compares its performance with the widely used K-Means Clustering (KMC) method. Synthetic gamma ray (GR), density (DEN), and neutron (NEU) logs, along with geologist-guided facies in a channel depositional environment, were used as input data. HMM identifies facies by modeling hidden geological states based on sequential well log data. Transition probabilities capture facies relationship across depths. A mode-based moving window filter smoothed the initial results by reducing fluctuations, while preserving facies boundaries. Validation was performed by comparing the results with reference facies using accuracy, adjusted rand index (ARI), normalized mutual information (NMI), and visual assessment. Both HMM and KMC clustering revealed thin non-geological facies, primarily at the facies boundaries. In the middle of facies, HMM mitigated thin facies more effectively than KMC. These thin facies arose from fluctuations in the well logs. Visually, HMM provided more geologically realistic results, despite KMC sometimes showed slightly better performance metrics. To address thin artificial facies, a moving window filter was applied. This slightly improved clustering performance metrics but significantly enhanced geological consistency by removing most artificial facies at boundaries or within facies, particularly in the smoothed HMM. Smoothed HMM achieved slightly better or comparable accuracy and NMI to smoothed KMC. However, minor thin facies persisted in both methods, more notably in KMC, due to significant well log fluctuations. The filter effectively smoothed the facies by reducing variations in thin facies across small depth intervals, ultimately enhancing the facies continuity. This improved facies distribution coherency with geological expectation, particularly for the smoothed HMM. HMM with post-processing plays a crucial role in identifying geologically consistent facies while maintaining or slightly improving clustering performance metrics. Unsupervised machine learning that incorporates sequential information is vital for facies clustering from well log data. The proposed workflow which integrates HMM with window filtering, enhances clustering outcomes by producing more geologically consistent result and more interpretable facies. This approach aids geoscientists in reservoir characterization and modeling, enabling more informed decision-making.

This paper highlights the need for intelligent analysis of students’ behavioral states in physical education tasks. The hand-ring inertial data is used to identify students’ motion sequence states. First, statistical feature extraction is performed based on the acceleration and angular velocity data collected from the bracelet. After completing the filtering and noise reduction of the data, we perform feature extraction by Back Propagation Neural Network (BPNN) and use the sliding window method for analysis. Finally, the classification capability of the model sequence is enhanced by the Hidden Markov Model (HMM). The experimental results indicate that the classification accuracy of student action sequences in physical education exceeds 96% after optimization by the HMM method. This provides intelligent means and new ideas for future student state recognition in physical education and teaching reform.

The central nervous system (CNS) plays an important role in regulation of human gait. Parkinson's disease (PD) is a common neurodegenerative disease that may cause neurophysiologic change in the CNS and as a result change the gait cycle duration (stride interval). This article used the Hidden Markov Model (HMM) with Gaussian Mixtures to separate the patients with PD from healthy subjects. The results showed that the performance of the HMM classifier in classifying the gait data corresponding to 16 healthy and 15 PD subjects is comparable to the results obtained from the least squares support vector machine (LS-SVM) classifier. In this study, the leave-one-out cross-validation method was used to evaluate the performance of each classifier. The HMM method could effectively separate the gait data in terms of stride interval obtained from healthy subjects and PD patients with an accuracy rate of 90.3 % . All in all, the results showed that the proposed method can be used for distinguishing PD patients from healthy subjects based on the gait data classification.

A method is presented for using hidden Markov models (HMMs) for the analysis of force, torque, and position signals from sensors in manufacturing machines. The HMM can detect the transitions between contact states and compute a measure of the task quality using a model of the task developed by the manufacturing engineer and optimized on training data. The HMM method has been evaluated in extensive experimentation with teleoperation and the results suggest even higher effectiveness in automation and manufacturing applications. >

Face recognition based on multi-class mapping of Fisher scores

Hidden Markov models (HMMs) are now widely used for off-line handwriting recognition in many languages and, in particular, in Arabic. As in speech recognition, they are usually built from shared, embedded HMMs at the symbol level, in which state-conditional probability density functions are modeled with Gaussian mixtures. In contrast to speech recognition, however, it is unclear which kinds of features should be used and, indeed, very different feature sets are in use today. Among them, we have recently proposed to simply use columns of raw, binary image pixels, which are directly fed into embedded Bernoulli (mixture) HMMs, that is, embedded HMMs in which the emission probabilities are modeled with Bernoulli mixtures. The idea is to bypass feature extraction and ensure that no discriminative information is filtered out during feature extraction, which in some sense is integrated into the recognition model. In this chapter, we review this idea along with some extensions that are currently providing state-of-the-art results on Arabic handwritten word recognition.

Hidden Markov models (HMMs) are probabilistic functions of finite Markov chains, or, put in other words, state space models with finite state space. In this paper, we examine subspace estimation methods for HMMs whose output lies a finite set as well. In particular, we study the geometric structure arising from the nonminimality of the linear state space representation of HMMs, and consistency of a subspace algorithm arising from a certain factorization of the singular value decomposition of the estimated linear prediction matrix. For this algorithm, we show that the estimates of the transition and emission probability matrices are consistent up to a similarity transformation, and that the m-step linear predictor computed from the estimated system matrices is consistent, i.e., converges to the true optimal linear m-step predictor.

This paper presents a minimum generation error (MGE) training method for hidden Markov model (HMM) based prediction of articulatory movements when both text and audio inputs are given. In this method, MGE criterion is adopted to replace the maximum likelihood (ML) criterion to estimate model parameters for the unified acoustic-articulatory HMMs. Different from the MGE training for HMM-based acoustic speech synthesis, the generation error used here is defined as the distance between the generated and natural articulatory features. Experimental results show that our proposed method can improve the accuracy of articulatory movement prediction significantly. The average root mean square (RMS) error reduces from 1.002 mm to 0.913 mm on the test set.

Speech emotion recognition as a significant part has become a challenge to artificial emotion. It is particularly difficult to recognize emotion independent of the person concentrating on the speech channel. In the paper, an integrated system of hidden Markov model (HMM) and support vector machine (SVM), which combining advantages on capability to dynamic time warping of HMM and pattern recognition of SVM, has been proposed to implement speaker independent emotion classification. Firstly, all emotions are divided into two groups by SVM. Then, HMMs are used to discriminate emotions from each group. For a more robust estimation, we also combine four HMMs classifiers into a system. The recognition result of the fusion system has been compared with the isolated HMMs using Mandarin database. Experimental results demonstrate that comparing with the method based on only HMMs, the proposed system is more effective and the average recognition rate reaches 76.1% when speaker is independent.

There are strong evidences of that multimodal biometric score fusion can significantly improve human identification performance. Score level fusion usually involves score normalization, score fusion, and fusion decision. There are several types of score fusion methods, direct combination of fusion scores, classifier-based fusion, and density-based fusion. The real applications require achieving greater reliability in determining or verifying person's identity. The goal of this research is to improve the accuracy and robustness of human identification by using multimodal biometrics score fusion. The accuracy means high verification rate if tested on a closed dataset, or a high genuine accept rate under low false accept rate if tested on an open dataset. While the robustness means the fusion performance is stable with variant biometric scores. We propose a hidden Markov model (HMM) for multiple score fusion, where the biometric scores include multimodal scores and multi-matcher scores. The state probability density functions in a HHM model are estimated by Gaussian mixture model. The proposed HMM model for multiple score fusion is accurate for identification, flexible and reliable with biometrics. The proposed HMM method are tested on three NIST-BSSR1 multimodal databases and on three face-score databases. The results show the HMM method is an excellent and reliable score fusion method.

In this paper, we briefly compare the performance of gene finding methods which are based on hidden Markov models (HMMs) and digital signal processing (DSP). We apply the methods to three benchmark datasets consisting of sequences from various species (mammalian, vertebrate and non-vertebrate) to investigate the strength and weakness of these two classes of methods from different aspects. We study the effect of training on the HMM-based methods. In addition, we analyze the effect of the threshold and window length parameters on the performance of the DSP-based methods. In our work, we present the receiver operating characteristic (ROC) plots of the DSP-based methods and the numerical results of applying the HMM and DSP-based methods to the three datasets. In addition, the plots of the prediction accuracy of the DSP-based methods when they are applied to exons of specific lengths and with different values of the window length parameter are presented in this study.

Motivation: One of the most successful methods to date for recognizing protein sequences that are evolutionarily related has been profile hidden Markov models (HMMs). However, these models do not capture pairwise statistical preferences of residues that are hydrogen bonded in beta sheets. These dependencies have been partially captured in the HMM setting by simulated evolution in the training phase and can be fully captured by Markov random fields (MRFs). However, the MRFs can be computationally prohibitive when beta strands are interleaved in complex topologies. We introduce SMURFLite, a method that combines both simplified MRFs and simulated evolution to substantially improve remote homology detection for beta structures. Unlike previous MRF-based methods, SMURFLite is computationally feasible on any beta-structural motif.Results: We test SMURFLite on all propeller and barrel folds in the mainly-beta class of the SCOP hierarchy in stringent cross-validation experiments. We show a mean 26% (median 16%) improvement in area under curve (AUC) for beta-structural motif recognition as compared with HMMER (a well-known HMM method) and a mean 33% (median 19%) improvement as compared with RAPTOR (a well-known threading method) and even a mean 18% (median 10%) improvement in AUC over HHPred (a profile–profile HMM method), despite HHpred's use of extensive additional training data. We demonstrate SMURFLite's ability to scale to whole genomes by running a SMURFLite library of 207 beta-structural SCOP superfamilies against the entire genome of Thermotoga maritima, and make over a 100 new fold predictions.Availability and implementaion: A webserver that runs SMURFLite is available at: http://smurf.cs.tufts.edu/smurflite/Contact: lenore.cowen@tufts.edu; bab@mit.edu