Lee Potter, Phil Schniter, and Justin Ziniel just released version 1.0 of the code implementing the Fast Bayesian Marching Pursuit algorithm that was featured before here and here. The code is located here. The link is in the reconstruction section of the Big Picture. Thank you Justin for the heads-up.
Also, at NIPS'08, Emmanuel Candes will give a tutorial on Compressed Sensing. The abstract of the talk reads:
One of the central tenets of signal processing and data acquisition is the Shannon/Nyquist sampling theory: the number of samples needed to capture a signal is dictated by its bandwidth. This tutorial surveys a novel sampling or sensing theory which goes somewhat against this conventional wisdom. This theory now known as ''Compressed Sensing'' or ''Compressive Sampling'' allows the faithful recovery of signals and images from what appear to be highly incomplete sets of data, i.e. from far fewer measurements or data bits than traditional methods use. We will present the key ideas underlying this new sampling or sensing theory, will survey some of the most important results, and discuss some of the most exciting current developments. We will emphasize the practicality and the broad applicability of this technique, and discuss what we believe are far reaching implications; e.g. procedures for sensing and compressing data simultaneously and much faster. Finally, there are already many ongoing efforts to build a new generation of sensing devices based on compressed sensing and we will discuss remarkable recent progress in this area as well.
Thank you Sina for the heads-up. This talk has been added to the Calendar. Talking about the calendar, for those of you not coming to the site to see this entry, the calendar is also listed on the right side of the blog in an agenda form and it looks like this:
If you know of specific events related to CS that are not featured on the calendar, please let know.
Image Credit: NASA/JPL/Space Science Institute, Looking at the stars from Enceladus, a moon of Saturn on October 9th.