A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing
We present a new recovery analysis for a standard compressed sensing algorithm, Iterative Hard Thresholding (IHT) (Blumensath and Davies, 2008), which considers the fixed points of the algorithm. In the context of arbitrary measurement matrices, we derive a sufficient condition for the convergence o...
Päätekijät: | Cartis, C, Thompson, A |
---|---|
Aineistotyyppi: | Journal article |
Julkaistu: |
IEEE
2015
|
Samankaltaisia teoksia
-
A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing
Tekijä: Cartis, C, et al.
Julkaistu: (2013) -
Quantitative recovery conditions for tree-based compressed sensing
Tekijä: Cartis, C, et al.
Julkaistu: (2016) -
HDIHT: A High-Accuracy Distributed Iterative Hard Thresholding Algorithm for Compressed Sensing
Tekijä: Xiaming Chen, et al.
Julkaistu: (2020-01-01) -
CGIHT: Conjugate Gradient Iterative Hard Thresholding for Compressed Sensing and Matrix Completion
Tekijä: Tanner, J, et al.
Julkaistu: (2015) -
Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing
Tekijä: Blanchard, J, et al.
Julkaistu: (2015)