Atomic Decomposition by Basis Pursuit
SIAM Journal on Scientific Computing
A fast approach for overcomplete sparse decomposition based on smoothed l0 norm
IEEE Transactions on Signal Processing
Blind multiband signal reconstruction: compressed sensing for analog signals
IEEE Transactions on Signal Processing
On the reconstruction of block-sparse signals with an optimal number of measurements
IEEE Transactions on Signal Processing
Robust recovery of signals from a structured union of subspaces
IEEE Transactions on Information Theory
Stable recovery of sparse overcomplete representations in the presence of noise
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paperwe present anewalgorithmbased on Smoothed l0 (SL0), called Block SL0 (BSL0), for Under-determined Systems of Linear Equations (USLE) in which the nonzero elements of the unknown vector occur in clusters. Contrary to the previous algorithms such as Block Orthogonal Matching Pursuit (BOMP) and mixed l2/l1 norm, our approach provides a fast algorithm, while providing the same (or better) accuracy. Moreover, we will see experimentally that BSL0 has better performance than SL0, BOMP and mixed l2/l1 norm when the number of nonzero elements of the source vector approaches the upper bound of uniqueness theorem.