A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed L-0 Norm - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Signal Processing Année : 2009

A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed L-0 Norm

Résumé

In this paper, a fast algorithm for overcomplete sparse decomposition, called SL0, is proposed. The algorithm is essentially a method for obtaining sparse solutions of underdetermined systems of linear equations, and its applications include underdetermined sparse component analysis (SCA), atomic decomposition on overcomplete dictionaries, compressed sensing, and decoding real field codes. Contrary to previous methods, which usually solve this problem by minimizing the l^0 norm using linear programming (LP) techniques, our algorithm tries to directly minimize the l^0 norm. It is experimentally shown that the proposed algorithm is about two to three orders of magnitude faster than the state-of-the-art interior-point LP solvers, while providing the same (or better) accuracy.
Fichier principal
Vignette du fichier
SmoothedL0norm-IEEESP-09.pdf (655.27 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00358113 , version 1 (02-02-2009)

Identifiants

Citer

G. Hosein Mohimani, Massoud Babaie-Zadeh, Christian Jutten. A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed L-0 Norm. IEEE Transactions on Signal Processing, 2009, 57 (1), pp.289-301. ⟨10.1109/TSP.2008.2007606⟩. ⟨hal-00358113⟩
314 Consultations
494 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More