Compressive sensing and structured random matrices
From MaRDI portal
Publication:3078293
zbMATH Open1208.15027MaRDI QIDQ3078293FDOQ3078293
Authors: Holger Rauhut 
Publication date: 18 February 2011
Recommendations
compressive sensingcondition numbers\(\ell_1\)-minimizationbasis pursuitpartial random circulant matrixKhintchine inequalitiesbounded orthogonal systemsstructured random matricesrandom partial Fourier matrix
Convex programming (90C25) Linear programming (90C05) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20) Sums of independent random variables; random walks (60G50) Conditioning of matrices (15A12) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Toeplitz, Cauchy, and related matrices (15B05) Orthogonal matrices (15B10) Trigonometric polynomials, inequalities, extremal problems (42A05) Sampling theory in information and communication theory (94A20) Probabilistic methods for one variable harmonic analysis (42A61)
Cited In (only showing first 100 items - show all)
- Fusion frames and distributed sparsity
- Structured random measurements in signal processing
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- A mathematical introduction to compressive sensing
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Remote sensing via \(\ell_1\)-minimization
- Sparse Legendre expansions via \(\ell_1\)-minimization
- On linear versus nonlinear approximation in the average case setting
- Compressive Sensing on Manifolds Using a Nonparametric Mixture of Factor Analyzers: Algorithm and Performance Bounds
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Sparsest representations and approximations of an underdetermined linear system
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- New analysis of manifold embeddings and signal recovery from compressive measurements
- Robust width: a characterization of uniformly stable and robust compressed sensing
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- Greedy variance estimation for the LASSO
- Spark-level sparsity and the \(\ell_1\) tail minimization
- Generalized notions of sparsity and restricted isometry property. II: Applications
- Fast and RIP-optimal transforms
- Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
- Average best \(m\)-term approximation
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- Binary Matrices for Compressed Sensing
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions
- Analysis of sparse MIMO radar
- Multiarray signal processing: tensor decomposition meets compressed sensing
- Improved bounds for the RIP of subsampled circulant matrices
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing
- New bounds for RIC in compressed sensing
- Low rank tensor recovery via iterative hard thresholding
- Deterministic convolutional compressed sensing matrices
- Restricted isometries for partial random circulant matrices
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- Sparse reconstruction with multiple Walsh matrices
- The restricted isometry property for random block diagonal matrices
- Sparse recovery on Euclidean Jordan algebras
- Cosparsity in Compressed Sensing
- Matrix concentration inequalities via the method of exchangeable pairs
- Interpolation via weighted \(\ell_{1}\) minimization
- Least squares polynomial chaos expansion: a review of sampling strategies
- Moment inequalities for matrix-valued U-statistics of order 2
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Basis adaptive sample efficient polynomial chaos (BASE-PC)
- Learning general sparse additive models from point queries in high dimensions
- Embeddings of operator ideals into \(\mathcal{L}_p\)-spaces on finite von Neumann algebras
- The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
- Compressed sensing with structured sparsity and structured acquisition
- Sampling discretization and related problems
- Noncommutative Bennett and Rosenthal inequalities
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit
- Refined analysis of sparse MIMO radar
- Compressing Rank-Structured Matrices via Randomized Sampling
- The restricted isometry property for time-frequency structured random matrices
- Improved bounds for sparse recovery from subsampled random convolutions
- Sparse representation of signals in Hardy space
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- Compressive imaging and characterization of sparse light deflection maps
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Compressive sensing with redundant dictionaries and structured measurements
- Discrete uncertainty principles and sparse signal processing
- Sparse signal recovery using a new class of random matrices
- Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
- The Restricted Isometry Property of Subsampled Fourier Matrices
- Sampling, denoising and compression of matrices by coherent matrix organization
- Total variation reconstruction from quadratic measurements
- A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs
- Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis
- Sparse recovery of sound fields using measurements from moving microphones
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Gradient projection Newton pursuit for sparsity constrained optimization
- Fast sparse reconstruction: Greedy inverse scale space flows
- Short-term memory capacity in networks via the restricted isometry property
- Title not available (Why is that?)
- On collaborative compressive sensing systems: the framework, design, and algorithm
- Analysis of Regularized LS Reconstruction and Random Matrix Ensembles in Compressed Sensing
- Embracing off-the-grid samples
- Sparse system identification in pairs of pulse and Takenaka-Malmquist bases
- Quantized compressed sensing for random circulant matrices
- A short introduction to compressive sensing
- Convergence bounds for empirical nonlinear least-squares
- Extracting Sparse High-Dimensional Dynamics from Limited Data
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
- Compressive Spectral Estimation for Nonstationary Random Processes
- Norm and trace estimation with random rank-one vectors
- \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace
- Analysis of sparse recovery for Legendre expansions using envelope bound
- A new upper bound for sampling numbers
- Optimal compressive imaging of Fourier data
- Worst-case recovery guarantees for least squares approximation using random samples
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- On the strong restricted isometry property of Bernoulli random matrices
- Fast and memory-optimal dimension reduction using Kac's walk
- Multilevel preconditioning and adaptive sparse solution of inverse problems
This page was built for publication: Compressive sensing and structured random matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3078293)
