Fast Sparse Representation Based on Smoothed ℓ0 Norm

DOI10.1007/978-3-540-74494-8_49zbMath1173.94376MaRDI QIDQ3608577

Massoud Babaie-Zadeh, G. Hosein Mohimani, Christian Jutten

Publication date: 5 March 2009

Published in: Independent Component Analysis and Signal Separation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74494-8_49

zbMATH Keywords

sparse component analysis; over-complete atomic decomposition

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

94A12: Signal theory (characterization, reconstruction, filtering, etc.)

Related Items

Heuristics for Finding Sparse Solutions of Linear Inequalities, Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares, The non-convex sparse problem with nonnegative constraint for signal reconstruction, Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression), Compression and denoising using \(l _{0}\)-norm, Full spark frames, Compressed sensing of color images, Alternating direction method of multipliers for solving dictionary learning models, Faster maximum feasible subsystem solutions for dense constraint matrices, DC Approximation Approach for ℓ0-minimization in Compressed Sensing, Dictionary-Based Classification Models. Applications for Multichannel Neural Activity Analysis, Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm

Cites Work

• Blind Source Separation by Sparse Decomposition in a Signal Dictionary
• Stable recovery of sparse overcomplete representations in the presence of noise
• Atomic Decomposition by Basis Pursuit
• Uncertainty principles and ideal atomic decomposition
• A generalized uncertainty principle and sparse representation in pairs of bases
• Analysis of Sparse Representation and Blind Source Separation
• Matching pursuits with time-frequency dictionaries
• Underdetermined blind source separation using sparse representations