Cart (Loading....) | Create Account
Close category search window
 

An Alternative Lagrange-Dual Based Algorithm for Sparse Signal Reconstruction

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

4 Author(s)
Yiju Wang ; Sch. of Oper. Res. & Manage. Sci., Qufu Normal Univ., Rizhao, China ; Guanglu Zhou ; Caccetta, L. ; Wanquan Liu

In this correspondence, we propose a new Lagrange-dual reformulation associated with an l1 -norm minimization problem for sparse signal reconstruction. There are two main advantages of our proposed approach. First, the number of the variables in the reformulated optimization problem is much smaller than that in the original problem when the dimension of measurement vector is much less than the size of the original signals; Second, the new problem is smooth and convex, and hence it can be solved by many state of the art gradient-type algorithms efficiently. The efficiency and performance of the proposed algorithm are validated via theoretical analysis as well as some illustrative numerical examples.

Published in:

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

Date of Publication:

April 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.