Compressive sensing and structured random matrices
From MaRDI portal
Publication:3078293
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)
Recommendations
Cited in
(only showing first 100 items - show all)- Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions
- Robust width: a characterization of uniformly stable and robust compressed sensing
- The restricted isometry property for random block diagonal matrices
- On linear versus nonlinear approximation in the average case setting
- Sparse recovery on Euclidean Jordan algebras
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- New analysis of manifold embeddings and signal recovery from compressive measurements
- Compressive Sensing on Manifolds Using a Nonparametric Mixture of Factor Analyzers: Algorithm and Performance Bounds
- Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
- Fast and RIP-optimal transforms
- Compressive sensing with redundant dictionaries and structured measurements
- Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
- Noncommutative Bennett and Rosenthal inequalities
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Cosparsity in Compressed Sensing
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit
- Compressing Rank-Structured Matrices via Randomized Sampling
- A mathematical introduction to compressive sensing
- Fusion frames and distributed sparsity
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Spark-level sparsity and the \(\ell_1\) tail minimization
- Moment inequalities for matrix-valued U-statistics of order 2
- Restricted isometries for partial random circulant matrices
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Remote sensing via \(\ell_1\)-minimization
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery
- Average best \(m\)-term approximation
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- Analysis of sparse MIMO radar
- The restricted isometry property for time-frequency structured random matrices
- The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- Discrete uncertainty principles and sparse signal processing
- Multiarray signal processing: tensor decomposition meets compressed sensing
- Improved bounds for sparse recovery from subsampled random convolutions
- Low rank tensor recovery via iterative hard thresholding
- Compressed sensing with structured sparsity and structured acquisition
- Matrix concentration inequalities via the method of exchangeable pairs
- Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing
- Improved bounds for the RIP of subsampled circulant matrices
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- Sparsest representations and approximations of an underdetermined linear system
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- Greedy variance estimation for the LASSO
- Binary Matrices for Compressed Sensing
- Structured random measurements in signal processing
- Sampling discretization and related problems
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- Sparse reconstruction with multiple Walsh matrices
- Deterministic convolutional compressed sensing matrices
- Sparse signal recovery using a new class of random matrices
- Least squares polynomial chaos expansion: a review of sampling strategies
- Embeddings of operator ideals into \(\mathcal{L}_p\)-spaces on finite von Neumann algebras
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Sampling, denoising and compression of matrices by coherent matrix organization
- Total variation reconstruction from quadratic measurements
- Basis adaptive sample efficient polynomial chaos (BASE-PC)
- Sparse representation of signals in Hardy space
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Learning general sparse additive models from point queries in high dimensions
- Interpolation via weighted \(\ell_{1}\) minimization
- Compressive imaging and characterization of sparse light deflection maps
- Refined analysis of sparse MIMO radar
- Generalized notions of sparsity and restricted isometry property. II: Applications
- Minimization of \(\ell_{1-2}\) for compressed sensing
- New bounds for RIC in compressed sensing
- \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace
- Extracting Sparse High-Dimensional Dynamics from Limited Data
- scientific article; zbMATH DE number 6497011 (Why is no real title available?)
- Quantized compressed sensing for random circulant matrices
- Analysis of sparse recovery for Legendre expansions using envelope bound
- On collaborative compressive sensing systems: the framework, design, and algorithm
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Gradient projection Newton pursuit for sparsity constrained optimization
- A short introduction to compressive sensing
- A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
- Optimal compressive imaging of Fourier data
- Multilevel preconditioning and adaptive sparse solution of inverse problems
- Sparse approximation using \(\ell_1-\ell_2\) minimization and its application to stochastic collocation
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- Short-term memory capacity in networks via the restricted isometry property
- Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- Convergence bounds for empirical nonlinear least-squares
- Fast sparse reconstruction: Greedy inverse scale space flows
- On the strong restricted isometry property of Bernoulli random matrices
- Worst-case recovery guarantees for least squares approximation using random samples
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
- A new upper bound for sampling numbers
- Sparse recovery of sound fields using measurements from moving microphones
- Sparse system identification in pairs of pulse and Takenaka-Malmquist bases
- Norms of structured random matrices
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs
- Compressive Spectral Estimation for Nonstationary Random Processes
- A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
- Norm and trace estimation with random rank-one vectors
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)
