Maximum Likelihood A Priori Knowledge Interpolation-Based Handset Mismatch Compensation for Robust S

来源 :清华大学学报 | 被引量 : 0次 | 上传用户:njcxm
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
Unseen handset mismatch is the major source of performance degradation in speaker identifica-tion in telecommunication environments.To alleviate the problem,a maximum likelihood a priori knowledge interpolation (ML-AKI)-based handset mismatch compensation approach is proposed.It first collects a set of handset characteristics of seen handsets to use as the a priori knowledge for representing the space of handsets.During evaluation the characteristics of an unknown test handset are optimally estimated by in-terpolation from the set of the a pdod knowledge.Experimental results on the HTIMIT database show that the ML-AKI method can improve the average speaker identification rate from 60.0% to 74.6% as compared with conventional maximum a posteriori-adapted Gaussian mixture models.The proposed ML-AKI method is a promising method for robust speaker identification.
其他文献
提出了储罐系统可靠性设计参数(载荷、结构尺寸、材料性能)的计算方法.并采用8节点等参元有限元法计算了储罐结构应力,考虑了影响结构失效的两个不确定性因素:随机性和模糊性
针对固液混合火箭发动机典型的边界层燃烧理论,用边界层的方法对固液混合火箭发动机燃烧进行了计算,计算采用二维轴对称的层流边界层方程,化学模型采用有限速率模型。计算考
基于Windows平台 ,开发了大跨曲面屋盖结构风洞试验数据处理的可视化通用分析软件 .介绍了针对脉动风压测试过程中的信号畸变处理方法、风压试验数据的表示形式、积分计算整
以94份寒地早粳稻为材料,采用随机区组试验设计,研究了膜下滴灌旱种对寒地水稻(Oryza sativa L.)品质的影响.结果表明,膜下滴灌旱种对糙米率、精米率、整精米率、精米粒长、
A muitilayer recurrent fuzzy neural network (MRFNN)is proposed for accurate dynamic system modeling.The proposed MRFNN has six layers combined with T-S fuzzy mo
为了降低包膜肥的生产成本,基于工业圆盘造粒机的原理利用共轭改性废油脂制备缓释包膜氮肥,通过红外分析改性后油脂的结构变化,扫描电镜和高倍金相显微镜观察膜层结构,并进行
The change of conductivity, thickness and scanning electron microscopy (SEM) appearance of the anode film of CrWMn in 10( NaNO3 at different anode potential eit
The layered maximum a posteriori (L-MAP) algorithm has been proposed to detect signals under frequency selective fading multiple input multiple output (MIMO) ch
Large high-dimensional data have posed great challenges to existing algorithms for frequent itemsets mining.To solve the problem,a hybrid method,consisting of a