INTERSPEECH 2012
13th Annual Conference of the International Speech Communication Association

Portland, OR, USA
September 9-13, 2012

Heterogeneous Convolutive Non-Negative Sparse Coding

Dong Wang (1), Javier Tejedor (2)

(1) Center for Speech and Language Technologies, Tsinghua University, China
(2) Human Computer Technology Laboratory, Universidad Autónoma de Madrid, Spain

Convolutive non-negative matrix factorization (CNMF) and its sparse version, convolutive non-negative sparse coding (CNSC), exhibit great success in speech processing. A particular limitation of the current CNMF/CNSC approaches is that the convolution ranges of the bases in learning are identical, resulting in patterns covering the same time-span. This is obvious unideal as most of sequential signals, for example speech, involve patterns with a multitude of time spans. This paper extends the CNMF/CNSC algorithm and presents a heterogeneous learning approach which can learn bases with non-uniformed convolution ranges. The validity of this extension is demonstrated with a simple speech separation task.

Index Terms: non-negative matrix factorization, sparse coding, speech processing

Full Paper

Bibliographic reference.  Wang, Dong / Tejedor, Javier (2012): "Heterogeneous convolutive non-negative sparse coding", In INTERSPEECH-2012, 2150-2153.