When Francesca invited me to give a talk at Supelec this past week, I was reminded that I really would have liked to have seen an expository presentation of compressive sensing that was not using always the same figures. In particular, Compressive sensing is always presented as some sort of convex programming / L_1 minimization issue which is certainly interesting but that doesn't allow for an exposition of the fact that, nowadays, the use of belief propagation or greedy solvers is not entirely relevant to that picture anymore. After the presentation I made at Supelec this week, I added a few things that I felt I did not have time to talk about. Without further due, here is an "improved" version of that presentation.
Thank you again to Francesca, Elsa and Pierre for the invitation, this exercise straightened some of my thoughts. I am going to add this presentation to the Learning Compressive Sensing page.
Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in Compressive Sensing or the Matrix Factorization Jungle and join the conversations on compressive sensing, advanced matrix factorization and calibration issues on Linkedin.
No comments:
Post a Comment