The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Blind source separation of more sources than mixtures using overcomplete representations
Abstract
Empirical results were obtained for the blind source separation of more sources than mixtures using a previously proposed framework for learning overcomplete representations. This technique assumes a linear mixing model with additive noise and involves two steps: (1) learning an overcomplete representation for the observed data and (2) inferring sources given a sparse prior on the coefficients. We demonstrate that three speech signals can be separated with good fidelity given only two mixtures of the three signals. Similar results were obtained with mixtures of two speech signals and one music signal.
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, A new concept?
Comon, P. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90029-9 · Cited by 8,205
Natural Gradient Works Efficiently in Learning
Amari, S.-I. (1998) · Neural Computation · doi:10.1162/089976698300017746 · Cited by 2,681
Blind signal separation: statistical principles
Cardoso, J.-F. (1998) · Proceedings of the IEEE · doi:10.1109/5.720250 · Cited by 1,885
Learning Overcomplete Representations
Lewicki, M. S., & Sejnowski, T. J. (2000) · Neural Computation · doi:10.1162/089976600300015826 · Cited by 1,129
Self-citationIndependent Component Analysis: Theory and Applications
Lee, T.-W. (2013) · Cited by 705
Self-citationNeural Learning in Structured Parameter Spaces - Natural Riemannian Gradient
Амари, Ш.-И. (1997) · Cited by 147
Learning Nonlinear Overcomplete Representations for Efficient Coding
Lewicki, M. S., & B, T. J. S. A. (1997) · Cited by 72
Self-citationA maximum likelihood approach to nonlinear blind source separation
Pajunen, P., & Karhunen, J. (1997) · Lecture notes in computer science · doi:10.1007/bfb0020210 · Cited by 51
Inferring sparse, overcomplete image codes using an efficient coding framework
Lewicki, M. S., & Olshausen, B. A. (1998) · neural information processing systems · Cited by 42
Self-citation
Cited by
Natural Gradient Works Efficiently in Learning
Amari, S.-I. (1998) · Neural Computation · doi:10.1162/089976698300017746 · Cited by 2,681
Brain Computer Interfaces, a Review
Nicolas-Alonso, L. F., & Gomez-Gil, J. (2012) · Sensors · doi:10.3390/s120201211 · Cited by 2,143
Conv-TasNet: Surpassing Ideal Time–Frequency Magnitude Masking for Speech Separation
Luo, Y., & Mesgarani, N. (2019) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2019.2915167 · Cited by 2,042
Lee, T.-W., Girolami, M., & Sejnowski, T. J. (1999) · Neural Computation · doi:10.1162/089976699300016719 · Cited by 1,967
Self-citationBlind Separation of Speech Mixtures via Time-Frequency Masking
Yilmaz, O., & Rickard, S. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.828896 · Cited by 1,474
Metadata
- Authors
- Lee, T.-W., Lewicki, M. S., Girolami, M., & Sejnowski, T. J.
- Venue
- IEEE Signal Processing Letters
- Published
- 1999-04
- Volume
- 6
- Issue
- 4
- Pages
- 87-90
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W2166159048
- Cited by
- 405
- References
- 10
- FWCI
- 15.41
- 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
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.