By Topic

An Improved Smoothed \ell ^0 Approximation Algorithm for Sparse Representation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hyder, M.M. ; Dept. of Electr. Eng., Univ. of Newcastle, Callaghan, NSW, Australia ; Mahata, K.

l0 norm based algorithms have numerous potential applications where a sparse signal is recovered from a small number of measurements. The direct l0 norm optimization problem is NP-hard. In this paper we work with the the smoothed l0(SL0) approximation algorithm for sparse representation. We give an upper bound on the run-time estimation error. This upper bound is tighter than the previously known bound. Subsequently, we develop a reliable stopping criterion. This criterion is helpful in avoiding the problems due to the underlying discontinuities of the l0 cost function. Furthermore, we propose an alternative optimization strategy, which results in a Newton like algorithm.

Published in:

Signal Processing, IEEE Transactions on  (Volume:58 ,  Issue: 4 )