语音识别系统隐马尔可夫模型第一问题的对角化矩阵法
Diagonalization Matrix Method of Solving the First Problem of Hidden Markov Model in Speech Recognition System
摘要:
本文提出了一种计算效率高的隐马尔可夫模型(HMM)的评估问题与给定的一组离散观测符号,状态数和概率分布矩阵。对于给定的HMM模型,使用一种方法来评估观察概率,在该方法中,概率评估被降低到评估具有不同幂的矩阵的乘积的问题,并形成状态转移概率和观察概率。通过使用计算效率高的对角化方法,从而减少了评估HMM的评估问题的整体计算工作量。所提出的方法与现有的直接方法进行了比较。结果表明,用对角化方法计算矩阵幂比直接法更合适。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。