A Fast Sparse Recovery Algorithm for Compressed Sensing Using Approximate l0 Norm and Modified Newton Method

被引:5
作者
Jin, Dingfei [1 ]
Yang, Yue [1 ,2 ]
Ge, Tao [3 ]
Wu, Daole [2 ]
机构
[1] Cent South Univ, Sch Traff & Transportat Engn, Changsha 410075, Hunan, Peoples R China
[2] CRRC Zhuzhou Locomot Co Ltd, State Key Lab Heavy Duty AC Drive Elect Locomot S, Zhuzhou 412001, Peoples R China
[3] China Mobile Suzhou Software Technol Co Ltd, Suzhou 215004, Peoples R China
关键词
sparse recovery; compressed sensing; approximate l(0) norm; modified Newton method; DECOMPOSITION;
D O I
10.3390/ma12081227
中图分类号
O64 [物理化学(理论化学)、化学物理学];
学科分类号
070304 ; 081704 ;
摘要
In this paper, we propose a fast sparse recovery algorithm based on the approximate l(0) norm (FAL0), which is helpful in improving the practicability of the compressed sensing theory. We adopt a simple function that is continuous and differentiable to approximate the l(0) norm. With the aim of minimizing the l(0) norm, we derive a sparse recovery algorithm using the modified Newton method. In addition, we neglect the zero elements in the process of computing, which greatly reduces the amount of computation. In a computer simulation experiment, we test the image denoising and signal recovery performance of the different sparse recovery algorithms. The results show that the convergence rate of this method is faster, and it achieves nearly the same accuracy as other algorithms, improving the signal recovery efficiency under the same conditions.
引用
收藏
页数:10
相关论文
共 20 条
[1]   CONVERGENCE OF NEWTON METHOD IN NONLINEAR NETWORK ANALYSIS [J].
ALTMAN, T ;
BOULOS, PF .
MATHEMATICAL AND COMPUTER MODELLING, 1995, 21 (04) :35-41
[2]   Bayesian Compressive Sensing Using Laplace Priors [J].
Babacan, S. Derin ;
Molina, Rafael ;
Katsaggelos, Aggelos K. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2010, 19 (01) :53-63
[3]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[4]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[5]   Adaptive greedy approximations [J].
Davis, G ;
Mallat, S ;
Avellaneda, M .
CONSTRUCTIVE APPROXIMATION, 1997, 13 (01) :57-98
[6]   A simulated annealing algorithm for sparse recovery by l0 minimization [J].
Du, Xinpeng ;
Cheng, Lizhi ;
Chen, Daiqiang .
NEUROCOMPUTING, 2014, 131 :98-104
[7]  
Elad M, 2010, SPARSE AND REDUNDANT REPRESENTATIONS, P3, DOI 10.1007/978-1-4419-7011-4_1
[8]   Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm [J].
Gorodnitsky, IF ;
Rao, BD .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1997, 45 (03) :600-616
[9]   Bayesian compressive sensing [J].
Ji, Shihao ;
Xue, Ya ;
Carin, Lawrence .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (06) :2346-2356
[10]   Sensitivity analysis of the error factors in the binocular vision measurement system [J].
Jin, Dingfei ;
Yang, Yue .
OPTICAL ENGINEERING, 2018, 57 (10)