University of Cambridge > > Applied and Computational Analysis > Some New Results on Approximation with Redundant Dictionaries

Some New Results on Approximation with Redundant Dictionaries

Add to your list(s) Download to your calendar using vCal

  • UserMorten Nielsen (Aalborg University)
  • ClockThursday 23 May 2013, 15:00-16:00
  • HouseMR 14, CMS.

If you have a question about this talk, please contact Dr Hansen.

Data approximation using sparse linear expansions from overcomplete dictionaries has become a central theme in signal and image processing with applications ranging from data acquisition (compressed sensing) to denoising and compression.

For a given dictionary, we can also study best m-term approximation rates for any specific function. Interestingly, the notions of sparse expansions and certain asymptotic approximation rates are closely linked in the case of nice non-redundant dictionaries (e.g., an orthonormal basis in a Hilbert space.)

In this talk, I will explore the link between sparse expansions from an overcomplete dictionary and asymptotic approximation rates. Redundancy complicates the analysis, and we show that the close link between the two notions fails in general. However, using a probabilistic approach, we show that the close link is retained for ‘many’ redundant dictionaries.

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity