Restricted isometries for partial random circulant matrices

DOI10.1016/j.acha.2011.05.001zbMath1245.15040OpenAlexW2963302510WikidataQ59750705 ScholiaQ59750705MaRDI QIDQ412402

Holger Rauhut, Justin Romberg, Joel A. Tropp

Publication date: 4 May 2012

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/29569/

zbMATH Keywords

sparsityoptimal scalingcompressed sensingrestricted isometry constantDudley inequalitypartial random circulant matrixRademacher chaos process

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Random matrices (algebraic aspects) (15B52)

Related Items

Randomized numerical linear algebra: Foundations and algorithms, Improved bounds for sparse recovery from subsampled random convolutions, A Novel Compressed Sensing Scheme for Photoacoustic Tomography, Compressive Sensing with Redundant Dictionaries and Structured Measurements, Deterministic convolutional compressed sensing matrices, Sparse Model Uncertainties in Compressed Sensing with Application to Convolutions and Sporadic Communication, Cosparsity in Compressed Sensing, Recovery error analysis of noisy measurement in compressed sensing, Suprema of Chaos Processes and the Restricted Isometry Property, The restricted isometry property for time-frequency structured random matrices, Quantization of compressive samples with stable and robust recovery, Enhanced total variation minimization for stable image reconstruction, A variant of the Johnson-Lindenstrauss lemma for circulant matrices, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, Time for dithering: fast and quantized random embeddings via the restricted isometry property, Compressive Sensing, LONELY RUNNERS IN FUNCTION FIELDS, Compressive time-of-flight 3D imaging using block-structured sensing matrices, The restricted isometry property for random block diagonal matrices, Learning circulant sensing kernels, An enhanced diagnosis method for weak fault features of bearing acoustic emission signal based on compressed sensing, Signal analysis based on complex wavelet signs, Real-valued embeddings and sketches for fast distance and similarity estimation, Fast and RIP-optimal transforms, Optimal fast Johnson-Lindenstrauss embeddings for large data sets, Structured random measurements in signal processing, Quantized compressed sensing for random circulant matrices, Quasi-linear Compressed Sensing, Preconditioning filter bank decomposition using structured normalized tight frames, Theory and applications of compressed sensing, Compressive Imaging Through Optical Fiber with Partial Speckle Scanning, New analysis of manifold embeddings and signal recovery from compressive measurements

Uses Software

• PDCO
• CoSaMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse Legendre expansions via \(\ell_1\)-minimization
• The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
• A variant of the Johnson-Lindenstrauss lemma for circulant matrices
• Iterative hard thresholding for compressed sensing
• The restricted isometry property and its implications for compressed sensing
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• A simple proof of the restricted isometry property for random matrices
• Uniform uncertainty principle for Bernoulli and subgaussian ensembles
• Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
• Concentration inequalities using the entropy method
• Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
• Counting faces of randomly projected polytopes when the projection radically lowers dimension
• Compressed sensing and best 𝑘-term approximation
• New and Improved Johnson–Lindenstrauss Embeddings via 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
• Greed is Good: Algorithmic Results for Sparse Approximation
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Compressed Sensing and Redundant Dictionaries
• Stability Results for Random Sampling of Sparse Trigonometric Polynomials
• Level Sets and Extrema of Random Processes and Fields
• Compressive Sensing by Random Convolution
• Atomic Decomposition by Basis Pursuit
• High-Resolution Radar via Compressed Sensing
• Shifting Inequality and Recovery of Sparse Signals
• The Generic Chaining
• Sparse Approximate Solutions to Linear Systems
• Compressive Sensing
• Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
• Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• Operator Khintchine inequality in non-commutative probability