A simple, efficient and near optimal algorithm for compressed sensing

When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well approximated by a sparse vector. This statement has been formalised in the recently developed theory of compressed sensing, which developed conditions on the sampling system and proved the performance of several efficient algorithms for signal reconstruction under these conditions. In this paper, we prove that a very simple and efficient algorithm, known as Iterative Hard Thresholding, has near optimal performance guarantees rivalling those derived for other state of the art approaches.

• Type: Conference
• Year: 2009
• Where: ICASSP
• Authors: Thomas Blumensath, Mike E. Davies
• Keywords: Efficient Algorithm, ICASSP 2009, Iterative Hard Thresholding, Nyquist Rate, Signal Processing