Pages that link to "Item:Q3546813"
From MaRDI portal
The following pages link to Stable recovery of sparse overcomplete representations in the presence of noise (Q3546813):
Displaying 50 items.
- Compressed sensing image restoration based on data-driven multi-scale tight frame (Q313691) (← links)
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations (Q347862) (← links)
- Sparse SAR imaging based on \(L_{1/2}\) regularization (Q362313) (← links)
- Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain (Q362320) (← links)
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization (Q364458) (← links)
- On greedy algorithms for dictionaries with bounded cumulative coherence (Q368218) (← links)
- Asymptotic properties of Lasso+mLS and Lasso+Ridge in sparse high-dimensional linear regression (Q389956) (← links)
- Model-based multiple rigid object detection and registration in unstructured range data (Q408868) (← links)
- Optimization over finite frame varieties and structured dictionary design (Q413650) (← links)
- Phase transition in limiting distributions of coherence of high-dimensional random matrices (Q413738) (← links)
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries (Q420768) (← links)
- The residual method for regularizing ill-posed problems (Q425458) (← links)
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization (Q427066) (← links)
- Two are better than one: fundamental parameters of frame coherence (Q427070) (← links)
- Sparse regression learning by aggregation and Langevin Monte-Carlo (Q439987) (← links)
- Mirror averaging with sparsity priors (Q442083) (← links)
- Existence of the best \(n\)-term approximants for structured dictionaries (Q444118) (← links)
- Stable recovery of sparse signals via \(\ell_p\)-minimization (Q466983) (← links)
- A new perspective on least squares under convex constraint (Q482891) (← links)
- Two-dimensional random projection (Q537260) (← links)
- A non-adapted sparse approximation of PDEs with stochastic inputs (Q543721) (← links)
- Sparse recovery under matrix uncertainty (Q605921) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Adaptive Dantzig density estimation (Q629798) (← links)
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization (Q633105) (← links)
- Direct data domain STAP using sparse representation of clutter spectrum (Q634042) (← links)
- Improved stability conditions of BOGA for noisy block-sparse signals (Q634875) (← links)
- Registration-based compensation using sparse representation in conformal-array STAP (Q635051) (← links)
- Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices (Q638800) (← links)
- Oracle inequalities and optimal inference under group sparsity (Q651028) (← links)
- Analysis of convergence for the alternating direction method applied to joint sparse recovery (Q668704) (← links)
- Noise folding in completely perturbed compressed sensing (Q670261) (← links)
- Spectral dynamics and regularization of incompletely and irregularly measured data (Q691305) (← links)
- On performance of greedy algorithms (Q719355) (← links)
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection (Q729190) (← links)
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations (Q729367) (← links)
- Some theoretical results on the grouped variables Lasso (Q734551) (← links)
- Three novel edge detection methods for incomplete and noisy spectral data (Q734948) (← links)
- Linear convergence of iterative soft-thresholding (Q734951) (← links)
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms (Q734954) (← links)
- Overcomplete blind source separation based on generalized Gaussian function and SL0 norm (Q736930) (← links)
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264) (← links)
- Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals (Q741817) (← links)
- Theoretical guarantees for graph sparse coding (Q778037) (← links)
- Direction of arrival estimation via reweighted \(l_1\) norm penalty algorithm for monostatic MIMO radar (Q784565) (← links)
- Some sharp performance bounds for least squares regression with \(L_1\) regularization (Q834334) (← links)
- Near-ideal model selection by \(\ell _{1}\) minimization (Q834335) (← links)
- Sparsity in penalized empirical risk minimization (Q838303) (← links)
- Fields of experts (Q847491) (← links)
