A fast approach for overcomplete sparse decomposition based on smoothed L0 norm

Details A fast approach for overcomplete sparse decomposition based on smoothed L0 norm A fast approach for overcomplete sparse decomposition based on smoothed L0 norm

2008-09-15

arxiv.org/abs/0809.2508v2

Computer Science

Information Theory

Accepted in IEEE Transactions on Signal Processing. For MATLAB codes, see (http://ee.sharif.ir/~SLzero). File replaced, becaus

Scientific paper

10.1109/TSP.2008.2007606

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 L1 norm using Linear Programming (LP) techniques, our algorithm tries to directly minimize the L0 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.

Affiliated with

Also associated with

No associations

Rating

A fast approach for overcomplete sparse decomposition based on smoothed L0 norm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A fast approach for overcomplete sparse decomposition based on smoothed L0 norm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast approach for overcomplete sparse decomposition based on smoothed L0 norm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635130