Report icon

Report

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 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 implyin...

Expand abstract

Actions


Access Document


Files:

Authors


Publisher:
Unspecified
Publication date:
2013-09-01
UUID:
uuid:06c18932-cc90-4479-b03c-7ba0ae7a570a
Local pid:
oai:eprints.maths.ox.ac.uk:1752
Deposit date:
2013-10-10

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP