Improved bounds for the RIP of Subsampled Circulant matrices
From MaRDI portal
Publication:3379762
zbMath1470.65072arXiv1808.07333MaRDI QIDQ3379762
Meng Huang, Zhiqiang Xu, Yuxuan Pang
Publication date: 27 September 2021
Full work available at URL: https://arxiv.org/abs/1808.07333
Computational methods for sparse matrices (65F50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items
Uses Software
Cites Work
- Unnamed Item
- A mathematical introduction to compressive sensing
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
- Improved bounds for sparse recovery from subsampled random convolutions
- Atomic Decomposition by Basis Pursuit
- Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
- Suprema of Chaos Processes and the Restricted Isometry Property
- The Performance of Orthogonal Multi-Matching Pursuit under the Restricted Isometry Property
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressive Sensing by Random Convolution
- Sparse Approximate Solutions to Linear Systems
- An Improved Estimate in the Restricted Isometry Problem
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- The Restricted Isometry Property of Subsampled Fourier Matrices
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
