compressive sensing aims at saving bits by sampling and compressing structured signals at the same time, allowing some potential error. It is strongly related to sparse decompositions. An open challenge: find the sparsest/most compressed, but also most elegant, definition for "compressive sensing"! I do consider the four-word Wedderburn theorem "every finite field commutates" (in French: "tout corps fini commute", with open poetic interpretations) one of the beautiful mantras (sure, allowing an amount of metonymia, five-word versions are more correct). The right-side image of a "corps fini" is borrowed from here.It is also meant to provide recordings from talks around the topic, for the unfortunate who could not attend. Most of the talks rest of the wonderful Diffusion des savoirs de l'Ecole Normale Supérieure site, especially for the Mathematical Foundations of Learning Theory conference.
Compressive sensing may solve some problems. Hope it could also contribute to stock exchange troubles by improving SEC Senses. While standard banks fail, filter banks (and wavelets of course) never deceive.
- By Yves Meyer (in french): une avancée étonnante en imagerie numérique : le "Compressed Sensing"
- By Emmanuel Candes: The Dantzig Selector: Statistical Estimation when p is Larger than n
- By Vladimir Koltchinskii: Sparsity in High-Dimensional Learning Problems
Compressive sensing may solve some problems. Hope it could also contribute to stock exchange troubles by improving SEC Senses. While standard banks fail, filter banks (and wavelets of course) never deceive.
No comments:
Post a Comment