检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海理工大学光电信息与计算机工程学院,上海200093
出 处:《上海理工大学学报》2012年第4期323-326,共4页Journal of University of Shanghai For Science and Technology
摘 要:针对隐马尔科夫模型用于语音识别时传统的参数初始化方法(随机分布之值、K均值算法)可能导致模型参数收敛于局部最优而非全局最优的问题,提出了先按最大距离选择初值中心,再按最小距离将原始数据分割成小类后去除类内干扰点,使类内相似性更强的K均值方法.实验结果表明,改进后的方法与传统方法相比,更好地平滑逼近语音特征,提高语音的识别率.Given that traditional method of hidden Markov models parameter initialization for speech recognition (random method, k-means) can lead to convergence in local optimization of model parameters rather than global optimization problems. A new approach was proposed with three steps. First, the initial center was selected according to the maximum distance; second, the original data was split into small kinds by the minimum distance; finally, the interference point in the small kind was eliminated. The method resulted in much more similarity k-means than traditional method in the kind. Experimental results show that the improved method has the better approximation of smooth voice characteristics and improves the speech recognition rates which comparing with traditional methods.
关 键 词:隐马尔科夫模型 语音识别 参数初始化 K均值算法
分 类 号:TP319[自动化与计算机技术—计算机软件与理论] N94[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:52.14.150.165