Measure What Should be Measured: Progress and Challenges in Compressive Sensing
arXiv:1210.6730 · doi:10.1109/LSP.2012.2224518
Abstract
Is compressive sensing overrated? Or can it live up to our expectations? What will come after compressive sensing and sparsity? And what has Galileo Galilei got to do with it? Compressive sensing has taken the signal processing community by storm. A large corpus of research devoted to the theory and numerics of compressive sensing has been published in the last few years. Moreover, compressive sensing has inspired and initiated intriguing new research directions, such as matrix completion. Potential new applications emerge at a dazzling rate. Yet some important theoretical questions remain open, and seemingly obvious applications keep escaping the grip of compressive sensing. In this paper I discuss some of the recent progress in compressive sensing and point out key challenges and opportunities as the area of compressive sensing and sparse representations keeps evolving. I also attempt to assess the long-term impact of compressive sensing.
References in corpus (16)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Message Passing Algorithms for Compressed Sensing
- Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Model-Based Compressive Sensing
- Structured Compressed Sensing: From Theory to Applications
- High-Resolution Radar via Compressed Sensing
- Near-ideal model selection by minimization
- Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior
- Explicit constructions of RIP matrices and related problems
- Compressive Phase Retrieval From Squared Output Measurements Via Semidefinite Programming
- Restricted Isometries for Partial Random Circulant Matrices
- The restricted isometry property for time-frequency structured random matrices
- Solving Quadratic Equations via PhaseLift when There Are About As Many Equations As Unknowns
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Discussion: Latent variable graphical model selection via convex optimization
- Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing
Cited by in corpus (11)
- Channel Acquisition for Massive MIMO-OFDM with Adjustable Phase Shift Pilots
- Breaking the coherence barrier: A new theory for compressed sensing
- Binary Compressive Sensing via Analog Fountain Coding
- Entanglement enhancement through multi-rail noise reduction for continuous-variable measurement-based quantum information processing
- Compressive Spectrum Sensing for Cognitive Radio Networks
- End-to-End Nanophotonic Inverse Design for Imaging and Polarimetry
- A Perturbation Inequality for the Schatten- Quasi-Norm and Its Applications to Low-Rank Matrix Recovery
- Nonlinear compressed sensing based on composite mappings and its pointwise linearization
- sparsity regularization for nonlinear ill-posed problems
- Information Theory and Moduli of Riemann Surfaces
- A sparse-sampling approach for the fast computation of matrices: application to molecular vibrations