pith. sign in

arxiv: 0811.2868 · v1 · submitted 2008-11-18 · 💻 cs.MM · cs.IT· math.IT

Approximate Sparse Decomposition Based on Smoothed L0-Norm

classification 💻 cs.MM cs.ITmath.IT
keywords l0-normmethodsmoothedapproximationminimizationnoisysourcesparse
0
0 comments X
read the original abstract

In this paper, we propose a method to address the problem of source estimation for Sparse Component Analysis (SCA) in the presence of additive noise. Our method is a generalization of a recently proposed method (SL0), which has the advantage of directly minimizing the L0-norm instead of L1-norm, while being very fast. SL0 is based on minimization of the smoothed L0-norm subject to As=x. In order to better estimate the source vector for noisy mixtures, we suggest then to remove the constraint As=x, by relaxing exact equality to an approximation (we call our method Smoothed L0-norm Denoising or SL0DN). The final result can then be obtained by minimization of a proper linear combination of the smoothed L0-norm and a cost function for the approximation. Experimental results emphasize on the significant enhancement of the modified method in noisy cases.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.