Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
From MaRDI portal
Random matrices (algebraic aspects) (15B52) Estimation in multivariate analysis (62H12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13) Sampling theory in information and communication theory (94A20)
Recommendations
- Deterministic constructions of compressed sensing matrices
- Deterministic convolutional compressed sensing matrices
- Deterministic construction of compressed sensing matrices over finite sets
- Deterministic construction of compressed sensing matrices with characters over finite fields
- Nonuniform sparse recovery with subgaussian matrices
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Atomic Decomposition by Basis Pursuit
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
- Compressed sensing
- Convex Polytopes
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Decoding by Linear Programming
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Disciplined convex programming
- Explicit constructions of RIP matrices and related problems
- Grassmannian frames with applications to coding and communication
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Near-ideal model selection by \(\ell _{1}\) minimization
- Neighborliness of randomly projected simplices in high dimensions
- Noiselets
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- On the conditioning of random subdictionaries
- On the linear independence of spikes and sines
- Probing the Pareto frontier for basis pursuit solutions
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- The finite harmonic oscillator and its associated sequences
- The road to deterministic matrices with the restricted isometry property
- Uncertainty principles and ideal atomic decomposition
- Uncertainty Principles and Signal Recovery
- Universality in polytope phase transitions and message passing algorithms
Cited in
(19)- Reducing effects of bad data using variance based joint sparsity recovery
- Derandomized compressed sensing with nonuniform guarantees for _1 recovery
- Bipolar measurement matrix using chaotic sequence
- Uniform recovery from subgaussian multi-sensor measurements
- Empirical average-case relation between undersampling and sparsity in X-ray CT
- Mean breakdown points for compressed sensing by uniformly distributed matrices
- Performance comparisons of greedy algorithms in compressed sensing.
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Reed-Muller sensing matrices and the LASSO (invited paper)
- Joint sparse recovery based on variances
- The restricted isometry property for random block diagonal matrices
- On the universality of noiseless linear estimation with respect to the measurement matrix
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- The phase transition of matrix recovery from Gaussian measurements matches the minimax MSE of matrix denoising
- CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction
- Universality of approximate message passing with semirandom matrices
- Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
- Universality of approximate message passing algorithms and tensor networks
- Universality laws for Gaussian mixtures in generalized linear models
This page was built for publication: Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170951)
