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

Blind Separation of Speech Mixtures via Time-Frequency Masking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

7
1,222
0
6

Year Published

2008
2008
2018
2018

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 1,278 publications
(1,235 citation statements)
references
References 15 publications
7
1,222
0
6
Order By: Relevance
“…We used the FD-ICA algorithm with the MuSIC-based permutation alignment algorithm described by Mitianoudis and Davies [9], setting the STFT frame size to 2048 samples, which was previously found to be appropriate for this algorithm at a 16kHz sampling rate [9,33]. For the DUET algorithm we used an STFT frame size of 1024 samples, which was found by Yilmaz and Rickard [11] to give the best separation performance at 16 kHz. For the proposed adaptive stereo basis algorithm, we used an adaptive basis frame size of 512 samples, to be consistent with preliminary experiments which indicated that this would be sufficient for separation at a 16 kHz sampling rate with reasonable room reverberation times [33].…”
Section: Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…We used the FD-ICA algorithm with the MuSIC-based permutation alignment algorithm described by Mitianoudis and Davies [9], setting the STFT frame size to 2048 samples, which was previously found to be appropriate for this algorithm at a 16kHz sampling rate [9,33]. For the DUET algorithm we used an STFT frame size of 1024 samples, which was found by Yilmaz and Rickard [11] to give the best separation performance at 16 kHz. For the proposed adaptive stereo basis algorithm, we used an adaptive basis frame size of 512 samples, to be consistent with preliminary experiments which indicated that this would be sufficient for separation at a 16 kHz sampling rate with reasonable room reverberation times [33].…”
Section: Methodsmentioning
confidence: 99%
“…, K. Thus the diagonal elements of H (p) are one or zero depending on whether or not a transform component is considered to belong to the subspace E p corresponding to the p-th source. Note that, in contrast to the time-frequency mask used in the DUET algorithm [11], which depends both on the frequency bin index f and the time frame index t, the ASB masking matrix H (p) operates across basis pair indices k only and is independent of the time frame.…”
Section: P With the Mask Values Given Bymentioning
confidence: 99%
See 3 more Smart Citations