2007
DOI: 10.1109/tsp.2006.888877
|View full text |Cite
|
Sign up to set email alerts
|

Underdetermined Blind Separation of Nondisjoint Sources in the Time-Frequency Domain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
175
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 173 publications
(175 citation statements)
references
References 18 publications
0
175
0
Order By: Relevance
“…However, after exploiting the sparsity of sources and under some assumptions, it can be solved successfully. Aissa-El-Bey et al [15] first introduced the subspace projection method for signal extraction supposing the number of signals appeared at any TF point was less than the number of sensors.…”
Section: Source Signals Extractionmentioning
confidence: 99%
See 1 more Smart Citation
“…However, after exploiting the sparsity of sources and under some assumptions, it can be solved successfully. Aissa-El-Bey et al [15] first introduced the subspace projection method for signal extraction supposing the number of signals appeared at any TF point was less than the number of sensors.…”
Section: Source Signals Extractionmentioning
confidence: 99%
“…However, even if the mixing matrix has been estimated, the original signals are still not easily recovered in the underdetermined condition because the model has more unknowns than equations. To solve the illconditioned problem, additional assumptions must be set, then sources can be extracted by minimum norm solution using p l -norm criterion [13], matrix diagonalization [14], and subspace method [15], etc.…”
Section: Introductionmentioning
confidence: 99%
“…However, such an approach requires prior knowledge of the source distributions. In contrast, sparseness-based methods solve the UBSS problem [12][13][14][15][16][17][18][19][20] without prior knowledge on the source distribution, by exploiting the sparseness of the non-stationary sources in the time-frequency domain. Roughly speaking, sparseness-based approaches [21] involve transforming the mixtures into an appropriate representation domain.…”
Section: Introductionmentioning
confidence: 99%
“…In the instantaneous mixture case, where each observation consists of a sum of sources with different signal http://asp.eurasipjournals.com/content/2012/1/169 intensity in presence of noise, the sparseness-based methods introduced in [12][13][14][15][16][17], among others, rely on parameters that are chosen empirically. The general question addressed in this article is then to what extent this empirical parameter choice can be by-passed thanks to statistical methods, specifically designed to cope with sparse representations.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation