Estimation of sparse nonnegative sources from noisy overcomplete mixtures using MAP

Authors:
Cesar F. Caiafa;Andrzej Cichocki
Affiliations:
LABSP, RIKEN Brain Science Institute, Wako, Saitama, Japan and Engineering Faculty, University of Buenos Aires, Buenos Aires, Argentina;LABSP, RIKEN Brain Science Institute, Wako, Saitama, Japan and Warsaw University of Technology, Warsaw, Poland and Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland
Venue:
Neural Computation
Year:
2009

Citing 7
Cited 1

Learning Overcomplete Representations

Neural Computation
Bayesian Inference and Optimal Design for the Sparse Linear Model

The Journal of Machine Learning Research
Separation of Non-Negative Mixture of Non-Negative Sources Using a Bayesian Approach and MCMC Sampling

IEEE Transactions on Signal Processing
-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

IEEE Transactions on Signal Processing
An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem

IEEE Transactions on Signal Processing - Part II
Underdetermined blind source separation based on sparse representation

IEEE Transactions on Signal Processing
Greed is good: algorithmic results for sparse approximation

IEEE Transactions on Information Theory

Computing sparse representations of multidimensional signals using kronecker bases

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this letter, we propose a new algorithm for estimating sparse nonnegative sources from a set of noisy linear mixtures. In particular, we consider difficult situations with high noise levels and more sources than sensors (underdetermined case). We show that when sources are very sparse in time and overlapped at some locations, they can be recovered even with very low signal-to-noise ratio, and by using many fewer sensors than sources. A theoretical analysis based on Bayesian estimation tools is included showing strong connections with algorithms in related areas of research such as ICA, NMF, FOCUSS, and sparse representation of data with overcomplete dictionaries. Our algorithm uses a Bayesian approach by modeling sparse signals through mixed-state random variables. This new model for priors imposes l0 norm-based sparsity. We start our analysis for the case of nonoverlapped sources (1-sparse), which allows us to simplify the search of the posterior maximum avoiding a combinatorial search. General algorithms for overlapped cases, such as 2-sparse and k-sparse sources, are derived by using the algorithm for 1-sparse signals recursively. Additionally, a combination of our MAP algorithm with the NN-KSVD algorithm is proposed for estimating the mixing matrix and the sources simultaneously in a real blind fashion. A complete set of simulation results is included showing the performance of our algorithm.