Deterministic constructions of compressed sensing matrices
From MaRDI portal
Publication:2465825
DOI10.1016/j.jco.2007.04.002zbMath1134.94312OpenAlexW2156043924MaRDI QIDQ2465825
Publication date: 9 January 2008
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2007.04.002
Related Items
Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery, New explicit binary constant weight codes from Reed-Solomon codes, Derandomizing restricted isometries via the Legendre symbol, Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing, Compressed sensing by inverse scale space and curvelet thresholding, Compressive Sensing with Redundant Dictionaries and Structured Measurements, A class of deterministic sensing matrices and their application in harmonic detection, Deterministic convolutional compressed sensing matrices, Explicit Matrices with the Restricted Isometry Property: Breaking the Square-Root Bottleneck, Coherence of sensing matrices coming from algebraic-geometric codes, Deterministic construction of compressed sensing matrices with characters over finite fields, Error bounds for compressed sensing algorithms with group sparsity: A unified approach, Explicit universal sampling sets in finite vector spaces, Kesten-McKay law for random subensembles of Paley equiangular tight frames, Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields, Compressed sensing construction for underdetermined source separation, Performance analysis of the compressed distributed least squares algorithm, Robust recovery of a kind of weighted l1-minimization without noise level, RBF-network based sparse signal recovery algorithm for compressed sensing reconstruction, Strengthening hash families and compressive sensing, Non-Cartesian spiral binary sensing matrices, Framework for segmented threshold \(\ell_0\) gradient approximation based network for sparse signal recovery, Explicit RIP matrices: an update, Contractive symmetric matrix completion problems related to graphs, A hierarchical framework for recovery in compressive sensing, A new construction for \(q\)-ary constant weight codes, Deterministic construction of compressed sensing matrices from constant dimension codes, On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries, Deterministic construction of compressed sensing matrices based on semilattices, Sparse representations and approximation theory, Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method, Unnamed Item, On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization, Deterministic sampling of sparse trigonometric polynomials, Explicit constructions of RIP matrices and related problems, The Shannon total variation, Bipolar measurement matrix using chaotic sequence, Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification, The restricted isometry property for random block diagonal matrices, The road to deterministic matrices with the restricted isometry property, Steiner equiangular tight frames, Discrete optimization methods for group model selection in compressed sensing, An enhanced diagnosis method for weak fault features of bearing acoustic emission signal based on compressed sensing, Mathematics of Analog‐to‐Digital Conversion, Dictionary descent in optimization, An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices, Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time, Computing the spark: mixed-integer programming for the (vector) matroid girth problem, Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes, Sparse approximate solution of partial differential equations, Combinatorial sublinear-time Fourier algorithms, Linearized Bregman iterations for compressed sensing, Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields, On the sparseness of 1-norm support vector machines, What is a Frame? Theory and Applications of Frames, Sets of unit vectors with small subset sums, An effective algorithm for the spark of sparse binary measurement matrices, Construction of Sparse Binary Sensing Matrices Using Set Systems, Analysis of compressed distributed adaptive filters, Instance-optimality in probability with an \(\ell _1\)-minimization decoder, Optimal non-linear models for sparsity and sampling, Welch bound-achieving compressed sensing matrices from optimal codebooks, Sampling schemes and recovery algorithms for functions of few coordinate variables, Deterministic Construction of Compressed Sensing Matrices from Codes, Deterministic constructions of compressed sensing matrices based on codes, Nonlinear least squares in \(\mathbb R^{N}\), Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs, Deterministic construction of sparse binary matrices via incremental integer optimization, Theory and applications of compressed sensing, An asymptotic existence result on compressed sensing matrices, Group-theoretic constructions of erasure-robust frames
Cites Work
- A simple proof of the restricted isometry property for random matrices
- Trigonometric diameters of the Sobolev classes \(W^ r_ p\) in the space \(L_ q\)
- Compressed sensing and best 𝑘-term approximation
- NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS
- Decoding by Linear Programming
- Compressed sensing
- Unnamed Item
- Unnamed Item
- Unnamed Item
