2011
DOI: 10.1109/tasl.2010.2049411
|View full text |Cite
|
Sign up to set email alerts
|

Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space

Abstract: Abstract-Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decomposition, especially the complete one, is mostly done under a constraint to reduce the computational burden. However, this constraint potentially restricts the performance. The authors propose a novel time-domain algorithm that is based on a complete unconstrained decomposition of the observation space. The observation space may b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 44 publications
(18 citation statements)
references
References 28 publications
0
18
0
Order By: Relevance
“…Furthermore, this study only used FastICA for the decomposition. Recently, more effective algorithms outperforming FastICA have been reported, including, efficient FastICA (EFICA), weights-adjusted second-order blind identification (WASOBI), combination of them (COBI), and approximate joint diagonalization (AJD), and so on (Koldovský et al 2006(Koldovský et al , 2009Koldovský and Tichavský 2011;Tichavsky et al 2008;Tichavsky and Yeredor 2009). It is reasonable to predict that if the performance of ICA decomposition is better in single runs under ICASSO, the finally extracted components by ICASSO should be more reliable.…”
Section: Discussionmentioning
confidence: 99%
“…Furthermore, this study only used FastICA for the decomposition. Recently, more effective algorithms outperforming FastICA have been reported, including, efficient FastICA (EFICA), weights-adjusted second-order blind identification (WASOBI), combination of them (COBI), and approximate joint diagonalization (AJD), and so on (Koldovský et al 2006(Koldovský et al , 2009Koldovský and Tichavský 2011;Tichavsky et al 2008;Tichavsky and Yeredor 2009). It is reasonable to predict that if the performance of ICA decomposition is better in single runs under ICASSO, the finally extracted components by ICASSO should be more reliable.…”
Section: Discussionmentioning
confidence: 99%
“…The method derived here is based on the time-domain blind audio separation approach where an observation space is defined; it is decomposed into independent components using Independent Component Analysis (ICA) [24,25]. The observation space is spanned by rows of a data matrix…”
Section: Semi-blind Noise Extractionmentioning
confidence: 99%
“…, D P . Therefore, blind methods such as the one in [24] select all integer delays from 0 through L where L is the length of the CF. Hence, we consider this blind approach where D i = i−1, i = 1, .…”
Section: Semi-blind Noise Extractionmentioning
confidence: 99%
“…This problem is important, both fundamentally and practically. In terms of applications, the major driving force for the investigation of BID-QSS is blind speech or audio source separation in microphone arrays [2][3][4][5]. The idea of BID-QSS is to utilize the statistically time-varying characteristics of QSSs to identify the unknown system mixing matrix.…”
Section: Introductionmentioning
confidence: 99%