Skip to Main content Skip to Navigation
New interface
Conference papers

Complex nonconvex lp norm minimization for underdetermined source separation

Emmanuel Vincent 1 
1 METISS - Speech and sound data modeling and processing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Underdetermined source separation methods often rely on the assumption that the time-frequency source coefficients are independent and Laplacian distributed. In this article, we extend these methods by assuming that these coefficients follow a generalized Gaussian prior with shape parameter p. We study mathematical and experimental properties of the resulting complex nonconvex lp norm optimization problem in a particular case and derive an efficient global optimization algorithm. We show that the best separation performance for three-source stereo convolutive speech mixtures is achieved for small p.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Emmanuel Vincent Connect in order to contact the contributor
Submitted on : Tuesday, December 7, 2010 - 2:54:24 PM
Last modification on : Friday, February 4, 2022 - 3:15:24 AM
Long-term archiving on: : Tuesday, March 8, 2011 - 4:28:58 AM


Publisher files allowed on an open archive


  • HAL Id : inria-00544203, version 1


Emmanuel Vincent. Complex nonconvex lp norm minimization for underdetermined source separation. 7th Int. Conf. on Independent Component Analysis and Blind Source Separation (ICA), Sep 2007, London, United Kingdom. pp.430--437. ⟨inria-00544203⟩



Record views


Files downloads