By Topic

An improved greedy algorithm for signal recovery from random measurements

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

3 Author(s)
Jian Jin ; Dept. of Electron. Eng., Tsinghua Univ., Beijing, China ; Yuantao Gu ; Shunliang Mei

In this paper a novel greedy algorithm, called least squares orthogonal pursuit (LSOP), is proposed to solve the sparse approximation problem in practical compressive sensing. Unlike orthogonal matching pursuit (OMP) which finds the support set of the unknown signal iteratively with the idea of matching filter, LSOP selects the candidate according to the least squares solution of the residual signal. It is shown that the proposed algorithm surpasses OMP because its coherence statistic is smaller than that of the latter. In addition, the idea that the least squares solution aids support set selection can be extended to all OMP-based algorithms and improves their performances. Several numerical experiments demonstrate that the proposed LSOP family has better behaviors in solving sparse recovery problem than the available OMP family.

Published in:

Signal Processing (ICSP), 2010 IEEE 10th International Conference on

Date of Conference:

24-28 Oct. 2010