Talks given at NuHAG events

Average Performance Analysis for Thresholding

  Karin Schnass

  given at  strobl07 (21.06.07 09:30)
  id:  632
  length:  25min
  status:  accepted
  type:  talk
We show that with high probability the thresholding algorithm can recover signals that are sparse in a redundant dictionary as long as the {\it 2-Babel function} is growing slowly. This implies that it can succeed for sparsity levels up to the order of the ambient dimension. The theoretical bounds are illustrated with numerical simulations. As an application of the theory {\it sensing dictionaries} for optimal average performance are characterised and their performance is tested numerically.

Enter here the CODE for editing this talk:
If you have forgotten the CODE for your talk click here to send an email to the Webmaster!
NOTICE: In [EDIT-MODUS] you can also UPLOAD a presentation"