By Topic

Improved Non Convex Optimization Algorithm for Reconstruction of Sparse Signals

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
$33 $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)
Ronggen Yang ; Dept. of Comput. Eng., Huaiyin Inst. of Technol., Huai'an, China ; Mingwu Ren

It is now well understood that it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements. The form is solution to the optimization problem min ||s||0 , subject to As = x. while this is an NP hard problem, i.e., a non convex problem, therefore researchers try to solve it by constrained l 1-norm minimization and get near-optimal solution. In this paper, we study a novel method, called smoothed l 0-norm, for sparse signal recovery. Unlike previous methods, our algorithm tries to directly minimize the l 0-norm. It is experimented on synthetic and real image data and shows that the proposed algorithm outperforms the interiorpoint LP solvers, while providing the same even better accuracy.

Published in:

Image and Signal Processing, 2009. CISP '09. 2nd International Congress on

Date of Conference:

17-19 Oct. 2009