Quicklists
Javascript must be enabled

Gitta Kutyniok : Frames and Sparsity (Mar 3, 2011 4:25 PM)

Frames are nowadays a standard methodology in applied mathematics, computer science, and engineering when redundant, yet stable expansions are required. Sparsity is a new paradigm in signal processing, which allows for significantly reduced measurements yet still highly accurate reconstruction. In this talk, we will focus on the main two links between these exciting, rapidly growing areas. Firstly, the redundancy of a frame promotes sparse expansions of signals, thereby strongly supporting sparse recovery methods such as Compressed Sensing. After providing an overview of sparsity methodologies, we will discuss new results on sparse recovery for structured signals, in particular, which are a composition of `distinct' components. Secondly, in very high dimensions, frame decompositions might be intractable in applications with limited computing budget. This problem can be addressed by requiring sparsity of the frame itself, and we will show how to derive optimally sparse frames. Finally, we will discuss how some of the presented results generalize to the novel notion of fusion frames, which was introduced a few years ago for modeling distributed processing applications.

Please select playlist name from following

Report Video

Please select the category that most closely reflects your concern about the video, so that we can review it and determine whether it violates our Community Guidelines or isn’t appropriate for all viewers. Abusing this feature is also a violation of the Community Guidelines, so don’t do it.

0 Comments

Comments Disabled For This Video