Fast Block-Sparse Decomposition Based on SL0

Abstract : 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.
keyword : Block-sparse SL0
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download
Contributor : Christian Jutten <>
Submitted on : Wednesday, October 13, 2010 - 12:34:28 PM
Last modification on : Tuesday, July 9, 2019 - 1:21:27 AM
Long-term archiving on : Friday, January 14, 2011 - 2:58:57 AM


Files produced by the author(s)


  • HAL Id : hal-00525952, version 1


Sina Hamidi Ghalehjegh, Massoud Babaie-Zadeh, Christian Jutten. Fast Block-Sparse Decomposition Based on SL0. 9th International Conference Latent Variable Analysis and Signal Separation (LVA/ICA 2010), Sep 2010, Saint Malo, France. pp.426-433. ⟨hal-00525952⟩



Record views


Files downloads