A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm

Mohimani, Hosein; Babaie‐Zadeh, Massoud; Jutten, Christian

doi:10.1109/tsp.2008.2007606

Public

A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm

Shared by NobleBlocks on Nov 6, 2008 • 12:00 AM UTC

Authors:

Hosein Mohimani

Massoud Babaie‐Zadeh

Christian Jutten

Abstract

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 de...

Subject

Sparse approximation

Norm (philosophy)

Decomposition

Research Assistant

AI chat, annotations, notes & similar papers

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!