Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing
From MaRDI portal
Publication:5020144
DOI10.1007/978-3-030-69637-5_18zbMath1481.94049arXiv1408.4409OpenAlexW1959156040MaRDI QIDQ5020144
Dustin G. Mixon, Jameson Cahill
Publication date: 4 January 2022
Published in: Applied and Numerical Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.4409
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (algebraic aspects) (15B52)
Related Items (max. 100)
Stable and robust $\ell_p$-constrained compressive sensing recovery via robust width property ⋮ Robust and stable region-of-interest tomographic reconstruction using a robust width prior ⋮ Discrete uncertainty principles and sparse signal processing ⋮ A Data-Independent Distance to Infeasibility for Linear Conic Systems ⋮ Preserving injectivity under subgaussian mappings and its application to compressed sensing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Derandomizing restricted isometries via the Legendre symbol
- A mathematical introduction to compressive sensing
- Interpolation via weighted \(\ell_{1}\) minimization
- The restricted isometry property and its implications for compressed sensing
- A remark on compressed sensing
- A simple proof of the restricted isometry property for random matrices
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Adaptive estimation of a quadratic functional by model selection.
- The convex geometry of linear inverse problems
- Simultaneous analysis of Lasso and Dantzig selector
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Reconstruction and subgaussian processes
- Convex Recovery of a Structured Signal from Independent Random Linear Measurements
- Stable Image Reconstruction Using Total Variation Minimization
- Suprema of Chaos Processes and the Restricted Isometry Property
- Certifying the Restricted Isometry Property is Hard
- Compressed sensing and best 𝑘-term approximation
- Compressed Sensing: How Sharp Is the Restricted Isometry Property?
- Bounding the Smallest Singular Value of a Random Matrix Without Concentration
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Block-Sparse Recovery via Convex Optimization
- The Generic Chaining
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Robust Recovery of Signals From a Structured Union of Subspaces
- Living on the edge: phase transitions in convex programs with random data
- Recovering Compressively Sampled Signals Using Partial Support Information
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
- New constructions of RIP matrices with fast multiplication and fewer rows
- Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes
- Model Selection and Estimation in Regression with Grouped Variables
- Compressed sensing
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
This page was built for publication: Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing
