Research on greedy reconstruction algorithms of compressed sensing based on variable metric method

Tongxin Xuebao/Journal on Communications

Volumn 35, Issue 12, 2014, Pages

  Liu, Pan Pan ^a   Li, Lei ^a   Wang, Hao Yu ^a  

^a NANJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Computational complexity; Gradient direction; Gradient pursuit; Orthogonal matching pursuit; Storage requirements; Variable metric method

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTERIZED TOMOGRAPHY;

GRADIENT DIRECTION; GRADIENT PURSUITS; ORTHOGONAL MATCHING PURSUIT; STORAGE REQUIREMENTS; VARIABLE METRIC METHODS;

ONE DIMENSIONAL;

EID: 84921056465     PISSN: 1000436X     EISSN: None     Source Type: Journal    
DOI: 10.3969/j.issn.1000-436x.2014.12.012     Document Type: Article

References (17)

1. n: Analysis, synthesis and algorithms[J]. IEEE Trans Inf Theory, 1998, 44(1): 16-31.
2. FEVOTTE C, GODSILL S. Sparse linear regression in unions of bases via Bayesian variable selection[J]. IEEE Signal Process Lett, 2006, 13(7): 441-444.
3. DAVIES M, MITIANOUDIS N. A simple mixture model for sparse overcomplete ICA[A]. Proc Inst Elect Eng, Vis, Image Signal Processing[C]. 2004. 35-43.
4. CANDÈS E, ROMBERG J, TAO T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information[J]. IEEE Trans Inf Theory, 2006, 52(2): 489-509.
5. CHEN S S, DONOHO D L, SAUNDERS M A. Atomic decomposition by basis pursuit[J]. SIAM J of Scientific Computing, 1998, 20(1): 33-61.
6. FIGUEIREDO M, NOWAK R, WRIGHT S. Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems[J]. IEEE J of Slaected Topics in Signal Processing, 2007, 12(4): 586-597.
7. DAUBECHIES I, DEFRISE M, DEMOL C. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint[J]. Comm Pure Appl Math, 2004, 57: 1413-1457.
8. BLUMENSATH T, DAVIES M. Iterative hard thresholding for compressed sensing[J]. Appl Comput Harmon Anal, 2009, 27(3): 265-274.
9. MALLAT S, ZHANG Z. Matching pursuit in a time-frequency dictionary[J]. IEEE Trans SP, 1993, 41(12): 3397-3415.
10. TROPP J, GILBERT A. Signal recovery from partial information via orthogonal matching pursuit[J]. IEEE Trans Inform Theory, 2007, 53(12): 4655-4666.
11. DONOHO D L, DRORI I, TSAIG Y. Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit[J]. IEEE Trans Inf Theory, 2012, 58(2): 1094-112.
12. NEEDELL D, VERSHYNIN R. Signal recovery from inaccurate and incomplete measurements via regularized orthogonal matching pursuit[J]. Found Comput Math, 2009, 9(3): 317-334.
13. NEEDELL D, TROPP J A. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples[J]. Appl Comp Harm Anal, 2009, 26: 309-321.
14. DAI W, MILENKOVIC O. Subspace pursuit for compressive sensing signal reconstruction[J]. IEEE Trans Inform Theory, 2009, 55(5): 2230-2249.
15. BLUMENSATH T, DAVIES M. Gradient pursuits[J]. IEEE Trans Signal Processing, 2008, 56(6): 2370-2382.
16. ZHU L, QIU C T. Newton pursuit algorithm for sparse signal reconstruction in compressed sensing[J]. IEEE Computer Science and Information Technology, 2010, 6: 463-466.
17. YUAN Y X, SUN W Y. Theory and Methods of Optimization[M]. Beijing: Science Press, 1997.