Multichannel NMF with Reduced Computational Complexity for Speech Recognition

2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)(2018)

引用 0|浏览27
暂无评分
摘要
In this study, we propose efficient the number of computational iteration method of MNMF for speech recognition. The proposed method initializes and estimates the MNMF algorithm with respect to the estimated spatial correlation matrix reducing the number of iteration of update algorithm. This time, mask emphasis via Expectation Maximization algorithm is used for estimation of a spatial correlation matrix. As another method, we propose a computational complexity reduction method via decimating update of the spatial correlation matrixH. The experimental result indicates that our method reduced the computational complexity of MNMF. It shows that the performance of the conventional MNMF was maintained and the computational complexity could be reduced.
更多
查看译文
关键词
Correlation,Matrix decomposition,Speech recognition,Computational complexity,Time-frequency analysis,Estimation,Microphones
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要