Performance comparisons of greedy algorithms in compressed sensing

Date: 2014

Categories:

Reference

Blanchard, J.D. and Tanner, J. (2014) ‘Performance comparisons of greedy algorithms in compressed sensing’, Numerical Linear Algebra with Applications, 22(2), pp. 254–282. doi: 10.1002/nla.1948.

Full text available at onlinelibrary.wiley.com

Author

Prof. Jared Tanner

« Conjugate gradient Iterative hard Thresholding: Observed noise stability for compressed sensing

Bounds of restricted isometry constants in extreme asymptotics: Formulae for Gaussian matrices »

Performance comparisons of greedy algorithms in compressed sensing

Reference

Author

More