Low Rank And Sparsity Analysis Applied To Speech Enhancement Via Online Estimated Dictionary
2016 Β· Pengfei Sun, Jun Qin
Abstract
We propose an online estimated dictionary based single channel speech enhancement algorithm, which focuses on low rank and sparse matrix decomposition. In this proposed algorithm, a noisy speech spectral matrix is considered as the summation of low rank background noise components and an activation of the online speech dictionary, on which both low rank and sparsity constraints are imposed. This decomposition takes the advantage of local estimated dictionary high expressiveness on speech components. The local dictionary can be obtained through estimating the speech presence probability by applying Expectation Maximal algorithm, in which a generalized Gamma prior for speech magnitude spectrum is used. The evaluation results show that the proposed algorithm achieves significant improvements when compared to four other speech enhancement algorithms.
Authors
(none)
Tags
Stats
Related papers
- Semi-supervised Speech Enhancement In Envelop And Details Subspaces (2016)0.00
- A Speech Enhancement Algorithm Based On Non-negative Hidden Markov Model And Kullback-leibler Divergence (2020)5.84
- Real-time Speech Extraction Using Spatially Regularized Independent Low-rank Matrix Analysis And Rank-constrained Spatial Covariance Matrix Estimation (2024)4.52
- Supervised And Unsupervised Speech Enhancement Using Nonnegative Matrix Factorization (2017)18.80
- Constrained Convolutional-recurrent Networks To Improve Speech Quality With Low Impact On Recognition Accuracy (2018)5.24
- Statistical Speech Enhancement Based On Probabilistic Integration Of Variational Autoencoder And Non-negative Matrix Factorization (2017)15.00
- Speech Enhancement Via Two-stage Dual Tree Complex Wavelet Packet Transform With A Speech Presence Probability Estimator (2016)5.84
- Dnn-free Low-latency Adaptive Speech Enhancement Based On Frame-online Beamforming Powered By Block-online Fastmnmf (2022)0.00