Pages that link to "Item:Q1012549"
From MaRDI portal
The following pages link to CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549):
Displaying 50 items.
- Compressive sensing-based wind speed estimation for low-altitude wind-shear with airborne phased array radar (Q784564) (← links)
- Lebesgue-type inequalities in greedy approximation (Q826481) (← links)
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations (Q829377) (← links)
- RBF-network based sparse signal recovery algorithm for compressed sensing reconstruction (Q889379) (← links)
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems (Q892792) (← links)
- Sampling in the analysis transform domain (Q900778) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery (Q1006638) (← links)
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549) (← links)
- Compressive sensing for subsurface imaging using ground penetrating radar (Q1032423) (← links)
- On a simple derivation of the complementary matching pursuit (Q1048880) (← links)
- LOL selection in high dimension (Q1621355) (← links)
- Observable dictionary learning for high-dimensional statistical inference (Q1639590) (← links)
- A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint (Q1662582) (← links)
- Variable selection for high dimensional Gaussian copula regression model: an adaptive hypothesis testing procedure (Q1662864) (← links)
- On the uniqueness of the sparse signals reconstruction based on the missing samples variation analysis (Q1666192) (← links)
- PROMP: a sparse recovery approach to lattice-valued signals (Q1669069) (← links)
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP (Q1673807) (← links)
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries (Q1691985) (← links)
- A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit (Q1700711) (← links)
- A two-level method for sparse time-frequency representation of multiscale data (Q1703872) (← links)
- Using B-spline frames to represent solutions of acoustics scattering problems (Q1715829) (← links)
- Error in the reconstruction of nonsparse images (Q1720910) (← links)
- Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
- Maximal solutions of sparse analysis regularization (Q1730389) (← links)
- Spark-level sparsity and the \(\ell_1\) tail minimization (Q1748258) (← links)
- Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem (Q1785036) (← links)
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing (Q1792868) (← links)
- On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain (Q1793419) (← links)
- Compressive sensing in signal processing: algorithms and transform domain formulations (Q1793545) (← links)
- A novel detection scheme with multiple observations for sparse signal based on likelihood ratio test with sparse estimation (Q1793681) (← links)
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements (Q1946588) (← links)
- Sparse signal recovery via ECME thresholding pursuits (Q1954822) (← links)
- A short note on compressed sensing with partially known signal support (Q1957941) (← links)
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design (Q1985532) (← links)
- Restricted strong convexity implies weak submodularity (Q1990594) (← links)
- Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion (Q1990969) (← links)
- Rapid compressed sensing reconstruction: a semi-tensor product approach (Q1999186) (← links)
- Sparse power factorization: balancing peakiness and sample complexity (Q2000543) (← links)
- A performance guarantee for orthogonal matching pursuit using mutual coherence (Q2003290) (← links)
- Sparse approximate reconstruction decomposed by two optimization problems (Q2003320) (← links)
- Analysis of the self projected matching pursuit algorithm (Q2005321) (← links)
- An algebraic perspective on integer sparse recovery (Q2007643) (← links)
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes (Q2008183) (← links)
- Stochastic greedy algorithms for multiple measurement vectors (Q2028927) (← links)
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables (Q2031058) (← links)
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
- A unified primal dual active set algorithm for nonconvex sparse recovery (Q2038299) (← links)
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time (Q2038427) (← links)
