Journal article
A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing
- Abstract:
-
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 of IHT to a fixed point and a necessary condition for the existence of fixed points. These conditions allow us to perform a sparse signal recovery analysis in the deterministic noiseless case by imp...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Bibliographic Details
- Publisher:
- IEEE Publisher's website
- Journal:
- IEEE Transactions on Information Theory Journal website
- Volume:
- 61
- Issue:
- 4
- Pages:
- 2019-2042
- Publication date:
- 2015-04-01
- DOI:
- EISSN:
-
1557-9654
- ISSN:
-
0018-9448
- Source identifiers:
-
521210
Item Description
- Keywords:
- Pubs id:
-
pubs:521210
- UUID:
-
uuid:19b06a3e-a98e-495b-a4a3-f8a045eb68b3
- Local pid:
- pubs:521210
- Deposit date:
- 2015-05-01
Terms of use
- Copyright holder:
- IEEE
- Copyright date:
- 2015
- Notes:
- Copyright © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
If you are the owner of this record, you can report an update to it here: Report update to this record