Fast Sparse Representation Based on Smoothed ℓ0 Norm

DOI10.1007/978-3-540-74494-8_49MaRDI QIDQ3608577zbMATH OpenOpenAlexFDO

Authors G. Hosein Mohimani, Massoud Babaie-Zadeh, C. 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 analysisover-complete atomic decomposition

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• A fast sparse signal recovery algorithm based on approximate \(l_0\) norm and hybrid optimization
• Algorithms on the sparse solution of under-determined linear systems
• Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm
• A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
• A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators

Cites work

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

Cited in

(18)

• A fast sparse signal recovery algorithm based on approximate \(l_0\) norm and hybrid optimization
• Dictionary-based classification models. Applications for multichannel neural activity analysis
• Compressed sensing of color images
• Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares
• A regularized sparse representation method
• DC approximation approach for \(\ell_0\)-minimization in compressed sensing
• A criterion for the construction of a regularization function in sparse component analysis
• Alternating direction method of multipliers for solving dictionary learning models
• An Improved Smoothed $\ell^0$ Approximation Algorithm for Sparse Representation
• Heuristics for Finding Sparse Solutions of Linear Inequalities
• The non-convex sparse problem with nonnegative constraint for signal reconstruction
• Compression and denoising using \(l _{0}\)-norm
• Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression)
• Faster maximum feasible subsystem solutions for dense constraint matrices
• Full spark frames
• Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm
• A fast \(\ell_1\)-solver and its applications to robust face recognition
• Efficient LED-SAC sparse estimator using fast sequential adaptive coordinate-wise optimization (LED-2SAC)

This page was built for publication: Fast Sparse Representation Based on Smoothed ℓ0 Norm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608577)