Please use this identifier to cite or link to this item:
Title: A novel expectation-maximization framework for speech enhancement in non-stationary noise environments
Authors: Lun, DP 
Shen, TW
Ho, KC
Issue Date: 2014
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE/ACM transactions on audio, speech, and language processing, 2014, v. 22, no. 2, p. 335-346 How to cite?
Journal: IEEE/ACM transactions on audio, speech, and language processing 
Abstract: Voiced speeches have a quasi-periodic nature that allows them to be compactly represented in the cepstral domain. It is a distinctive feature compared with noises. Recently, the temporal cepstrum smoothing (TCS) algorithm was proposed and was shown to be effective for speech enhancement in non-stationary noise environments. However, the missing of an automatic parameter updating mechanism limits its adaptability to noisy speeches with abrupt changes in SNR across time frames or frequency components. In this paper, an improved speech enhancement algorithm based on a novel expectation-maximization (EM) framework is proposed. The new algorithm starts with the traditional TCS method which gives the initial guess of the periodogram of the clean speech. It is then applied to an L1 norm regularizer in the M-step of the EM framework to estimate the true power spectrum of the original speech. It in turn enables the estimation of the a-priori SNR and is used in the E-step, which is indeed a logmmse gain function, to refine the estimation of the clean speech periodogram. The M-step and E-step iterate alternately until converged. A notable improvement of the proposed algorithm over the traditional TCS method is its adaptability to the changes (even abrupt changes) in SNR of the noisy speech. Performance of the proposed algorithm is evaluated using standard measures based on a large set of speech and noise signals. Evaluation results show that a significant improvement is achieved compared to conventional approaches especially in non-stationary noise environment where most conventional algorithms fail to perform.
ISSN: 2329-9290
EISSN: 2329-9304
DOI: 10.1109/TASLP.2013.2290497
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jul 19, 2017

Page view(s)

Last Week
Last month
Checked on Jul 9, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.