Estimation of Sparse Nonnegative Sources from Noisy Overcomplete Mixtures Using MAP

DOI10.1162/neco.2009.08-08-846zbMath1177.94082OpenAlexW2165995740WikidataQ44586547 ScholiaQ44586547MaRDI QIDQ3650548

Andrzej Cichocki, Cesar F. Caiafa

Publication date: 14 December 2009

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco.2009.08-08-846

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Estimation and detection in stochastic control theory (93E10) Detection theory in information and communication theory (94A13)

Related Items

Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases ⋮ Sparse signal reconstruction via collaborative neurodynamic optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Mixed-state auto-models and motion texture modeling
• Separation of statistically dependent sources using an \(L^2\)-distance non-Gaussianity measure
• The High-Conductance State of Cortical Networks
• Stable recovery of sparse overcomplete representations in the presence of noise
• Greed is Good: Algorithmic Results for Sparse Approximation
• Atomic Decomposition by Basis Pursuit
• Dictionary Learning Algorithms for Sparse Representation
• An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
• Underdetermined blind source separation based on sparse representation
• Separation of Non-Negative Mixture of Non-Negative Sources Using a Bayesian Approach and MCMC Sampling
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• Matching pursuits with time-frequency dictionaries
• Learning the parts of objects by non-negative matrix factorization
• A Note on Lewicki-Sejnowski Gradient for Learning Overcomplete Representations
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution