Pages that link to "Item:Q3546643"
From MaRDI portal
The following pages link to Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information (Q3546643):
Displayed 50 items.
- Inexact accelerated augmented Lagrangian methods (Q887168) (← 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)
- Noncommutative uncertainty principles (Q892686) (← links)
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems (Q892792) (← links)
- Optimal dual certificates for noise robustness bounds in compressive sensing (Q892815) (← links)
- Comparison of parametric sparse recovery methods for ISAR image formation (Q893680) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- Extensions of Gauss quadrature via linear programming (Q896553) (← links)
- Kernel-based sparse representation for gesture recognition (Q898216) (← links)
- A multivariate generalization of Prony's method (Q898788) (← links)
- Noisy 1-bit compressive sensing: models and algorithms (Q900771) (← links)
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements (Q904283) (← links)
- From compression to compressed sensing (Q905909) (← links)
- On the conditioning of random subdictionaries (Q930731) (← links)
- Uncertainty in time-frequency representations on finite Abelian groups and applications (Q942155) (← links)
- Coorbit theory, multi-\(\alpha \)-modulation frames, and the concept of joint sparsity for medical multichannel data analysis (Q966764) (← links)
- Sparsity in time-frequency representations (Q967573) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- Deterministic \(k\)-set structure (Q975518) (← links)
- Segmentation of ARX-models using sum-of-norms regularization (Q976288) (← links)
- Sparse recovery by non-convex optimization - instance optimality (Q984656) (← links)
- On compressive sensing applied to radar (Q985460) (← links)
- A note on compressed sensing and the complexity of matrix multiplication (Q987795) (← links)
- Functional dissipation microarrays for classification (Q996417) (← links)
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery (Q1006638) (← links)
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- Compressive sensing for multi-static scattering analysis (Q1017608) (← links)
- Average performance of the approximation in a dictionary using an \(\ell _0\) objective (Q1018130) (← links)
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit (Q1029209) (← links)
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit (Q1029548) (← links)
- Random projections of smooth manifolds (Q1029551) (← links)
- Compressive sensing for subsurface imaging using ground penetrating radar (Q1032423) (← links)
- Nonlinear least squares in \(\mathbb R^{N}\) (Q1038734) (← links)
- Time-frequency localization and sampling of multiband signals (Q1038744) (← links)
- Sparse solutions to underdetermined Kronecker product systems (Q1039753) (← links)
- A simple proof of the restricted isometry property for random matrices (Q1039884) (← links)
- Mixed linear system estimation and identification (Q1046675) (← links)
- Estimating the dimension of a model (Q1247128) (← links)
- Observable dictionary learning for high-dimensional statistical inference (Q1639590) (← links)
- A flexible coordinate descent method (Q1639710) (← links)
- Stronger uncertainty relations with improvable upper and lower bounds (Q1679281) (← links)
- Sparsity enabled cluster reduced-order models for control (Q1683852) (← links)
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector (Q1686207) (← links)
- Random perturbation of low rank matrices: improving classical bounds (Q1688904) (← links)
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries (Q1691985) (← links)
- Estimating averages of order statistics of bivariate functions (Q1692239) (← links)