Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29381


Select areas to restrict search in scientific publication database:
10008151
A Sparse Representation Speech Denoising Method Based on Adapted Stopping Residue Error
Abstract:
A sparse representation speech denoising method based on adapted stopping residue error was presented in this paper. Firstly, the cross-correlation between the clean speech spectrum and the noise spectrum was analyzed, and an estimation method was proposed. In the denoising method, an over-complete dictionary of the clean speech power spectrum was learned with the K-singular value decomposition (K-SVD) algorithm. In the sparse representation stage, the stopping residue error was adaptively achieved according to the estimated cross-correlation and the adjusted noise spectrum, and the orthogonal matching pursuit (OMP) approach was applied to reconstruct the clean speech spectrum from the noisy speech. Finally, the clean speech was re-synthesised via the inverse Fourier transform with the reconstructed speech spectrum and the noisy speech phase. The experiment results show that the proposed method outperforms the conventional methods in terms of subjective and objective measure.
Digital Object Identifier (DOI):

References:

[1] Gaikwad V M, Vasekar S S. Survey on quality and intelligibility offered by speech enhancement algorithms(C). 2015 International Conference on Computing Communication Control and Automation, Pune, 2015: 694-697.
[2] R. Martin. Noise power spectral density estimation based on optimal smoothing and minimum statistics (J).IEEE Transactions on Audio, Speech, Language Processing, 2001, 9(5): 504-512.
[3] Kodrasi I, Marquardt D, Doclo S. Curvature-based optimization of the trade-off parameter in the speech distortion weighted multichannel wiener filter (C). 2015 IEEE International Conference on Acoustics, Speech and Signal Processing, South Brisbane, 2015: 315-319.
[4] T.Gerkmann. MMSE-optimal enhancement of complex speech coefficients with uncertain prior knowledge of the clean speech phase (C). 2014 IEEE International Conference on Acoustics, Speech and Signal Processing, Florence, 2014: 4478-4482.
[5] Loizou P C. Speech enhancement: theory and practice (M). Florida: CRC Press, 2013: 1-5.
[6] Evans N, Mason J, Liu W, et al.. An assessement on the fundamental limitations of spectral subtraction (C). IEEE International Conference on Acoustics, Speech and Signal Processing, Toulous, 2006: 145-148.
[7] Hilman F, Koji I, Koichi S. Feature normalization based on non-extensive statistics for speech recognition (J). Speech Communication, 2013, 55(5): 587-599.
[8] Wohlberg B. Efficient algorithms for convolutional sparse representations (J). IEEE Transactions on Image Processing, 2016, 25(1): 301-315.
[9] He Yong-jun, Han Ji-qing, Deng Shi-men, et al.. A solution to residual noise in speech denoising with sparse representation (C). 2012 IEEE International Conference on Acoustics, Speech and Signal Processing, Kyoto, 2012: 4653-4656.
[10] Zhao Nan, Xu Xin, Yang Yi. Sparse Representations for Speech Enhancement (J). Chinese Journal of Electronics, 2011, 19(2): 268-272.
[11] Zhao Yan-ping, Zhao Xiao-hui, Wang Bo. A speech enhancement method employing sparse representation of power spectral density (J). Journal of Information and Computational Science, 2013, 10(6): 1705-1714.
[12] Sigg C D, Dikk T, Buhmann J M. Speech enhancement using generative dictionary learning (J).IEEE Transactions on Audio, Speech, Language Processing, 2012, 20(6): 1698-1712.
[13] Sun Lin-hui, Yang Zhen. Speech enhancement based on data-driven dictionary and sparse representation (J). Signal Processing, 2011, 27(12): 1793-1800.
[14] Rangachari, S. and Loizou, P, “A noise estimation algorithm for highly nonstationary environments,” Speech Communication, vol. 28, pp. 220–231, 2006.
[15] Berouti M, Schwartz M, Makhoul J. Enhancement of speech corrupted by acoustic noise (C). IEEE International Conference on Acoustics, Speech and Signal Processing, 1979: 208-211.
[16] Pati Y C, Rezaiifar R, Krishnaprasad P S. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition (C). IEEE Conference Record of The Twenty-Seventh Asilomar Conference on Signals, Systems and Computers, 1993, 40-44.
[17] Aharon M, Elad M, Bruckstein A. K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation (J).IEEE Transactions on Audio, Speech, Language Processing, 2006, 54(11): 4311-4322.
[18] Rubinstein R, Zibulevsky M, Elad M. Efficient implementation of the K-SVD algorithm using batch orthogonal matching pursuit(R). Science Department Technical Report CS, 2008.
Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007