Compressed Sensing and Bayesian Experimental Design
author: Mathias Seeger, Max Planck Institute for Biological Cybernetics
Description
We relate compressed sensing (CS) with Bayesian experimental design and provide a novel efficient approximate method for the latter, based on expectation propagation. In a large comparative study about linearly measuring natural images, we show that the simple standard heuristic of measuring Wavelet coefficients top-down systematically outperforms CS methods using random measurements; the sequential projection optimisation approach of [Ji & Carin 2007] performs even worse. We also show that our own approximate Bayesian method is able to learn measurement filters on full images efficiently which outperform the Wavelet heuristic. To our knowledge, ours is the first successful attempt at {}"learning compressed sensing" for images of realistic size. In contrast to common CS methods, our framework is not restricted to sparse signals, but can readily be applied to other notions of signal complexity or noise models. We give concrete ideas how our method can be scaled up to large signal representations.
| Slides | |
| 0:00 | Compressed Sensing and Bayesian Experimental Design |
| 0:06 | Measuring Natural Images - 1 |
| 1:55 | Measuring Natural Images - 2 |
| 2:16 | Compressed Sensing as Bayesian Design |
| 3:42 | Sequential Algorithm Illustration - 1 |
| 4:45 | Sequential Algorithm Illustration - 2 |
| 5:48 | Comparison of Different Methods |
| 7:30 | A Very Simple Baseline - 1 |
| 8:03 | A Very Simple Baseline - 2 |
| 8:30 | The Same for Larger Images |
| 9:42 | Compressed Sensing by Minimax Theory - 1 |
| 11:23 | Compressed Sensing by Minimax Theory - 2 |
| 12:06 | Compressed Sensing by Minimax Theory - 3 |
| 12:44 | Compressed Sensing by Minimax Theory - 4 |
| 13:09 | Where is the Energy? - 1 |
| 13:34 | Where is the Energy? - 2 |
| 13:39 | Where is the Energy? - 3 |
| 13:55 | The World According to Minimax - 1 |
| 14:15 | The World According to Minimax - 2 |
| 14:17 | The World According to Minimax - 3 |
| 14:44 | Nyquist.1 → Nyquist.2 - 1 |
| 15:17 | Nyquist.1 → Nyquist.2 - 2 |
| 16:05 | Nyquist.1 → Nyquist.2 - 3 |
| 16:54 | Conclusions - 1 |
| 17:34 | Conclusions - 2 |
| 18:02 | Conclusions - 3 |
| 18:41 | Conclusions - 4 |
| 19:21 | - Questions |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





