Compressive Sensing
summary
Compressed sensing claims that fewer measurements can replace dense sensing by moving complexity into algorithms and reconstruction, with concrete wins like sub-sample k-space in MRI to cut minutes to seconds and typical gains of two- to tenfold in time or energy. The math uses randomized masks, RIP and a phase transition in m/n and k/n; recovery works via L1 minimization gives exact recovery under RIP or faster AMP variants, and newer methods use generative priors from VAEs to beat sparsity limits at the cost of losing formal guarantees.
AI-written summary · about
chapters (15)
- 0:00Compressive sensing intro
- 1:55Traditional sensing limits
- 3:59Real-world applications of compressive sensing
- 6:24Hardware to algorithms shift
- 8:11Two pillars of CS
- 9:37CS math foundations
- 12:45Linear algebra breakthrough
- 15:14L1 norm reconstruction
- 17:19Phase transitions & measurements
- 19:47Sparsity limits
- 20:50Deep learning priors
- 21:53Model vs data balance
- 22:56Hybrid approaches combining neural networks and CS
- 24:43DL-CS trade-offs
- 25:07Q&A
related talks
26mLearning Sparse Data with Near-optimal Speed and Efficiency from a Variety of Measurement Processes
28mCombinatorial Problems in Support Recovery for 1-bit Compressed Sensing
19mSupport Recovery in Universal One-bit Compressed Sensing
30mSparse Polynomial Interpolation: Compressed Sensing, Super-resolution, or Prony?
12mToward Nearly-Zero-Error Sketching via Compressive Sensing
39mProbabilistic Hashing Methods for Succinct Data Representations and Applications
34mArtificial intelligence to accelerate MRI scans - Philips & LUMC winners in the...
45mNoisy Estimation of Simultaneously Structured Models
