University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Penalty function approach for constrained convolutive blind source separation

Wang, W, Chambers, JA and Sanei, S (2004) Penalty function approach for constrained convolutive blind source separation In: ICA 2004: 5th International Conference, 2004-09-22 - 2004-09-24, Granada, Spain.

[img] Text
WangCS_ICA_2004.pdf
Restricted to Repository staff only
Available under License : See the attached licence file.

Download (571kB)
[img] Text (licence)
SRI_deposit_agreement.pdf
Restricted to Repository staff only

Download (33kB)

Abstract

A new approach for convolutive blind source separation (BSS) using penalty functions is proposed in this paper. Motivated by nonlinear programming techniques for the constrained optimization problem, it converts the convolutive BSS into a joint diagonalization problem with unconstrained optimization. Theoretical analyses together with numerical evaluations reveal that the proposed method not only improves the separation performance by significantly reducing the effect of large errors within the elements of covariance matrices at low frequency bins and removes the degenerate solution induced by a null unmixing matrix, but also provides an unified framework to constrained BSS. © Springer-Verlag 2004.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Authors :
NameEmailORCID
Wang, WUNSPECIFIEDUNSPECIFIED
Chambers, JAUNSPECIFIEDUNSPECIFIED
Sanei, SUNSPECIFIEDUNSPECIFIED
Date : 2004
Identification Number : 10.1007/978-3-540-30110-3_84
Contributors :
ContributionNameEmailORCID
http://www.loc.gov/loc.terms/relators/PBLSpringer, UNSPECIFIEDUNSPECIFIED
Depositing User : Symplectic Elements
Date Deposited : 28 Mar 2017 14:43
Last Modified : 31 Oct 2017 14:37
URI: http://epubs.surrey.ac.uk/id/eprint/596111

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800