A comparative evaluation of neural networks and hidden Markov models for monitoring turning tool wear

Condition monitoring of machine tool inserts is important for increasing the reliability and quality of machining operations. Various methods have been proposed for effective tool condition monitoring (TCM), and currently it is generally accepted that the indirect sensor-based approach is the best practical solution to reliable TCM. Furthermore, in recent years, neural networks (NNs) have been shown to model successfully, the complex relationships between input feature sets of sensor signals and tool wear data. NNs have several properties that make them ideal for effectively handling noisy and even incomplete data sets. There are several NN paradigms which can be combined to model static and dynamic systems. Another powerful method of modeling noisy dynamic systems is by using hidden Markov models (HMMs), which are commonly employed in modern speech-recognition systems. The use of HMMs for TCM was recently proposed in the literature. Though the results of these studies were quite promising, no comparative results of competing methods such as NNs are currently available. This paper is aimed at presenting a comparative evaluation of the performance of NNs and HMMs for a TCM application. The methods are employed on exactly the same data sets obtained from an industrial turning operation. The advantages and disadvantages of both methods are described, which will assist the condition-monitoring community to choose a modeling method for other applications.     

Diagnostic tools for evaluating and updating hidden Markov models

In this paper we consider two related problems in hidden Markov models (HMMs). One, how the various parameters of an HMM actually contribute to predictions of state sequences and spatio-temporal pattern recognition. Two, how the HMM parameters (and associated HMM topology) can be updated to improve performance. These issues are examined in the context of four different experimental settings from pure simulations to observed data. Results clearly demonstrate the benefits of applying some critical tests on the model parameters before using it as a predictor or spatio-temporal pattern recognition technique.     

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.     

Myocardial infarction classification with multi-lead ECG using hidden Markov models and Gaussian mixture models

This study presented a new diagnosis system for myocardial infarction classification by converting multi-lead ECG data into a density model for increasing accuracy and flexibility of diseases detection. In contrast to the traditional approaches, a hybrid system with HMMs and GMMs was employed for data classification. A hybrid approach using multi-leads, i.e., lead-V1, V2, V3 and V4 for myocardial infarction were developed and HMMs were used not only to find the ECG segmentations but also to calculate the log-likelihood value which was treated as statistical feature data of each heartbeat's ECG complex. The 4-dimension feature vector extracted by HMMs was clustered by GMMs with different numbers of distribution (disease and normal data). SVMs classifier was also examined for comparison with our system in experimental result. There were total 1129 samples of heartbeats from clinical data, including 582 data with myocardial infarction and 547 normal data. The sensitivity of this diagnosis system achieved 85.71%, specificity achieved 79.82% and accuracy achieved 82.50% statistically.     

Robot introspection through learned hidden Markov models

In this paper we describe a machine learning approach for acquiring a model of a robot behaviour from raw sensor data. We are interested in automating the acquisition of behavioural models to provide a robot with an introspective capability. We assume that the behaviour of a robot in achieving a task can be modelled as a finite stochastic state transition system.Beginning with data recorded by a robot in the execution of a task, we use unsupervised learning techniques to estimate a hidden Markov model (HMM) that can be used both for predicting and explaining the behaviour of the robot in subsequent executions of the task. We demonstrate that it is feasible to automate the entire process of learning a high quality HMM from the data recorded by the robot during execution of its task.The learned HMM can be used both for monitoring and controlling the behaviour of the robot. The ultimate purpose of our work is to learn models for the full set of tasks associated with a given problem domain, and to integrate these models with a generative task planner. We want to show that these models can be used successfully in controlling the execution of a plan. However, this paper does not develop the planning and control aspects of our work, focussing instead on the learning methodology and the evaluation of a learned model. The essential property of the models we seek to construct is that the most probable trajectory through a model, given the observations made by the robot, accurately diagnoses, or explains, the behaviour that the robot actually performed when making these observations. In the work reported here we consider a navigation task. We explain the learning process, the experimental setup and the structure of the resulting learned behavioural models. We then evaluate the extent to which explanations proposed by the learned models accord with a human observer's interpretation of the behaviour exhibited by the robot in its execution of the task.     

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.     

Sentiment analysis incorporating convolutional neural network into hidden Markov model

The analysis of sentiments and mining of opinions have become more and more important in years because of the development of social media technologies. The methods that utilize natural language processing and lexicon-based sentiment analysis techniques to analyze people's opinions in texts require the proper extraction of sentiment words to ensure accuracy. The current issue is tackled with a novel perspective in this paper by introducing a hybrid sentiment analysis technique. This technique brings together Convolutional Neural Network (CNN) and Hidden Markov Models (HMMs), to accurately categorize text data and pinpoint feelings. The proposed method involves 1D convolutional-layer CNN to extract hidden features from comments and applying HMMs on a feature-sentence matrix, allowing for the utilization of word sequences in extracting opinions. The method effectively captures diverse text patterns by extracting a range of features from texts using CNN. Text patterns are learned using text HMM by calculating the probabilities between sequences of feature vectors and clustering feature vectors. The paper's experimental evaluation employs benchmark datasets such as CR, MR, Subj, and SST2, demonstrating that the proposed method surpasses existing sentiment analysis techniques and traditional HMMs. One of its strengths is to analyze a range of text patterns and identify crucial features that recognize the emotion of different pieces of a sentence. Additionally, the research findings highlight the improved performance of sentiment analysis tasks through the strategic use of zero padding in conjunction with the masking technique.     

Almost sure parameter estimation and convergence rates for hidden Markov models

A continuous-time version of Kronecker's Lemma is established and used to give rates of convergence for parameter estimates in hidden Markov models.     

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.     

Dynamic clustering of energy markets: An extended hidden Markov approach

This paper studies the synchronization of energy markets using an extended hidden Markov model that captures between- and within-heterogeneity in time series by defining clusters and hidden states, respectively. The model is applied to U.S. data in the period from 1999 to 2012. While oil and natural gas returns are well portrayed by two volatility states, electricity markets need three additional states: two transitory and one to capture a period of abnormally high volatility. Although some states are common to both clusters, results favor the segmentation of energy markets as they are not in the same state at the same time.     

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.     

Efficient backward decoding of high-order hidden Markov models

The forward-backward search (FBS) algorithm [S. Austin, R. Schwartz, P. Placeway, The forward-backward search algorithm, in: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, 1991, pp. 697-700] has resulted in increases in speed of up to 40 in expensive time-synchronous beam searches in hidden Markov model (HMM) based speech recognition [R. Schwartz, S. Austin, Efficient, high-performance algorithms for N-best search, in: Proceedings of the Workshop on Speech and Natural Language, 1990, pp. 6-11; L. Nguyen, R. Schwartz, F. Kubala, P. Placeway, Search algorithms for software-only real-time recognition with very large vocabularies, in: Proceedings of the Workshop on Human Language Technology, 1993, pp. 91-95; A. Sixtus, S. Ortmanns, High-quality word graphs using forward-backward pruning, in: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, 1999, pp. 593-596]. This is typically achieved by using a simplified forward search to decrease computation in the following detailed backward search. FBS implicitly assumes that forward and backward searches of HMMs are computationally equivalent. In this paper we present experimental results, obtained on the CallFriend database, that show that this assumption is incorrect for conventional high-order HMMs. Therefore, any improvement in computational efficiency that is gained by using conventional low-order HMMs in the simplified backward search of FBS is lost.This problem is solved by presenting a new definition of HMMs termed a right-context HMM, which is equivalent to conventional HMMs. We show that the computational expense of backward Viterbi-beam decoding right-context HMMs is similar to that of forward decoding conventional HMMs. Though not the subject of this paper, this allows us to more efficiently decode high-order HMMs, by capitalising on the improvements in computational efficiency that is obtained by using the FBS algorithm.     

Image denoising in extended Shearlet domain using hidden Markov tree models

Denoising of images is one of the most basic tasks of image processing. It is a challenging work to design an edge-preserving image denoising scheme. Extended discrete Shearlet transform (extended DST) is an effective multi-scale and multi-direction analysis method; it not only can exactly compute the Shearlet coefficients based on a multiresolution analysis, but also can provide nearly optimal approximation for a piecewise smooth function. In this paper, a new image denoising approach in extended Shearlet domain using hidden Markov tree (HMT) model is proposed. Firstly, the joint statistics and mutual information of the extended DST coefficients are studied. Then, the extended DST coefficients are modeled using an HMT model with Gaussian mixtures, which can effectively capture the intra-scale and inter-scale dependencies. Finally, the extended Shearlet HMT model is applied to image denoising. Extensive experimental results demonstrate that our extended Shearlet HMT denoising method can obtain better performances in terms of both subjective and objective evaluations than other state-of-the-art HMT denoising techniques. Especially, the proposed method can preserve edges very well while removing noise.     

Risk-sensitive filtering and smoothing for hidden Markov models

In this paper, we address the problem of risk-sensitive filtering and smoothing for discrete-time Hidden Markov Models (HMM) with finite-discrete states. The objective of risk-sensitive filtering is to minimise the expectation of the exponential of the squared estimation error weighted by a risk-sensitive parameter. We use the so-called Reference Probability Method in solving this problem. We achieve finite-dimensional linear recursions in the information state, and thereby the state estimate that minimises the risk-sensitive cost index. Also, fixed-interval smoothing results are derived. We show that L₂ or risk-neutral filtering for HMMs can be extracted as a limiting case of the risk-sensitive filtering problem when the risk-sensitive parameter approaches zero.     

Modeling and recognition of cursive words with hidden Markov models

In this paper, a new method for modeling and recognizing cursive words with hidden Markov models (HMM) is presented. In the proposed method, a sequence of thin fixed-width vertical frames are extracted from the image, capturing the local features of the handwriting. By quantizing the feature vectors of each frame, the input word image is represented as a Markov chain of discrete symbols. A handwritten word is regarded as a sequence of characters and optional ligatures. Hence, the ligatures are also explicitly modeled. With this view, an interconnection network of character and ligature HMMs is constructed to model words of indefinite length. This model can ideally describe any form of handwritten words, including discretely spaced words, pure cursive words and unconstrained words of mixed styles. Experiments have been conducted with a standard database to evaluate the performance of the overall scheme. The performance of various search strategies based on the forward and backward score has been compared. Experiments on the use of a preclassifier based on global features show that this approach may be useful for even large-vocabulary recognition tasks.