scholarly journals The Application of Baum-Welch Algorithm in Multistep Attack

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yanxue Zhang ◽  
Dongmei Zhao ◽  
Jinxing Liu
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Viterbi Algorithm ◽  
Markov Models ◽  
Hidden Markov ◽  
Simulation Experiments ◽  
Forward Algorithm ◽  
Better Than

The biggest difficulty of hidden Markov model applied to multistep attack is the determination of observations. Now the research of the determination of observations is still lacking, and it shows a certain degree of subjectivity. In this regard, we integrate the attack intentions and hidden Markov model (HMM) and support a method to forecasting multistep attack based on hidden Markov model. Firstly, we train the existing hidden Markov model(s) by the Baum-Welch algorithm of HMM. Then we recognize the alert belonging to attack scenarios with the Forward algorithm of HMM. Finally, we forecast the next possible attack sequence with the Viterbi algorithm of HMM. The results of simulation experiments show that the hidden Markov models which have been trained are better than the untrained in recognition and prediction.

scholarly journals Fuzzy Hidden Markov Models for Indonesian Speech Classification

2012 ◽  
Vol 16 (3) ◽  
pp. 381-387 ◽  
Author(s):  
Intan Nurma Yulita Houw Liong The ◽  
◽  
Adiwijaya ◽  
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Speech Signal ◽  
Markov Models ◽  
Hidden Markov ◽  
New Combination ◽  
Speech Classification ◽  
Different Characteristics ◽  
Better Than

Indonesia has many tribes, so that there are many dialects. Speech classification is difficult if the database uses speech signals from various people who have different characteristics because of gender and dialect. The different characteristics will influence frequency, intonation, amplitude, and period of the speech. It makes the system must be trained for the various templates reference of speech signal. Therefore, this study has been developed for Indonesian speech classification. The solution is a new combination of fuzzy on hidden Markov models. The result shows a new version of fuzzy hiddenMarkovmodels is better than hidden Markov model.

scholarly journals Map representation using hidden markov models for mobile robot localization

2018 ◽  
Vol 161 ◽  
pp. 03011
Author(s):  
Jesus Savage ◽  
Oscar Fuentes ◽  
Luis Contreras ◽  
Marco Negrete
Keyword(s):  
Mobile Robot ◽  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Viterbi Algorithm ◽  
Markov Models ◽  
Hidden Markov ◽  
Robot Localization ◽  
Localization System ◽  
Mobile Robot Localization

This paper describes a map representation and localization system for a mobile robot based on Hidden Markov Models. These models are used not only to find a region where a mobile robot is, but also they find the orientation that it has. It is shown that an estimation of the region where the robot is located can be found using the Viterbi algorithm with quantized laser readings, i.e. symbol observations, of a Hidden Markov Model.

scholarly journals Utilizing Gaze Behavior for Inferring Task Transitions Using Abstract Hidden Markov Models

2016 ◽  
Vol 19 (58) ◽  
pp. 1
Author(s):  
Daniel Fernando Tello Gamarra
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Markov Models ◽  
Hidden Markov ◽  
Hand Movement ◽  
Gaze Behavior ◽  
Improved Method ◽  
The Relationship

We demonstrate an improved method for utilizing observed gaze behavior and show that it is useful in inferring hand movement intent during goal directed tasks. The task dynamics and the relationship between hand and gaze behavior are learned using an Abstract Hidden Markov Model (AHMM). We show that the predicted hand movement transitions occur consistently earlier in AHMM models with gaze than those models that do not include gaze observations.

scholarly journals A Hidden Markov Model for the Linguistic Analysis of the Voynich Manuscript

2019 ◽  
Vol 24 (1) ◽  
pp. 14 ◽  
Author(s):  
Luis Acedo
Keyword(s):  
Time Series ◽  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Markov Models ◽  
Hidden Markov ◽  
Mathematical Linguistics ◽  
Underlying Structure ◽  
Internal States ◽  
Consonant Sounds

Hidden Markov models are a very useful tool in the modeling of time series and any sequence of data. In particular, they have been successfully applied to the field of mathematical linguistics. In this paper, we apply a hidden Markov model to analyze the underlying structure of an ancient and complex manuscript, known as the Voynich manuscript, which remains undeciphered. By assuming a certain number of internal states representations for the symbols of the manuscripts, we train the network by means of the α and β -pass algorithms to optimize the model. By this procedure, we are able to obtain the so-called transition and observation matrices to compare with known languages concerning the frequency of consonant andvowel sounds. From this analysis, we conclude that transitions occur between the two states with similar frequencies to other languages. Moreover, the identification of the vowel and consonant sounds matches some previous tentative bottom-up approaches to decode the manuscript.

Hidden Markov model interpretations of neural networks

2000 ◽  
Vol 23 (4) ◽  
pp. 494-495
Author(s):  
Ingmar Visser
Keyword(s):  
Neural Networks ◽  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Markov Models ◽  
Hidden Markov ◽  
Distributed Representations ◽  
Hidden Layer

Page's manifesto makes a case for localist representations in neural networks, one of the advantages being ease of interpretation. However, even localist networks can be hard to interpret, especially when at some hidden layer of the network distributed representations are employed, as is often the case. Hidden Markov models can be used to provide useful interpretable representations.

SENTENCE LIPREADING USING HIDDEN MARKOV MODEL WITH INTEGRATED GRAMMAR

2001 ◽  
Vol 15 (01) ◽  
pp. 161-176 ◽  
Author(s):  
KEREN YU ◽  
XIAOYI JIANG ◽  
HORST BUNKE
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Systematic Approach ◽  
Markov Models ◽  
Hidden Markov ◽  
E Mail

In this paper, we describe a systematic approach to the lipreading of whole sentences. A vocabulary of elementary words is considered. Based on the vocabulary, we define a grammar that generates a set of legal sentences. Our lipreading approach is based on a combination of the grammar with hidden Markov models (HMMs). Two different experiments were conducted. In the first experiment a set of e-mail commands is considered, while the set of sentences in the second experiment is given by all English integer numbers up to one million. Both experiments showed promising results, regarding the difficulty of the considered task.

scholarly journals Hidden Markov Model

d'CARTESIAN ◽  
2015 ◽  
Vol 4 (1) ◽  
pp. 86 ◽  
Author(s):  
Kezia Tumilaar ◽  
Yohanes Langi ◽  
Altien Rindengan
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
Viterbi Algorithm ◽  
Markov Models ◽  
Hidden Markov ◽  
Learning Problem ◽  
Model Learning ◽  
Observation Sequence ◽  
Evaluation Problem ◽  
Hidden States

Hidden Markov Models (HMM) is a stochastic model and is essentially an extension of Markov Chain. In Hidden Markov Model (HMM)  there are two types states: the observable states and the hidden states. The purpose of this research are to understand how hidden Markov model (HMM) and to understand how the solution of three basic problems on Hidden Markov Model (HMM) which consist of evaluation problem, decoding problem and learning problem.  The result of the research is hidden Markov model can be defined as . The evaluation problem or to compute probability of the observation sequence given the model P(O|) can solved  by Forward-Backward algorithm, the decoding problem or to choose hidden state sequence which is optimal can solved by Viterbi algorithm and learning problem or to estimate hidden Markov model parameter  to maximize P(O|)  can solved by Baum – Welch algorithm. From description above Hidden Markov Model  with state 3  can describe behavior  from the case studies. Key  words: Decoding Problem, Evaluation Problem, Hidden Markov Model, Learning Problem

scholarly journals Analysis of multimodal Bayesian nonparametric autoregressive hidden Markov models for process monitoring in robotic contact tasks

2019 ◽  
Vol 16 (2) ◽  
pp. 172988141983484 ◽  
Author(s):  
Hongmin Wu ◽  
Yisheng Guan ◽  
Juan Rojas
Keyword(s):  
Stochastic Process ◽  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Markov Models ◽  
Hidden Markov ◽  
Observation Model ◽  
Vector Autoregressive ◽  
Hidden States ◽  
Contact Tasks

Robot introspection aids robots to understand what they do and how they do it. Previous robot introspection techniques have often used parametric hidden Markov models or supervised learning techniques, implying that the number of hidden states or classes is defined a priori and fixed through the entire modeling process. Fixed parameterizations limit the modeling power of a process to properly encode the data. Furthermore, first-order Markov models are limited in their ability to model complex data sequences that represent highly dynamic behaviors as they assume observations are conditionally independent given the state. In this work, we contribute a Bayesian nonparametric autoregressive Hidden Markov model for the monitoring of robot contact tasks, which are characterized by complex dynamical data that are hard to model. We used a nonparametric prior that endows our hidden Markov models with an unbounded number of hidden states for a given robot skill (or subtask). We use a hierarchical Dirichlet stochastic process prior to learn an hidden Markov model with a switching vector autoregressive observation model of wrench signatures and end-effector pose for the manipulation contact tasks. The proposed scheme monitors both nominal skill execution and anomalous behaviors. Two contact tasks are used to measure the effectiveness of our approach: (i) a traditional pick-and-place task composed of four skills and (ii) a cantilever snap assembly task (also composed of four skills). The modeling performance or our approach was compared with other methods, and classification accuracy measures were computed for skill and anomaly identification. The hierarchical Dirichlet stochastic process prior to learn an hidden Markov model with a switching vector autoregressive observation model was shown to have excellent process monitoring performance with higher identification rates and monitoring ability.

scholarly journals Dynamic Arm Gesture Recognition Using Spherical Angle Features and Hidden Markov Models

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Hyesuk Kim ◽  
Incheol Kim
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Gesture Recognition ◽  
Markov Models ◽  
Hidden Markov ◽  
Recognition Performance ◽  
Graph Model ◽  
Feature Transformation ◽  
Probabilistic Graph

We introduce a vision-based arm gesture recognition (AGR) system using Kinect. The AGR system learns the discrete Hidden Markov Model (HMM), an effective probabilistic graph model for gesture recognition, from the dynamic pose of the arm joints provided by the Kinect API. Because Kinect’s viewpoint and the subject’s arm length can substantially affect the estimated 3D pose of each joint, it is difficult to recognize gestures reliably with these features. The proposed system performs the feature transformation that changes the 3D Cartesian coordinates of each joint into the 2D spherical angles of the corresponding arm part to obtain view-invariant and more discriminative features. We confirmed high recognition performance of the proposed AGR system through experiments with two different datasets.

Sign in / Sign up

Export Citation Format

Share Document