ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper introduces a new method to maximize kurtosisbased contrast functions. Such contrast functions appear in the problem of blind source separation of convolutively mixed so...
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper deals with the problem of under-determined convolutive blind source separation. We model the contribution of each source to all mixture channels in the time-frequency d...
ICA
2010
Springer
13 years 6 months ago
2010
Springer
Independent Component Analysis is the best known method for solving blind source separation problems. In general, the number of sources must be known in advance. In many cases, pre...
ICA
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we propose a novel method for blind source separation (BSS) based on time-frequency sparseness (TF) that can estimate the number of sources and time-frequency masks,...
NIPS
1996
13 years 6 months ago
1996
In the square linear blind source separation problem, one must nd a linear unmixing operator which can detangle the result xi(t) of mixing n unknown independent sources si(t) thro...
NIPS
2004
13 years 6 months ago
2004
In contrast to the equivalence of linear blind source separation and linear independent component analysis it is not possible to recover the original source signal from some unkno...
NCI
2004
13 years 6 months ago
2004
This paper presents a new independency metric for blind source separation (BSS) problem. It is mathematically proved that the metric value of any linear combination of source sign...
ESANN
2006
13 years 6 months ago
2006
Blind source separation (BSS) has become one of the major signal and image processing area in many applications. Principal component analysis (PCA) and Independent component analys...
ESANN
2006
13 years 6 months ago
2006
The Blind Source Separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical dependency between outputs. Since global maximization may be ...
ESANN
2004
13 years 6 months ago
2004
The one-dimensional functional equation g(y(t)) = cg(z(t)) with known functions y and z and constant c is considered. The indeterminacies are calculated, and an algorithm for appro...