Markov Chains and Hidden Markov Models

Author(s):  
David Forsyth

Multiclass classification problems such as document classification, medical diagnosis or scene classification are very challenging to address due to similarities between mutual classes. The use of reliable tools is necessary to get good classification results. This paper addresses the scene classification problem using objects as attributes. The process of classification is modeled by a famous mathematical tool: The Hidden Markov Models. We introduce suitable relations that scale the parameters of the Hidden Markov Model into variables of scene classification. The construction of Hidden Markov Chains is supported with weight measures and sorting functions. Lastly, inference algorithms extract most suitable scene categories from the Discrete Markov Chain. A parallelism approach constructs several Discrete Markov Chains in order to improve the accuracy of the classification process. We provide numerous tests on different datasets and compare classification accuracies with some state of the art methods. The proposed approach distinguishes itself by outperforming the other.


2003 ◽  
Vol 2 (1) ◽  
pp. 1
Author(s):  
B. SETIAWATY

In this article, we classify the class of hidden Markov models through the laws of the observation processes, since the Markov chains are not observable. Here, we also present some properties regarding this classification.


2017 ◽  
Vol 23 (4) ◽  
Author(s):  
Abdelaziz Nasroallah ◽  
Karima Elkimakh

AbstractOne of the most used variants of hidden Markov models (HMMs) is the standard case where the time is discrete and the state spaces (hidden and observed spaces) are finite. In this framework, we are interested in HMMs whose emission process results from a combination of independent Markov chains. Principally, we assume that the emission process evolves as follows: given a hidden state realization


Sign in / Sign up

Export Citation Format

Share Document