Pages that link to "Item:Q3079195"
From MaRDI portal
The following pages link to Compressed sensing and best 𝑘-term approximation (Q3079195):
Displaying 50 items.
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (Q2260650) (← links)
- Stability and instance optimality for Gaussian measurements in compressed sensing (Q2269902) (← links)
- On the differences between \(L_2\) boosting and the Lasso (Q2288790) (← links)
- Deterministic constructions of compressed sensing matrices based on codes (Q2311429) (← links)
- New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization (Q2312513) (← links)
- Sparse reconstruction with multiple Walsh matrices (Q2317908) (← links)
- Truncated sparse approximation property and truncated \(q\)-norm minimization (Q2322801) (← links)
- Sampling strategies for uncertainty reduction in categorical random fields: formulation, mathematical analysis and application to multiple-point simulations (Q2325286) (← links)
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
- On some aspects of approximation of ridge functions (Q2344299) (← links)
- New analysis of manifold embeddings and signal recovery from compressive measurements (Q2347898) (← links)
- Refined analysis of sparse MIMO radar (Q2360571) (← links)
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations (Q2374380) (← links)
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
- Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property (Q2397162) (← links)
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach (Q2399645) (← links)
- A new bound on the block restricted isometry constant in compressed sensing (Q2400748) (← links)
- Compressed sensing for finite-valued signals (Q2401311) (← links)
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields (Q2410045) (← links)
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
- Capturing ridge functions in high dimensions from point queries (Q2428577) (← links)
- Complexity of approximation of functions of few variables in high dimensions (Q2431335) (← links)
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries (Q2437330) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials (Q2447624) (← links)
- Deterministic constructions of compressed sensing matrices (Q2465825) (← links)
- Robust multi-image processing with optimal sparse regularization (Q2515365) (← links)
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation (Q2516375) (← links)
- Computing a quantity of interest from observational data (Q2631950) (← links)
- Compressive statistical learning with random feature moments (Q2664824) (← links)
- Optimal stable nonlinear approximation (Q2671290) (← links)
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing (Q2696571) (← links)
- Posterior information-based image measurement matrix optimization (Q2697739) (← links)
- On the sparsity of Lasso minimizers in sparse data recovery (Q2700886) (← links)
- (Q2787249) (← links)
- Compressive Sensing (Q2789803) (← links)
- Construction of Sparse Binary Sensing Matrices Using Set Systems (Q2801915) (← links)
- Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization (Q2846490) (← links)
- Sparse reconstruction of Hardy signal and applications to time-frequency distribution (Q2846509) (← links)
- Sparse Representation of Signals in Hardy Space (Q2847068) (← links)
- Theory and applications of compressed sensing (Q2864809) (← links)
- On sparse representation of analytic signal in Hardy space (Q2867872) (← links)
- Turán's new method and compressive sampling (Q2874922) (← links)
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING (Q2971048) (← links)
- Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
- Approximation Algorithms for Model-Based Compressive Sensing (Q2977311) (← links)
- SPARSE TEMPLATE-BASED VARIATIONAL IMAGE SEGMENTATION (Q3101551) (← links)
- Average Performance of the Sparsest Approximation Using a General Dictionary (Q3173502) (← links)
- An Introduction to Compressed Sensing (Q3296174) (← links)
- Sparse approximation based on a random overcomplete basis (Q3302727) (← links)
