Learning hidden Markov models from the state distribution oracle

With the advent of 5G communication networks, the number of devices on the core 5G network significantly increases.A5Gnetwork is a cloud native, massively connected internet of things (IoT) platform with a huge number of devices hosted on the network now known as massive machine type communication (mMTC). As ultra-low latency is pivotal in developing 5G communication, a proper cell association scheme is now required to meet the load and traffic needs of the new network, opposed to older cell association schemes which were based only on the reference signal received power (RSRP). This paper proposes an unsupervised machine learning algorithm, namely hidden Markov model (HMM) learning on the network's telemetry data, which is used to learn network parameters and select the best eNodeB for cell association. The proposed model uses an HMM learning followed by decoding for selecting the optimal cell for association.

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.

Hidden Markov model (HMM) is a powerful mathematical tool for prediction and recognition. Many computer software products implement HMM and hide its complexity, which assist scientists to use HMM for applied researches. However comprehending HMM in order to take advantages of its strong points requires a lot of efforts. This report is a tutorial on HMM with full of mathematical proofs and example, which help researchers to understand it by the fastest way from theory to practice. The report focuses on three common problems of HMM such as evaluation problem, uncovering problem, and learning problem, in which learning problem with support of optimization theory is the main subject.

Growth in Digital signal processing technology gives positives influences in human life. One of the branch of science that gives significant influence is digital speech processing. It can be expand into some applications that make human life easier. Digital speech processing is appropriate to speech recognition. Speech recognition is used to arrange the movement of remote control car. The remote control car will move according to our speech. This final project is closely related with speech recognition. The LPC (Linear Predictive Coding) method will extract the speech signal features and HMM (Hidden Markov Model) to modelling the speech signal are used. It is done by comparing model from extracting feature that is available in HMM modelling. Models will be used in the speech recognition process, if the models have highest level of conformity. The experiment has been done in two conditions, i.e ideal condition in room wih low noise level and unideal condition in room with noise. Result of the experiment from the whole sistem performace at ideal condition is 97,71% for people that have been inputed in the database, and 95,42% for people which have not been inputed in the database. Result of the experiment of database say it regulary is 97,14%. Result of the experiment of database at unideal condition is 54,28% for inputing word at noisy area, result of the experiment of database for inputing word at high frequency from siren voice is 98,57% and result of the experiment of inputing similar word with database is 97,6% Keywords: speech recognition, LPC, HMM

This paper presents an online/sequential linear regression adaptation framework for hidden Markov model (HMM) based speech recognition. Our attempt is to sequentially improve speaker-independent speech recognition system to handle the nonstationary environments via the linear regression adaptation of HMMs. A quasi-Bayes linear regression (QBLR) algorithm is developed to execute the sequential adaptation where the regression matrix is estimated using QB theory. In the estimation, we specify the prior density of regression matrix as a matrix variate normal distribution and derive the pooled posterior density belonging to the same distribution family. Accordingly, the optimal regression matrix can be easily calculated. Also, the reproducible prior/posterior pair provides a meaningful mechanism for sequential learning of prior statistics. At each sequential epoch, only the updated prior statistics and the current observed data are required for adaptation. The proposed QBLR is a general framework with maximum likelihood linear regression (MLLR) and maximum a posteriori linear regression (MAPLR) as special cases. Experiments on supervised and unsupervised speaker adaptation demonstrate that the sequential adaptation using QBLR is efficient and asymptotical to batch learning using MLLR and MAPLR in recognition performance.

The following chapter can be understood as one sort of brief introduction to the history and basics of the Hidden Markov Models. Hidden Markov Models (HMMs) are learnable finite stochastic automates. Nowadays, they are considered as a specific form of dynamic Bayesian networks. Dynamic Bayesian networks are based on the theory of Bayes (Bayes & Price, 1763). A Hidden Markov Model consists of two stochastic processes. The first stochastic process is a Markov chain that is characterized by states and transition probabilities. The states of the chain are externally not visible, therefore “hidden”. The second stochastic process produces emissions observable at each moment, depending on a state-dependent probability distribution. It is important to notice that the denomination “hidden” while defining a Hidden Markov Model is referred to the states of the Markov chain, not to the parameters of the model. The history of the HMMs consists of two parts. On the one hand there is the history of Markov process and Markov chains, and on the other hand there is the history of algorithms needed to develop Hidden Markov Models in order to solve problems in the modern applied sciences by using for example a computer or similar electronic devices.

This paper presents a Bayesian learning approach to large margin classifier for hidden Markov model (HMM) based speech recognition. We build the Bayesian large margin HMMs (BLM-HMMs) and improve the model generalization for handling unknown test environments. Using BLM-HMMs, the variational Bayesian HMM parameters are estimated by maximizing lower bound of a marginal likelihood over the uncertainties of HMM parameters. The Bayesian large margin estimation is performed with frame selection mechanism, and is illustrated to meet the objective of support vector machines, i.e. maximal class margin and minimal training errors. The new objective function is not only interpreted as a discriminative criterion, but also feasible to deal with model selection and adaptive training. Experiments on phone recognition show that BLM-HMMs perform better than other generative and discriminative models.

The physical safety and well being of the soldiers in a battlefield is the highest priority of Incident Commanders. Currently, the ability to track and monitor soldiers rely on visual and verbal communication which can be somewhat limited in scenarios where the soldiers are deployed inside buildings and enclosed areas that are out of visual range of the commanders. Also, the need for being stealth can often prevent a battling soldier to send verbal clues to a commander about his or her physical well being. Sensor technologies can remotely provide various data about the soldiers including physiological monitoring and personal alert safety system functionality. This paper presents a networked sensing solution in which a body area wireless network of multi-modal sensors can monitor the body movement and other physiological parameters for statistical identification of a soldier's body posture, which can then be indicative of the physical conditions and safety alerts of the soldier in question. The specific concept is to leverage on-body proximity sensing and a Hidden Markov Model (HMM) based mechanism that can be applied for stochastic identification of human body postures using a wearable sensor network. The key idea is to collect relative proximity information between wireless sensors that are strategically placed over a subject's body to monitor the relative movements of the body segments, and then to process that using HMM in order to identify the subject's body postures. The key novelty of this approach is a departure from the traditional accelerometry based approaches in which the individual body segment movements, rather than their relative proximity, is used for activity monitoring and posture detection. Through experiments with body mounted sensors we demonstrate that while the accelerometry based approaches can be used for differentiating activity intensive postures such as walking and running, they are not very effective for identification and differentiation between low activity postures such as sitting and standing. We develop a wearable sensor network that monitors relative proximity using Radio Signal Strength indication (RSSI), and then construct a HMM system for posture identification in the presence of sensing errors. Controlled experiments using human subjects were carried out for evaluating the accuracy of the HMM identified postures compared to a naive threshold based mechanism, and its variations over different human subjects. A large spectrum of target human postures, including lie down, sit (straight and reclined), stand, walk, run, sprint and stair climbing, are used for validating the proposed system.

Basic problems solving for two-dimensional discrete 3 × 4 order hidden markov model

The study reported in this paper represents a continuation of our previous work on the application of Hidden Markov models (HMMs) to the translational and rotational invariant classification of SAR targets. The traditional method of making classification decisions using an HMM does not achieve the desired objective of minimizing the number of misclassifications. We present a novel technique that minimizes the probability of misclassification error. This approach, which is an adaptation of an existing Minimum Classification Error strategy, is globally optimal. The proposed method applies basic principles of pattern recognition to reduce the expected misclassification rate by dynamically perturbing the HMM parameters using a constraint on a cross-entropy measure and distance separation between pairs of HMM models. Like the traditional implementation of an HMM, our new formulation can still be implemented using an efficient forward-backward algorithm for estimating the HMM parameters. We tested our classifier on a public mixed- target MSTAR database and compared our approach to the original HMM approach trained by using a maximum likelihood criterion. The results indicate a significant improvement over the original HMM approach. Current scores from our method are about in excess of 90% on testing data sets.

Feature subsets and hidden Markov model (HMM) parameters are the two major factors that affect the classification accuracy (CA) of the HMM-based classifier. This paper proposes a genetic algorithm based approach for simultaneously optimizing both feature subsets and HMM parameters with the aim to obtain the best HMM-based classifier. Experimental data extracted from three spontaneous speech corpora were used to evaluate the effectiveness of the proposed approach and the three other approaches (i.e. the approaches to single optimization of feature subsets, single optimization of HMM parameters, and no optimization of both feature subsets and HMM parameters) that were adopted in the previous work for discrimination between speech and non-speech events (e.g. filled pause, laughter, applause). The experimental results show that the proposed approach obtains CA of 91.05%, while the three other approaches obtain CA of 86.11%, 87.05%, and 83.16%, respectively. The results suggest that the proposed approach is superior to the previous approaches.

Monitoring agriculture from satellite remote sensing data, such as multispectral images, has become a powerful tool since it has demonstrated a great potential for providing timely and accurate knowledge of crops. Detecting anomalies in time series of multispectral remote sensing images for crop monitoring is generally performed using a large sample of historical data at a pixel level. Conversely, this article presents a framework for anomaly detection (AD), localization, and classification that exploits the temporal information contained in a given season at a parcel level to detect and localize outliers using hidden Markov models (HMMs). Specifically, the AD part is based on the learning of HMM parameters associated with unlabeled normal data that are used in a second step to detect abnormal crop parcels referred to as anomalies. The learned HMM can also be used in time segments to temporally localize the anomalies affecting the crop parcels. The detected and localized anomalies are finally classified using a supervised classifier, e.g., based on support vector machines. The proposed framework is applicable to images partially covered by clouds and can handle a set of crop parcels acquired in the same season bypassing problems due to crop rotations. Numerical experiments are conducted on synthetic and real data, where the real data correspond to vegetation indices extracted from several multitemporal Sentinel-2 images of rapeseed crops. The proposed approach is compared to standard AD methods yielding better detection rates with the advantage of allowing anomalies to be localized and characterized.

In this paper we study the problem of learning phylogenies and hidden Markov models. We call a Markov model nonsingular if all transition matrices have determinants bounded away from 0 (and 1). We highlight the role of the nonsingularity condition for the learning problem. Learning hidden Markov models without the nonsingularity condition is at least as hard as learning parity with noise, a well-known learning problem conjectured to be computationally hard. On the other hand, we give a polynomial-time algorithm for learning nonsingular phylogenies and hidden Markov models.

In this paper, we study the problem of learning phylogenies and hidden Markov models. We call a Markov model nonsingular if all transition matrices have determinants bounded away from 0 (and 1). We highlight the role of the nonsingularity condition for the learning problem. Learning hidden Markov models without the nonsingularity condition is at least as hard as learning parity with noise. On the other hand, we give a polynomial-time algorithm for learning nonsingular phylogenies and hidden Markov models.

Towards improving ASR robustness for PSN and GSM telephone applications