.png){kind=icon}
.png){kind=icon}
Return
A constrained sequential EM algorithm for speech enhancement
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2008.03.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Speech enhancement is a fundamental problem, the goal of which is to estimate clean speech s(t), given a noise-contaminated signal s(t) + n(t), where n(t) is white or colored noise, This task call be viewed as a probabilistic inference problem which involves estimating the posterior distribution of hidden clean speech, given a noisy observation. Kalman filter is a representative method but is restricted to Gaussian distributions only. We consider the generalized auto-regressive (GAR) model in order to Capture the non-Gaussian characteristics of speech. Then we present a constrained sequential EM algorithm where Rao-Blackwellized particle filters (RBPFs) are used in the E-step and model parameters are updated in a sequential manner in the M-step under positivity constraints for noise variance parameters. Numerical experiments confirm the high performance of our proposed method, compared to Kalman filter-based methods, in the task of sequential speech enhancement. (C) 2008 Elsevier Ltd. All rights reserved.
Keywords:
Expectation maximization (EM)
Generalized auto-regressive model
Generalized exponential density
Kalman filter
Rao-Blackwellized particle filter
Speech enhancement
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
7.8K
Citations:
3.0W
Organization
No organization information available