English

Diagonalization Matrix Method of Solving the First Problem of Hidden Markov Model in Speech Recognition System

Data Structures and Algorithms 2012-02-29 v1

Abstract

This paper proposes a computationally efficient method of solving evaluation problem of Hidden Markov Model (HMM) with a given set of discrete observation symbols, number of states and probability distribution matrices. The observation probability for a given HMM model is evaluated using an approach in which the probability evaluation is reduced to the problem of evaluating the product of matrices with different powers and formed out of state transition probabilities and observation probabilities. Finding powers of a matrix is done by using the computationally efficient diagonalization method thereby reducing the overall computational effort for evaluating the Evaluation problem of HMM.The proposed method is compared with the existing direct method. It is found that evaluating matrix power by diagnolisation method is more suitable than that of the direct, method.

Keywords

Cite

@article{arxiv.1202.6256,
  title  = {Diagonalization Matrix Method of Solving the First Problem of Hidden Markov Model in Speech Recognition System},
  author = {R. Gnanajeyaraman and G. Seenivasan},
  journal= {arXiv preprint arXiv:1202.6256},
  year   = {2012}
}

Comments

10 pages

R2 v1 2026-06-21T20:26:19.690Z