Complex nonconvex lp norm minimization for underdetermined source separation

55Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Vincent, E. (2007). Complex nonconvex lp norm minimization for underdetermined source separation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4666 LNCS, pp. 430–437). Springer Verlag. https://doi.org/10.1007/978-3-540-74494-8_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free