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