Fast Sparse Representation Based on Smoothed L0 Norm - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Fast Sparse Representation Based on Smoothed L0 Norm


In this paper, a new algorithm for Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented. The algorithm is essentially a method for obtaining sufficiently sparse solutions of underdetermined systems of linear equations. The solution obtained by the proposed algorithm is compared with the minimum 1-norm solution achieved by Linear Programming (LP). It is experimentally shown that the proposed algorithm is about two orders of magnitude faster than the state-of-the-art 1-magic, while providing the same (or better) accuracy.
Fichier principal
Vignette du fichier
SmoothedL0.pdf (379.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00173357 , version 1 (19-09-2007)


  • HAL Id : hal-00173357 , version 1


G. Hosein Mohimani, Massoud Babaie-Zadeh, Christian Jutten. Fast Sparse Representation Based on Smoothed L0 Norm. ICA 2007 - 7th International Conference on Independent Component Analysis and Signal Separation, Sep 2007, London, United Kingdom. pp.389-396. ⟨hal-00173357⟩
302 View
1443 Download


Gmail Facebook X LinkedIn More