Learnable low rank sparse models for speech denoising

Abstract

In this paper we present a framework for real time enhancement of speech signals. Our method leverages a new process-centric approach for sparse and parsimonious models, where the representation pursuit is obtained applying a deterministic function or process rather than solving an optimization problem. We first propose a rank-regularized robust version of non-negative matrix factorization (NMF) for modeling time-frequency representations of speech signals in which the spectral frames are decomposed as sparse linear combinations of atoms of a low-rank dictionary. Then, a parametric family of pursuit processes is derived from the iteration of the proximal descent method for solving this model. We present several experiments showing successful results and the potential of the proposed framework. Incorporating discriminative learning makes the proposed method significantly outperform exact NMF algorithms, with fixed latency and at a fraction of it's computational complexity.

DOI: 10.1109/ICASSP.2013.6637624

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@article{Sprechmann2013LearnableLR, title={Learnable low rank sparse models for speech denoising}, author={Pablo Sprechmann and Alexander M. Bronstein and Michael M. Bronstein and Guillermo Sapiro}, journal={2013 IEEE International Conference on Acoustics, Speech and Signal Processing}, year={2013}, pages={136-140} }