Pages that link to "Item:Q2465825"
From MaRDI portal
The following pages link to Deterministic constructions of compressed sensing matrices (Q2465825):
Displaying 50 items.
- Derandomizing restricted isometries via the Legendre symbol (Q295815) (← links)
- A class of deterministic sensing matrices and their application in harmonic detection (Q318592) (← links)
- Deterministic convolutional compressed sensing matrices (Q324274) (← links)
- Coherence of sensing matrices coming from algebraic-geometric codes (Q326320) (← links)
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries (Q420768) (← links)
- The restricted isometry property for random block diagonal matrices (Q466970) (← links)
- The road to deterministic matrices with the restricted isometry property (Q485193) (← links)
- Dictionary descent in optimization (Q519963) (← links)
- Sparse representations and approximation theory (Q630502) (← links)
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization (Q633105) (← links)
- Explicit constructions of RIP matrices and related problems (Q635478) (← links)
- Steiner equiangular tight frames (Q665926) (← links)
- Instance-optimality in probability with an \(\ell _1\)-minimization decoder (Q734324) (← links)
- Optimal non-linear models for sparsity and sampling (Q734950) (← links)
- Deterministic construction of sparse binary matrices via incremental integer optimization (Q781884) (← links)
- RBF-network based sparse signal recovery algorithm for compressed sensing reconstruction (Q889379) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- Nonlinear least squares in \(\mathbb R^{N}\) (Q1038734) (← links)
- A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
- Deterministic construction of compressed sensing matrices based on semilattices (Q1698065) (← links)
- The Shannon total variation (Q1703959) (← links)
- On the sparseness of 1-norm support vector machines (Q1784565) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- An enhanced diagnosis method for weak fault features of bearing acoustic emission signal based on compressed sensing (Q1981093) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes (Q2008183) (← links)
- Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs (Q2078717) (← links)
- Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery (Q2124653) (← links)
- Deterministic construction of compressed sensing matrices from constant dimension codes (Q2197399) (← links)
- Bipolar measurement matrix using chaotic sequence (Q2207348) (← links)
- Discrete optimization methods for group model selection in compressed sensing (Q2235146) (← links)
- An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices (Q2251220) (← links)
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137) (← links)
- An effective algorithm for the spark of sparse binary measurement matrices (Q2287709) (← links)
- Analysis of compressed distributed adaptive filters (Q2288711) (← links)
- Sampling schemes and recovery algorithms for functions of few coordinate variables (Q2307488) (← links)
- Deterministic constructions of compressed sensing matrices based on codes (Q2311429) (← links)
- An asymptotic existence result on compressed sensing matrices (Q2347356) (← links)
- Group-theoretic constructions of erasure-robust frames (Q2348016) (← links)
- New explicit binary constant weight codes from Reed-Solomon codes (Q2363317) (← links)
- Compressed sensing by inverse scale space and curvelet thresholding (Q2378722) (← links)
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach (Q2399645) (← links)
- Explicit universal sampling sets in finite vector spaces (Q2399652) (← links)
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields (Q2410045) (← links)
- Compressed sensing construction for underdetermined source separation (Q2411721) (← links)
- Deterministic sampling of sparse trigonometric polynomials (Q2431334) (← links)
- Kesten-McKay law for random subensembles of Paley equiangular tight frames (Q2663141) (← links)
- Performance analysis of the compressed distributed least squares algorithm (Q2670748) (← links)
