By Topic

An improved complementary matching pursuit algorithm for compressed sensing 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
$33 $33
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)
Donghong Wei ; Beijing University of Posts and Telecommunications, 100876, China ; Jingli Mao ; Yong Liu

The complementary matching pursuit (CMP) algorithm is analogous to the classical matching pursuit (MP), but performs the complementary action. It deletes (N-1) atoms from the sparse approximation at each iteration and keeps only one atom while other algorithms select one atom and add it into the sparse approximation, which makes CMP have better reconstruction quality. However, remaining only one atom at each iteration costs more time in CMP. In this work, an improved CMP algorithm is proposed to shorten the reconstruction time. The proposed CMP algorithm selects more than one atoms at each iteration following a certain rule from Sparsity Adaptive Matching Pursuit(SAMP). In which, the number of selected atoms changes with Adaptive Size (AS) every iteration. The experiment results show that the improved method could achieve better reconstruction quality with less time than the Gradient Pursuit (GP), Orthogonal Matching Pursuit (OMP) and original CMP.

Published in:

Advanced Intelligence and Awareness Internet (AIAI 2011), 2011 International Conference on

Date of Conference:

28-30 Oct. 2011