BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Matrix Suprema & Compressive Sensing - Alexander Jones (CCA/DAMTP)
DTSTART:20140514T150000Z
DTEND:20140514T160000Z
UID:TALK52349@talks.cam.ac.uk
CONTACT:Vittoria Silvestri
DESCRIPTION:The problem that is the subject of this talk is simple to desc
 ribe\; take a change of basis matrix\, remove the first N rows\, find the 
 size of the largest entry left & determine how this value decays with N. I
 n certain compressed sensing problems the faster this decay is the more we
  are allowed to compress the problem by subsampling. Now suppose we have t
 he freedom to permute the rows & are looking for the fastest decay possibl
 e. If the basis corresponding to the rows has some intrinsic structure\, w
 hat does an optimal permutation look like within this structure and how do
 es this impact on how we can subsample?\n\nThe talk will discuss some of t
 he theoretical limits of this problem before moving onto various specific 
 cases such as changing basis from complex exponentials to wavelets in one 
 and many dimensions. No previous knowledge of compressed sensing or wavele
 ts is required as I shall be introducing things from the ground up.
LOCATION:MR14\, Centre for Mathematical Sciences
END:VEVENT
END:VCALENDAR