Sciweavers

Share
ICASSP
2010
IEEE
7 years 11 months ago
Modified hierarchical clustering for sparse component analysis
The under-determined blind source separation (BSS) problem is usually solved using the sparse component analysis (SCA) technique. In SCA, the BSS is usually solved in two steps, w...
Nasser Mourad, James P. Reilly
TSP
2011
125views more  TSP 2011»
7 years 11 months ago
Weight Adjusted Tensor Method for Blind Separation of Underdetermined Mixtures of Nonstationary Sources
—In this paper, a novel algorithm to blindly separate an instantaneous linear underdetermined mixture of nonstationary sources is proposed. It means that the number of sources ex...
Petr Tichavský, Zbynek Koldovský
TSP
2008
166views more  TSP 2008»
8 years 3 months ago
Blind Identification of Underdetermined Mixtures by Simultaneous Matrix Diagonalization
Abstract--In this paper, we study simultaneous matrix diagonalization-based techniques for the estimation of the mixing matrix in underdetermined independent component analysis (IC...
Lieven De Lathauwer, Joséphine Castaing
CSDA
2007
169views more  CSDA 2007»
8 years 4 months ago
A null space method for over-complete blind source separation
In blind source separation, there are M sources that produce sounds independently and continuously over time. These sounds are then recorded by m receivers. The sound recorded by ...
Ray-Bing Chen, Ying Nian Wu
WSOM
2009
Springer
8 years 11 months ago
Approaching the Time Dependent Cocktail Party Problem with Online Sparse Coding Neural Gas
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
Kai Labusch, Erhardt Barth, Thomas Martinetz
books