The road to deterministic matrices with the restricted isometry property

DOI10.1007/s00041-013-9293-2zbMath1306.15031arXiv1202.1234OpenAlexW2594481206MaRDI QIDQ485193

Matthew Fickus, Afonso S. Bandeira, Dustin G. Mixon, Percy Wong

Publication date: 9 January 2015

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.1234

zbMATH Keywords

random matricesPaley graphscompressed sensingrestricted isometry propertyequiangular tight frames

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Association schemes, strongly regular graphs (05E30) Inequalities involving eigenvalues and eigenvectors (15A42) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Large deviations (60F10) Random matrices (algebraic aspects) (15B52)

Related Items (38)

Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery ⋮ Derandomizing restricted isometries via the Legendre symbol ⋮ Explicit Matrices with the Restricted Isometry Property: Breaking the Square-Root Bottleneck ⋮ Achieving the orthoplex bound and constructing weighted complex projective 2-designs with Singer sets ⋮ Equiangular tight frames that contain regular simplices ⋮ Neural collapse with unconstrained features ⋮ Hadamard equiangular tight frames ⋮ Kesten-McKay law for random subensembles of Paley equiangular tight frames ⋮ Frames over finite fields: basic theory and equiangular lines in unitary geometry ⋮ Uniform approximation property of frames with applications to erasure recovery ⋮ The Optimal Packing of Eight Points in the Real Projective Plane ⋮ The core of a Grassmannian frame ⋮ Full spark frames ⋮ Equiangular tight frames from group divisible designs ⋮ Equiangular tight frames with centroidal symmetry ⋮ Doubly transitive lines. II: Almost simple symmetries ⋮ Numerically erasure-robust frames ⋮ Discrete uncertainty principles and sparse signal processing ⋮ Grassmannian codes from paired difference sets ⋮ Doubly transitive lines. I: Higman pairs and roux ⋮ On the restricted isometry property of the Paley matrix ⋮ Optimal line packings from nonabelian groups ⋮ Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices ⋮ Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization ⋮ Unnamed Item ⋮ What is a Frame? Theory and Applications of Frames ⋮ Packings in Real Projective Spaces ⋮ Harmonic equiangular tight frames comprised of regular simplices ⋮ SAGA: sparse and geometry-aware non-negative matrix factorization through non-linear local embedding ⋮ Equiangular tight frames and unistochastic matrices ⋮ Structured iterative hard thresholding with on- and off-grid applications ⋮ Frames over finite fields: equiangular lines in orthogonal geometry ⋮ Polyphase equiangular tight frames and abelian generalized quadrangles ⋮ Globally Optimizing Small Codes in Real Projective Spaces ⋮ A Notion of Optimal Packings of Subspaces with Mixed-Rank and Solutions ⋮ Group-theoretic constructions of erasure-robust frames ⋮ Orthogonal one step greedy procedure for heteroscedastic linear models ⋮ Sparse PSD approximation of the PSD cone

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit constructions of RIP matrices and related problems
• Steiner equiangular tight frames
• On the construction of equiangular frames from graphs
• The restricted isometry property and its implications for compressed sensing
• Equiangular tight frames from Paley tournaments
• Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
• A simple proof of the restricted isometry property for random matrices
• Exponential inequalities for sums of random vectors
• Chebotarëv and his density theorem
• Grassmannian frames with applications to coding and communication
• Adaptive estimation of a quadratic functional by model selection.
• Full spark frames
• Deterministic constructions of compressed sensing matrices
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Certifying the Restricted Isometry Property is Hard
• CLIQUE NUMBERS OF PALEY GRAPHS
• Greedy Approximation
• Expander graphs and their applications
• On sparse reconstruction from Fourier and Gaussian measurements
• Decoding by Linear Programming
• Achieving the Welch Bound With Difference Sets
• Stability Results for Random Sampling of Sparse Trigonometric Polynomials
• On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Sparse Approximate Solutions to Linear Systems
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Approximating the Cut-Norm via Grothendieck's Inequality
• Quasi-random graphs

This page was built for publication: The road to deterministic matrices with the restricted isometry property