Improved bounds for sparse recovery from subsampled random convolutions
From MaRDI portal
Publication:1634177
DOI10.1214/18-AAP1391zbMath1441.94062arXiv1610.04983WikidataQ129120205 ScholiaQ129120205MaRDI QIDQ1634177
Shahar Mendelson, Holger Rauhut, Rachel Ward
Publication date: 17 December 2018
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.04983
Random matrices (probabilistic aspects) (60B20) Sampling theory in information and communication theory (94A20)
Related Items
Randomized numerical linear algebra: Foundations and algorithms, Improved bounds for the RIP of Subsampled Circulant matrices, Robust one-bit compressed sensing with partial circulant matrices, Quantized Compressed Sensing: A Survey, Sparse power factorization: balancing peakiness and sample complexity, Endpoint Results for Fourier Integral Operators on Noncompact Symmetric Spaces, Preserving injectivity under subgaussian mappings and its application to compressed sensing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- The restricted isometry property for time-frequency structured random matrices
- Remote sensing via \(\ell_1\)-minimization
- Restricted isometries for partial random circulant matrices
- Sparse recovery under weak moment assumptions
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
- Interpolation via weighted \(\ell_{1}\) minimization
- Sparsity in time-frequency representations
- A simple proof of the restricted isometry property for random matrices
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
- Fast dimension reduction using Rademacher series on dual BCH codes
- Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
- \(5n\) Minkowski symmetrizations suffice to arrive at an approximate Euclidean ball
- Remarks on the geometry of coordinate projections in \(\mathbb{R}^n\)
- The convex geometry of linear inverse problems
- Refined analysis of sparse MIMO radar
- Reconstruction and subgaussian operators in asymptotic geometric analysis
- Fast and RIP-optimal transforms
- Suprema of Chaos Processes and the Restricted Isometry Property
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Small Ball Probabilities for Linear Images of High-Dimensional Distributions
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Compressive Sensing by Random Convolution
- Atomic Decomposition by Basis Pursuit
- The Restricted Isometry Property of Subsampled Fourier Matrices
- An Improved Estimate in the Restricted Isometry Problem
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Upper and Lower Bounds for Stochastic Processes
- Compressed sensing
