This paper analyzes the performance of the simple thresholding algorithm for sparse signal representations. In particular, in order to be more realistic we introduce a new probabilistic signal model which assumes randomness for both the amplitude and also the location of nonzero entries. Based on this model we show that thresholding in average can correctly recover signals for much higher sparsity levels than was previously reported. The bounds we obtain in this paper are based on a new concept of average dictionary coherence and are shown to be much sharper than in former works [1,2].
|Title of host publication||2008 IEEE International Conference on Acoustics, Speech and Signal Processing|
|Publication status||Published - 12 May 2008|
|Name||IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)|