The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
A Robust and Precise Method for Solving the Permutation Problem of Frequency-Domain Blind Source Separation
Abstract
Blind source separation (BSS) for convolutive mixtures can be solved efficiently in the frequency domain, where independent component analysis (ICA) is performed separately in each frequency bin. However, frequency-domain BSS involves a permutation problem: the permutation ambiguity of ICA in each frequency bin should be aligned so that a separated signal in the time-domain contains frequency components of the same source signal. This paper presents a robust and precise method for solving the permutation problem. It is based on two approaches: direction of arrival (DOA) estimation for sources and the interfrequency correlation of signal envelopes. We discuss the advantages and disadvantages of the two approaches, and integrate them to exploit their respective advantages. Furthermore, by utilizing the harmonics of signals, we make the new method robust even for low frequencies where DOA estimation is inaccurate. We also present a new closed-form formula for estimating DOAs from a separation matrix obtained by ICA. Experimental results show that our method provided an almost perfect solution to the permutation problem for a case where two sources were mixed in a room whose reverberation time was 300 ms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Information-Maximization Approach to Blind Separation and Blind Deconvolution
Bell, A. J., & Sejnowski, T. J. (1995) · Neural Computation · doi:10.1162/neco.1995.7.6.1129 · Cited by 8,986
Independent Component Analysis
(2004) · Independent Component Analysis · doi:10.7551/mitpress/3717.003.0014 · Cited by 7,903
Fast and robust fixed-point algorithms for independent component analysis
Hyvarinen, A. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.761722 · Cited by 6,246
Independent Component Analysis
Hyvärinen, A., Karhunen, J., & Oja, E. (2001) · Wiley eBooks · doi:10.1002/0471221317 · Cited by 5,007
Beamforming: a versatile approach to spatial filtering
Van Veen, B. D., & Buckley, K. M. (1988) · IEEE ASSP Magazine · doi:10.1109/53.665 · Cited by 3,901
Blind beamforming for non-gaussian signals
Cardoso, J. F., & Souloumiac, A. (1993) · IEE Proceedings F Radar and Signal Processing · doi:10.1049/ip-f-2.1993.0054 · Cited by 2,738
Natural Gradient Works Efficiently in Learning
Amari, S.-I. (1998) · Neural Computation · doi:10.1162/089976698300017746 · Cited by 2,681
Matrix Algebra From a Statistician’s Perspective
Harville, D. A. (1997) · Springer eBooks · doi:10.1007/b98818 · Cited by 1,159
Matrix Algebra from a Statistician's Perspective
Ziegel, E. R., & Harville, D. A. (1998) · Technometrics · doi:10.2307/1270666 · Cited by 880
Blind separation of convolved mixtures in the frequency domain
Smaragdis, P. (1998) · Neurocomputing · doi:10.1016/s0925-2312(98)00047-2 · Cited by 776
Cited by
A Consolidated Perspective on Multimicrophone Speech Enhancement and Source Separation
Gannot, S., Vincent, E., Markovich-Golan, S., & Ozerov, A. (2017) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2016.2647702 · Cited by 563
Blind Source Separation Exploiting Higher-Order Frequency Dependencies
Kim, T., Attias, H. T., Lee, S.-Y., & Lee, T.-W. (2007) · IEEE Transactions on Audio, Speech and Language Processing · doi:10.1109/tasl.2006.872618 · Cited by 427
Metadata
- Authors
- Sawada, H., Mukai, R., Araki, S., & Makino, S.
- Venue
- IEEE Transactions on Speech and Audio Processing
- Published
- 2004-09
- Volume
- 12
- Issue
- 5
- Pages
- 530-538
- ISSN
- 1063-6676 (ISSN-L)
- OpenAlex
- W2096855653
- Cited by
- 576
- References
- 23
- FWCI
- 57.68
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Robust and Precise Method for Solving the Permutation Problem of Frequency-Domain Blind Source Separation. https://app.cochat.ai/papers/10.1109/tsa.2004.832994
- The paper
- Sawada, H., Mukai, R., Araki, S., & Makino, S. (2004). A Robust and Precise Method for Solving the Permutation Problem of Frequency-Domain Blind Source Separation. IEEE Transactions on Speech and Audio Processing. https://doi.org/10.1109/tsa.2004.832994
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.