IEEE Transactions on Signal Processing · 2011 · 117 citations · 34 references
ComputingComputer ScienceMachine LearningStatistical LearningStatistical ModelingGaussian Process ModelingGaussian ProcessesSignal ProcessingCovarianceCovariance FunctionsLocal StationarityMultivariate Gaussian ProcessesMultivariate Random VariablesSignalsSound Source Separation
Gaussian process (GP) models are very popular for machine learning and regression and they are widely used to account for spatial or temporal relationships between multivariate random variables. In this paper, we propose a general formulation of underdetermined source separation as a problem involving GP regression. The advantage of the proposed unified view is first to describe the different underdetermined source separation problems as particular cases of a more general framework. Second, it provides a flexible means to include a variety of prior information concerning the sources such as smoothness, local stationarity or periodicity through the use of adequate covariance functions. Third, given the model, it provides an optimal solution in the minimum mean squared error (MMSE) sense to the source separation problem. In order to make the GP models tractable for very large signals, we introduce framing as a GP approximation and we show that computations for regularly sampled and locally stationary GPs can be done very efficiently in the frequency domain. These findings establish a deep connection between GP and nonnegative tensor factorizations (NTF) with the Itakura-Saito distance and lead to effective methods to learn GP hyperparameters for very large and regularly sampled signals.
34
Algorithms for Non-negative Matrix Factorization
Daniel D. Lee, H. Sebastian Seung · 2000 · 5.5K citations
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
D Seung, Lin-Wen Lee · 2001 · 4.8K citations
Blind signal separation: statistical principles
J.-F. Cardoso · Proceedings of the IEEE · 1998 · 1.9K citations