J4 ›› 2012, Vol. 39 ›› Issue (3): 50-57+79.doi: 10.3969/j.issn.1001-2400.2012.03.008

• Original Articles • Previous Articles     Next Articles

Greedy adaptive recovery algorithm for compressed sensing

GAN Wei;XU Luping;ZHANG Hua;SU Zhe   

  1. (School of Electronic Engineering, Xidian Univ., Xi'an  710071， China)
  • Received:2011-03-04 Online:2012-06-20 Published:2012-07-03
  • Contact: GAN Wei E-mail:421711988@qq.com

PDF (PC)

1310

Like

Cited

9

Abstract:

In order to optimize the performance of Compressive Sampling Matching Pursuit (CoSaMP), the Compressive Sampling Modifying Matching Pursuit greedy adaptive algorithm (CoSaMMP) is proposed. Compared with the original CoSaMP, the algorithm adopts the fuzzy threshold preliminary rule with theoretical guarantee to avoid using apriori information on signals in the primary election phase, sets the initial pruning threshold to reduce unnecessary iterations, improves the pruning mode to enhance the recovery accuracy and avoid using apriori information on signals in the pruning phase, and finally realizes adaptive recovery for compressible signals. Simulation results show that for the same sparsity level, the operation speed of CoSaMMP increases by 2 fold compared with the initial algorithm, and that the required measurement number decreases about 1%, In addition, under the conditions of the high sparsity level, the algorithm have the better anti-interference ability than the initial one.

Key words: compressed sensing (CS), compressive sampling matching pursuit, fuzzy threshold, restricted isometry property

CLC Number: 

  • TN911.72　

Copyright © 2018 Journal of Xidian University, All Rights Reserved.
Powered by Beijing Magtech Co. Ltd
Baidu
map