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 use...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.展开更多
为了进行连续马尔可夫模型的初值提取,提出一种各类在训练样本空间近似均衡分布的K均值聚类法。在聚类的过程中引入惩罚因子,从而限制过多的训练矢量集中于一个或几个类,使样本空间划分近似均匀。连续马尔可夫模型初值提取实验证明,该...为了进行连续马尔可夫模型的初值提取,提出一种各类在训练样本空间近似均衡分布的K均值聚类法。在聚类的过程中引入惩罚因子,从而限制过多的训练矢量集中于一个或几个类,使样本空间划分近似均匀。连续马尔可夫模型初值提取实验证明,该方法与标准的K均值聚类法、LBG(L inde Buzo G ray)聚类法相比,降低了矢量量化产生的全局失真,各个类在样本空间的分布更加均匀,提高了矢量量化的性能。将该方法用于孤立词识别连续马尔可夫模型的初值提取,可使各个高斯概率密度函数的参数估计更逼近其无偏估计,从而提高了马尔可夫模型初值的可靠性。展开更多
文摘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.
文摘为了进行连续马尔可夫模型的初值提取,提出一种各类在训练样本空间近似均衡分布的K均值聚类法。在聚类的过程中引入惩罚因子,从而限制过多的训练矢量集中于一个或几个类,使样本空间划分近似均匀。连续马尔可夫模型初值提取实验证明,该方法与标准的K均值聚类法、LBG(L inde Buzo G ray)聚类法相比,降低了矢量量化产生的全局失真,各个类在样本空间的分布更加均匀,提高了矢量量化的性能。将该方法用于孤立词识别连续马尔可夫模型的初值提取,可使各个高斯概率密度函数的参数估计更逼近其无偏估计,从而提高了马尔可夫模型初值的可靠性。