Pages that link to "Item:Q1029209"
From MaRDI portal
The following pages link to Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit (Q1029209):
Displayed 50 items.
- Orthogonal one step greedy procedure for heteroscedastic linear models (Q254223) (← links)
- Deterministic convolutional compressed sensing matrices (Q324274) (← links)
- Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763) (← links)
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Robust sparse phase retrieval made easy (Q347523) (← links)
- Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain (Q362320) (← links)
- Restricted isometries for partial random circulant matrices (Q412402) (← links)
- Compressive sensing of analog signals using discrete prolate spheroidal sequences (Q448495) (← links)
- Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions (Q467114) (← links)
- Sparse time-frequency representation of nonlinear and nonstationary data (Q476519) (← links)
- Robustness of orthogonal matching pursuit under restricted isometry property (Q476748) (← links)
- Analysis of orthogonal multi-matching pursuit under restricted isometry property (Q477291) (← links)
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing (Q508757) (← links)
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) (Q544714) (← links)
- Effective band-limited extrapolation relying on Slepian series and \(\ell^1\) regularization (Q611457) (← links)
- Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
- Improved stability conditions of BOGA for noisy block-sparse signals (Q634875) (← links)
- Explicit constructions of RIP matrices and related problems (Q635478) (← links)
- On performance of greedy algorithms (Q719355) (← links)
- Iterative hard thresholding for compressed sensing (Q734323) (← links)
- Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots (Q739462) (← links)
- Regularized feature selection in reinforcement learning (Q747290) (← links)
- Lebesgue-type inequalities in greedy approximation (Q826481) (← links)
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
- Comparison of parametric sparse recovery methods for ISAR image formation (Q893680) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549) (← links)
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\) (Q1012556) (← links)
- On a simple derivation of the complementary matching pursuit (Q1048880) (← links)
- The time-domain integration method of digital subtraction angiography images (Q1634229) (← links)
- MIMO radar imaging based on smoothed \(l_0\) norm (Q1666726) (← links)
- Greedy subspace pursuit for joint sparse recovery (Q1736381) (← links)
- Large-scale hyperspectral image compression via sparse representations based on online learning (Q1787085) (← links)
- Peeling decoding of LDPC codes with applications in compressed sensing (Q1793437) (← links)
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements (Q1946588) (← links)
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations (Q1957932) (← links)
- Data-driven time-frequency analysis (Q2252154) (← links)
- Fast thresholding algorithms with feedbacks for sparse signal recovery (Q2252504) (← links)
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO (Q2252508) (← links)
- Stability and instance optimality for Gaussian measurements in compressed sensing (Q2269902) (← links)
- Deterministic constructions of compressed sensing matrices based on codes (Q2311429) (← links)
- Alternating direction method of multipliers for solving dictionary learning models (Q2343040) (← links)
- Greedy approximation in convex optimization (Q2343051) (← links)
- Sparse representation for blind spectrum sensing in cognitive radio: a compressed sensing approach (Q2362610) (← links)
- Splitting matching pursuit method for reconstructing sparse signal in compressed sensing (Q2375672) (← links)
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
- A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
- Theory and applications of compressed sensing (Q2864809) (← links)
- SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES (Q2879425) (← links)