期刊文献+

一种新的基于数据场的语音增强算法

A Novel Speech Enhancement Algorithm Based on Data Field
下载PDF
导出
摘要 语音增强是消除噪声干扰的主要手段,在语音处理系统中得到广泛应用。传统语音增强算法认为相邻帧语音幅度谱之间是相互独立的,而研究表明语音幅度谱时频点之间存在相互依赖关系。缺乏对邻域时频结构信息的利用使得传统增强算法的性能难以进一步提高。本文首次将数据场引入到对语音的听觉感知领域,用数据场对语音的时频依赖性进行建模,提出一种新的基于数据场的语音增强算法。该算法通过最小化势场分布的熵确定了时频点之间的相互作用力程,在带噪语音数据场中估计噪声的最小统计量得到二值时频掩蔽值,最后利用二值时频掩蔽消除噪声干扰。实验测试表明,与Martin算法相比,基于数据场的语音增强算法在提高去噪效果的同时能有效减少语音的失真。 In traditional speech enhancement algorithm the speech spectral amplitude is assumed to be mutually independent. Little work has been done to incorporate the time and frequency dependencies of speech.Without exploring the structure information of the time and frequency neighbors limit the performance of traditional speech enhancement algorithms.In this paper,we propose a novel speech enhancement algorithm based on data field theory,which is capable of modeling the time and frequency dependencies of speech. Data field defines the distribution of the magnitude of speech spectral samples conditioned on the values of their time and frequency neighbors.This formulation allows the explicit inclusion in the amplitude estimation model of both time and frequency dependencies that exist among the amplitudes of speech spectral.The proposed algorithm is evaluated by applying it to enhance noisy speech at various noise levels.Systematic evaluation shows that the proposed algorithm offers improved signal to noise ratio and presents an enhanced ability in preserving the weaker speech spectral components compared to Martin' s algorithm.
出处 《信号处理》 CSCD 北大核心 2011年第8期1200-1205,共6页 Journal of Signal Processing
基金 江苏省自然科学基金项目(BK2009059)资助
关键词 语音增强 数据场 时频掩蔽 噪声估计 Speech enhancement Data Field Time-Frequency masking Noise estimate
  • 相关文献

参考文献10

  • 1Lu. Y. and P. C. Loizou. A geometric approach to spectral subtraction [ J ]. Speech Communication,2008,50:453- 466.
  • 2Ding H., I. Y. Soon, and C. K. Yeo. Over-Attenuated Com- ponents Regeneration for Speech Enhancement[ J]. IEEE Transactions on Audio, Speech, and Language Process- ing, 2010,18(8) :2004:2014.
  • 3S. Jo and C. D. Yoo. Psychoacoustically Constrained and Distortion Minimized Speech Enhancement [ J ]. IEEE Transactions on Audio, Speech, and Language Process- ing, 2010, 18(8):2099-2110.
  • 4I. Andrianakis. Bayesian algorithms for speech enhancement [ D ] [ Doctor thesis ]. University of Southampton, 2007.
  • 5D. L. Wang and G. J. Brown. Computational Auditory Scene Analysis : Principles, Mgorithms and Applications [ M ]. IEEE Press/Wiley-Interscience, 2006:2-18.
  • 6Y. Shao, S. Srinivasan, Z. Jin, etal. A computational au- ditory scene analysis system for speech segregation and robust speech recognition[ J]. Computer Speech and Lan- guage, 2010, 24:77-93.
  • 7Li D. Y. ,Liu K. ,Sun Y., etal. Emerging Clapping Synchro- nization From a Complex Multiagent Network With Local Information via Local Control [ J ]. IEEE Transactions on Circuits and Syetems-II :Express Brief, 2009, 56(6) :504- 507.
  • 8淦文燕,李德毅,王建民.一种基于数据场的层次聚类方法[J].电子学报,2006,34(2):258-262. 被引量:82
  • 9R. Martin. Noise power spectral density estimation based on optimal smoothing and minimum statistics [ J ]. IEEE Transactions on Speech and Audio Processing, 2001, 9 (5) :504-512.
  • 10Hu Y. and P. Loizou. Subjective comparison of speech en- hancement algorithms [ C ]. Proceedings of ICASSP, Tou- louse, France, May 2006, 153-156.

二级参考文献10

  • 1Jain A K,Murty M N,Flynn P J.Data clustering:a review[J].ACM Computing Surveys,1999,31(3):264-323.
  • 2Za(i)ane O R,Foss A,Lee C H,Wang W.On data clustering analysis:scalability,constraints and validation[A].Proceedings of the Sixth Pacific Asia Conference on Knowledge Discovery and Data Mining[C].Taiwan:Springer-Verlag,2002.28-39.
  • 3Zhang T,Ramakrishnman R,Linvy M.BIRCH:an efficient method for very large databases[A].Proceedings of ACM SIGMOD International Conference on Manangement of Data[C].Canada:ACM Press,1996.103-114.
  • 4Guha S,Rastogi R,Shim K.CURE:an efficient clustering algorithm for large databases[A].Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data[C].Seattle:ACM Press,1998.73-84.
  • 5George K,Han E H,Kumar V.CHAMELEON:a hierarchical clustering algorithm using dynamic modeling[J].IEEE computer,1999,27(3):329-341.
  • 6Wright W E.Gravitational clustering[J].Pattern Recognition,1977,9(3):151-166.
  • 7Oyang Y J,Chen C Y,Yang T W.A study on the hierarchical data clustering algorithm based on gravity theory[A].The 5th European Conference on Principles and Practive of Knowledge Discovery in Databases(PKDD2001)[C].Freiburg:Springer-Verlag,2001.350-361.
  • 8Landau L D,Lifshitz E M.The classical theory of fields[M].Beijing:Beijing World Publishing Ltd,1999.
  • 9淦文燕.聚类-数据挖掘中的基础问题研究[D].南京:解放军理工大学,2003.
  • 10钱卫宁,周傲英.从多角度分析现有聚类算法(英文)[J].软件学报,2002,13(8):1382-1394. 被引量:86

共引文献81

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部