Derandomized compressed sensing with nonuniform guarantees for _1 recovery
From MaRDI portal
(Redirected from Publication:2124653)
Derandomized compressed sensing with nonuniform guarantees for \(\ell 1\) recovery
Derandomized compressed sensing with nonuniform guarantees for \(\ell 1\) recovery
Abstract: We extend the techniques of H"{u}gel, Rauhut and Strohmer (Found. Comput. Math., 2014) to show that for every , there exists an explicit random partial Fourier matrix with and entropy such that for every -sparse signal , there exists an event of probability at least over which is the unique minimizer of subject to . The bulk of our analysis uses tools from decoupling to estimate the extreme singular values of the submatrix of whose columns correspond to the support of .
Recommendations
Cites work
- scientific article; zbMATH DE number 6026126 (Why is no real title available?)
- A conditional construction of restricted isometries
- A mathematical introduction to compressive sensing
- A simple proof of the restricted isometry property for random matrices
- An Improved Estimate in the Restricted Isometry Problem
- An introduction to matrix concentration inequalities
- Breaking the k 2 barrier for explicit RIP matrices
- Certifying the Restricted Isometry Property is Hard
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
- Compressed sensing
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Derandomizing restricted isometries via the Legendre symbol
- Deterministic constructions of compressed sensing matrices
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Equiangular Tight Frames From Hyperovals
- Equiangular tight frames from Paley tournaments
- Explicit constructions of RIP matrices and related problems
- Explicit matrices with the restricted isometry property: breaking the square-root bottleneck
- Extensions of Lipschitz mappings into a Hilbert space
- Foundations of Cryptography
- High-dimensional probability. An introduction with applications in data science
- Kesten-McKay law for random subensembles of Paley equiangular tight frames
- Kirkman Equiangular Tight Frames and Codes
- Living on the edge: phase transitions in convex programs with random data
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- On sparse reconstruction from Fourier and Gaussian measurements
- On the conditioning of random subdictionaries
- Probability Inequalities for Sums of Bounded Random Variables
- Random Subsets of Structured Deterministic Frames have MANOVA Spectra
- Remote sensing via _1-minimization
- Restricted isometry of Fourier matrices and list decodability of random linear codes
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Steiner equiangular tight frames
- Suprema of chaos processes and the restricted isometry property
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- The restricted isometry property and its implications for compressed sensing
- The road to deterministic matrices with the restricted isometry property
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
- User-friendly tail bounds for sums of random matrices
Cited in
(8)- Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
- Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing
- Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
- Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression)
- Theory of compressive sensing via _1-minimization: a non-RIP analysis and extensions
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
This page was built for publication: Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124653)