摘要
A parameter estimation algorithm of the continuous hidden Markov model isintroduced and the rigorous proof of its convergence is also included. The algorithm uses theViterbi algorithm instead of K-means clustering used in the segmental K-means algorithm to determineoptimal state and branch sequences. Based on the optimal sequence, parameters are estimated withmaximum-likelihood as objective functions. Comparisons with the traditional Baum-Welch and segmentalK-means algorithms on various aspects, such as optimal objectives and fundamentals, are made. Allthree algorithms are applied to face recognition. Results indicate that the proposed algorithm canreduce training time with comparable recognition rate and it is least sensitive to the training set.So its average performance exceeds the other two.
提出了一种连续隐Markov模型参数估计算法,并利用全局收敛定理严格证明了算法的收敛性.该算法用Viterbi算法取代分段K平均算法中的聚类方法,直接确定出最优状态和分支序列,并依据最优序列以最大似然为优化准则进行参数估计.阐述了该算法与Baum Welch和分段K平均2种经典算法在目标函数、优化准则和工作原理等方面的关系,并将3种算法应用于人脸识别.实验结果表明,该算法在获得相当识别率的同时缩短了训练时间,并降低了识别结果对训练样本集的敏感性,在3种算法中总体性能最优.
