__Claremont Graduate University__ | __Claremont McKenna__ | __Harvey Mudd__ | __Pitzer__ | __Pomona__ | __Scripps__

Proudly Serving Math Community at the Claremont Colleges Since 2007

Copyright © 2011 Claremont Center for the Mathematical Sciences

When

Start: 11/05/2014 - 4:15pm

End : 11/05/2014 - 5:15pm

End : 11/05/2014 - 5:15pm

Category

Colloquium

Speaker

Rayan Saab, University of California, San Diego

Abstract

Compressed sensing is a signal acquisition paradigm that utilizes the sparsity of a signal (a vector in with << non-zero entries) to efficiently reconstruct it from very few (say , where < << ) generalized linear measurements. These measurements often take the form of inner products with random vectors drawn from appropriate distributions, and the reconstruction is typically done using convex optimization algorithms or computationally efficient greedy algorithms.

We discuss compressed sensing under the additional, and often practical, assumption that we have some estimate of the support-albeit this estimate is not fully accurate.

In this setting, we discuss using weighted minimization as a reconstruction method. We give reconstruction guarantees that improve on the standard results when the support information is accurate enough and when the weights are chosen correctly.

Where

Freeburg Forum, Kravis Center (LC 62), Claremont McKenna College

Attachment | Size |
---|---|

Saab.pdf | 128.93 KB |