RIPless compressed sensing from anisotropic measurements
From MaRDI portal
Publication:2437334
Abstract: Compressed sensing is the art of reconstructing a sparse vector from its inner products with respect to a small set of randomly chosen measurement vectors. It is usually assumed that the ensemble of measurement vectors is in isotropic position in the sense that the associated covariance matrix is proportional to the identity matrix. In this paper, we establish bounds on the number of required measurements in the anisotropic case, where the ensemble of measurement vectors possesses a non-trivial covariance matrix. Essentially, we find that the required sampling rate grows proportionally to the condition number of the covariance matrix. In contrast to other recent contributions to this problem, our arguments do not rely on any restricted isometry properties (RIP's), but rather on ideas from convex geometry which have been systematically studied in the theory of low-rank matrix recovery. This allows for a simple argument and slightly improved bounds, but may lead to a worse dependency on noise (which we do not consider in the present paper).
Recommendations
- Compressed sensing: how sharp is the restricted isometry property?
- The restricted isometry property and its implications for compressed sensing
- An introduction to compressed sensing
- Sparse recovery under weak moment assumptions
- Theory of compressive sensing via _1-minimization: a non-RIP analysis and extensions
Cites work
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- A Probabilistic and RIPless Theory of Compressed Sensing
- A remark on compressed sensing
- Compressed sensing
- Exact matrix completion via convex optimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Probabilistic methods for algorithmic discrete mathematics
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Reconstruction From Anisotropic Random Measurements
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Simultaneous analysis of Lasso and Dantzig selector
- Strong converse for identification via quantum channels
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
Cited in
(11)- Sparse model uncertainties in compressed sensing with application to convolutions and sporadic communication
- A partial derandomization of phaselift using spherical designs
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- On the role of total variation in compressed sensing
- Restricted isometries for partial random circulant matrices
- Low-rank matrix completion in a general non-orthogonal basis
- Robust group lasso: model and recoverability
- Extracting Sparse High-Dimensional Dynamics from Limited Data
- Modern compressive tomography for quantum information science
- Improved recovery guarantees for phase retrieval from coded diffraction patterns
- Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE
This page was built for publication: RIPless compressed sensing from anisotropic measurements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437334)
