The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Monaural Sound Source Separation by Nonnegative Matrix Factorization With Temporal Continuity and Sparseness Criteria
Abstract
An unsupervised learning algorithm for the separation of sound sources in one-channel music signals is presented. The algorithm is based on factorizing the magnitude spectrogram of an input signal into a sum of components, each of which has a fixed magnitude spectrum and a time-varying gain. Each sound source, in turn, is modeled as a sum of one or more components. The parameters of the components are estimated by minimizing the reconstruction error between the input spectrogram and the model, while restricting the component spectrograms to be nonnegative and favoring components whose gains are slowly varying and sparse. Temporal continuity is favored by using a cost term which is the sum of squared differences between the gains in adjacent frames, and sparseness is favored by penalizing nonzero gains. The proposed iterative estimation algorithm is initialized with random values, and the gains and the spectra are then alternatively updated using multiplicative update rules until the values converge. Simulation experiments were carried out using generated mixtures of pitched musical instrument samples and drum sounds. The performance of the proposed method was compared with independent subspace analysis and basic nonnegative matrix factorization, which are based on the same linear model. According to these simulations, the proposed method enables a better separation quality than the previous algorithms. Especially, the temporal continuity criterion improved the detection of pitched musical sounds. The sparseness criterion did not produce significant improvements
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,877
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
Sparse coding with an overcomplete basis set: A strategy employed by V1?
Olshausen, B. A., & Field, D. J. (1997) · Vision Research · doi:10.1016/s0042-6989(97)00169-7 · Cited by 3,642
Performance measurement in blind audio source separation
Vincent, E., Gribonval, R., & Fevotte, C. (2006) · IEEE Transactions on Audio, Speech and Language Processing · doi:10.1109/tsa.2005.858005 · Cited by 2,889
Introduction to Mathematical Statistics.
AA, Hogg, R. V., & Craig, A. T. (1996) · Journal of the American Statistical Association · doi:10.2307/2291439 · Cited by 2,888
Non-negative matrix factorization with sparseness constraints
Hoyer, P. O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408058 · Cited by 2,591
Signal estimation from modified short-time Fourier transform
Griffin, D., & Lim, J. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164317 · Cited by 2,095
Cited by
Multimodal Data Fusion: An Overview of Methods, Challenges, and Prospects
Lahat, D., Adali, T., & Jutten, C. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2460697 · Cited by 1,296
“In such cases, the link is often defined as some correspondence between datasets that can be interpreted as similarity, smoothness or continuity [169].”
BackgroundFévotte, C., Bertin, N., & Durrieu, J.-L. (2009) · Neural Computation · doi:10.1162/neco.2008.04-08-771 · Cited by 1,119
Audio-Visual Scene Analysis with Self-Supervised Multisensory Features
Owens, A., & Efros, A. A. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01231-1_39 · Cited by 704
Machine learning in acoustics: Theory and applications
Bianco, M. J., Gerstoft, P., Traer, J., Ozanich, E., Roch, M. A., Gannot, S., & Deledalle, C.-A. (2019) · The Journal of the Acoustical Society of America · doi:10.1121/1.5133944 · Cited by 609
Multichannel Nonnegative Matrix Factorization in Convolutive Mixtures for Audio Source Separation
Ozerov, A., & Fevotte, C. (2010) · IEEE Transactions on Audio, Speech, and Language Processing · doi:10.1109/tasl.2009.2031510 · Cited by 607
An Overview of Noise-Robust Automatic Speech Recognition
Li, J., Deng, L., Gong, Y., & Haeb-Umbach, R. (2014) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2014.2304637 · Cited by 568
Zhao, H., Gan, C., Rouditchenko, A., Vondrick, C., McDermott, J., & Torralba, A. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01246-5_35 · Cited by 433
Supervised and Unsupervised Speech Enhancement Using Nonnegative Matrix Factorization
Mohammadiha, N., Smaragdis, P., & Leijon, A. (2013) · IEEE Transactions on Audio, Speech, and Language Processing · doi:10.1109/tasl.2013.2270369 · Cited by 389
Exemplar-Based Sparse Representations for Noise Robust Automatic Speech Recognition
Gemmeke, J. F., Virtanen, T., & Hurmalainen, A. (2011) · IEEE Transactions on Audio, Speech, and Language Processing · doi:10.1109/tasl.2011.2112350 · Cited by 328
Self-citationSinging Voice Separation With Deep U-Net Convolutional Networks.
Jansson, A., Humphrey, E. J., Montecchio, N., Bittner, R., Kumar, A., & Weyde, T. (2017) · City Research Online (City University London) · doi:10.5281/zenodo.1414933 · Cited by 319
Methods for biological data integration: perspectives and challenges
Gligorijević, V., & Pržulj, N. (2015) · Journal of The Royal Society Interface · doi:10.1098/rsif.2015.0571 · Cited by 275
Speaker-Independent Speech Separation With Deep Attractor Network
Luo, Y., Chen, Z., & Mesgarani, N. (2018) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2018.2795749 · Cited by 260
Online Non-Negative Convolutive Pattern Learning for Speech Signals
Wang, D., Vipperla, R., Evans, N., & Zheng, T. F. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222381 · Cited by 25
Metadata
- Authors
- Virtanen, T.
- Venue
- IEEE Transactions on Audio, Speech and Language Processing
- Published
- 2007-03
- Volume
- 15
- Issue
- 3
- Pages
- 1066-1074
- ISSN
- 1558-7916 (ISSN-L)
- OpenAlex
- W2150415460
- Cited by
- 1,005
- References
- 23
- FWCI
- 50.66
- 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.