Monday, April 9, 2012
4:15 pm
Annenberg 105

Applied Mathematics Colloquium

Super-resolution via sparse recovery: progress and challenges
Laurent Demanet, Assistant Professor, Applied Mathematics, MIT
From the knowledge of a function in a frequency band, super-resolution consists in detecting or estimating sharp features which are less than the inverse of a bandwidth apart from one another. Sparse recovery is one way to extend this Shannon-Nyquist scaling, but "by how much" and "in which setting" it is not yet clearly understood. This work attempts to start the classification of singularity layout vs. noise level for proper identification by ell-1 minimization. When a condition of constructive interference is met, ell1-minimization performs optimally: it only breaks down in the unrecoverable regime where no other method would work either. As a corollary, we obtain a novel noise-dependent scaling which replaces the inverse bandwidth rule for super-resolution. Algorithmic alternatives to ell-1 minimization are presented to attempt to deal with the harder situation of "destructive interference".
Contact Sydney Garstang sydney@caltech.edu at x4555
For more information see http://www.acm.caltech.edu
Add this event to my calendar