INTERSPEECH 2011
12th Annual Conference of the International Speech Communication Association

Florence, Italy
August 27-31. 2011

Fast and Simple Iterative Algorithm of Lp-Norm Minimization for Under-Determined Speech Separation

Yasuharu Hirasawa, Naoki Yasuraoka, Toru Takahashi, Tetsuya Ogata, Hiroshi G. Okuno

Kyoto University, Japan

This paper presents an efficient algorithm to solve Lp-norm minimization problem for under-determined speech separation; that is, for the case that there are more sound sources than microphones. We employ an auxiliary function method in order to derive update rules under the assumption that the amplitude of each sound source follows generalized Gaussian distribution. Experiments reveal that our method solves the L1-norm minimization problem ten times faster than a general solver, and also solves Lp-norm minimization problem efficiently, especially when the parameter p is small; when p is not more than 0.7, it runs in real-time without loss of separation quality.

Full Paper

Bibliographic reference.  Hirasawa, Yasuharu / Yasuraoka, Naoki / Takahashi, Toru / Ogata, Tetsuya / Okuno, Hiroshi G. (2011): "Fast and simple iterative algorithm of lp-norm minimization for under-determined speech separation", In INTERSPEECH-2011, 1745-1748.