Structured random measurements in signal processing
From MaRDI portal
Publication:4982276
Abstract: Compressed sensing and its extensions have recently triggered interest in randomized signal acquisition. A key finding is that random measurements provide sparse signal reconstruction guarantees for efficient and stable algorithms with a minimal number of samples. While this was first shown for (unstructured) Gaussian random measurement matrices, applications require certain structure of the measurements leading to structured random measurement matrices. Near optimal recovery guarantees for such structured measurements have been developed over the past years in a variety of contexts. This article surveys the theory in three scenarios: compressed sensing (sparse recovery), low rank matrix recovery, and phaseless estimation. The random measurement matrices to be considered include random partial Fourier matrices, partial random circulant matrices (subsampled convolutions), matrix completion, and phase estimation from magnitudes of Fourier type measurements. The article concludes with a brief discussion of the mathematical techniques for the analysis of such structured random measurements.
Recommendations
- An introduction to compressed sensing
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Convex Recovery of a Structured Signal from Independent Random Linear Measurements
- Restricted isometries for partial random circulant matrices
- Compressive sensing and structured random matrices
Cites work
- A Probabilistic and RIPless Theory of Compressed Sensing
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Absolute uniqueness of phase retrieval with random illumination
- An algebraic characterization of injectivity in phase retrieval
- Analysis of sparse MIMO radar
- Blind Deconvolution Using Convex Programming
- Compressed Sensing and Redundant Dictionaries
- Compressed sensing
- Compressed sensing with coherent and redundant dictionaries
- Compressive sensing
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
- Matrix recipes for hard thresholding methods
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On compressive sensing applied to radar
- On signal reconstruction without phase
- Phase retrieval: stability and recovery guarantees
- Random sampling of sparse trigonometric polynomials
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Restricted isometries for partial random circulant matrices
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Simultaneous analysis of Lasso and Dantzig selector
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Stable and Robust Sampling Strategies for Compressive Imaging
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The restricted isometry property for time-frequency structured random matrices
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- User-friendly tail bounds for sums of random matrices
Cited in
(13)- Sparse model uncertainties in compressed sensing with application to convolutions and sporadic communication
- A partial derandomization of phaselift using spherical designs
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
- Derandomized compressed sensing with nonuniform guarantees for _1 recovery
- Low rank tensor recovery via iterative hard thresholding
- Restricted isometries for partial random circulant matrices
- Separability of scalar random multisine signals
- Compressive sensing and structured random matrices
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
- Optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems
- Compressive sampling of ensembles of correlated signals
- Hierarchical isometry properties of hierarchical measurements
This page was built for publication: Structured random measurements in signal processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982276)
