Pages that link to "Item:Q3546508"

The following pages link to On Sparse Representations in Arbitrary Redundant Bases (Q3546508):

Displaying 50 items.

• Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm (Q256102) (← links)
• Computing and analyzing recoverable supports for sparse reconstruction (Q269197) (← links)
• Matrix sparsification and the sparse null space problem (Q329287) (← links)
• 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory (Q341409) (← links)
• Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization (Q364458) (← links)
• ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (Q372857) (← links)
• Simple bounds for recovering low-complexity models (Q378116) (← links)
• Remote sensing via \(\ell_1\)-minimization (Q404256) (← links)
• Phase transition in limiting distributions of coherence of high-dimensional random matrices (Q413738) (← links)
• Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization (Q427066) (← links)
• Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing (Q479909) (← links)
• Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
• A Barzilai-Borwein type method for minimizing composite functions (Q494671) (← links)
• On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
• A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• Sparse representations and approximation theory (Q630502) (← links)
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization (Q633105) (← links)
• Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices (Q638800) (← links)
• A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization (Q664941) (← links)
• Spectral dynamics and regularization of incompletely and irregularly measured data (Q691305) (← links)
• Processing MUSE hyperspectral data: denoising, deconvolution and detection of astrophysical sources (Q713913) (← links)
• Analysis of basis pursuit via capacity sets (Q734943) (← links)
• Minimizers of sparsity regularized Huber loss function (Q831370) (← links)
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure (Q877577) (← links)
• Exact support recovery for sparse spikes deconvolution (Q887157) (← links)
• Optimal dual certificates for noise robustness bounds in compressive sensing (Q892815) (← links)
• On the conditioning of random subdictionaries (Q930731) (← links)
• Sparsity in time-frequency representations (Q967573) (← links)
• When do stepwise algorithms meet subset selection criteria? (Q995431) (← links)
• Multiple sparse measurement gradient reconstruction algorithm for DOA estimation in compressed sensing (Q1664790) (← links)
• A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
• Strengthening hash families and compressive sensing (Q1932362) (← links)
• IDENT: identifying differential equations with numerical time evolution (Q1995989) (← links)
• Existence and uniqueness of solutions to the norm minimum problem on digraphs (Q2084233) (← links)
• Sparse solutions to an underdetermined system of linear equations via penalized Huber loss (Q2129205) (← links)
• A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
• Sparse linear regression from perturbed data (Q2208606) (← links)
• A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al. (Q2225318) (← links)
• An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices (Q2251220) (← links)
• Fast thresholding algorithms with feedbacks for sparse signal recovery (Q2252504) (← links)
• Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (Q2260650) (← links)
• A numerical exploration of compressed sampling recovery (Q2267399) (← links)
• Probability of unique integer solution to a system of linear equations (Q2275621) (← links)
• Risk bound of transfer learning using parametric feature mapping and its application to sparse coding (Q2331678) (← links)
• Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems (Q2335937) (← links)
• A fast \(\ell_1\)-solver and its applications to robust face recognition (Q2358854) (← links)
• One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations (Q2374380) (← links)
• Counting the faces of randomly-projected hypercubes and orthants, with applications (Q2380787) (← links)
• A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions (Q2424501) (← links)