Fast Block-Sparse Decomposition Based on SL0

Sina Hamidi Ghalehjegh (1) , Massoud Babaie-Zadeh (1) , Christian Jutten (2)

1 EE department of SUT [Tehran] - Department of Electrical Engineering [Tehran]
2 GIPSA-VIBS - GIPSA - Vision and Brain Signal Processing

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.

Mots clés: SL0; Block-sparse

Domaines: Traitement du signal et de l'image [eess.SP]; Traitement du signal et de l'image [eess.SP]

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