Around the blogs in 80 hours, Compressive Sensing Edition

Dirk started a thread with Minimum l^1-norm solutions are not always sparse which was read by Bob who followed up with A simple example where BP fails and OMP succeeds and then with What is "exact recovery"?. Vlad reminds us  about The nasty bug crawling in my Orthogonal Matching Pursuit code, and Terry talks about a course note (245B, Notes) 1: Basic theory of expander graphs and A central limit theorem for the determinant of a Wigner matrix

Credit photo: NASA,Opportunity :: Panoramic Camera :: Sol 2793

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.