The essential ability of sparse reconstruction of different compressive sensing strategies
From MaRDI portal
Publication:362190
Recommendations
- A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization
- Stable Recovery of Sparse Signals Via Regularized Minimization
- \(\ell_1\)- and \(\ell_2\)-norm joint regularization based sparse signal reconstruction scheme
- Convergence of \(\ell_{2/3}\) regularization for sparse signal recovery
- An \(l_1\)-\(l_p\) DC regularization method for compressed sensing
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Entropy-based algorithms for best basis selection
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Iterative hard thresholding for compressed sensing
- Matching pursuits with time-frequency dictionaries
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Nonconcave penalized likelihood with a diverging number of parameters.
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparsity and incoherence in compressive sampling
- Stable signal recovery from incomplete and inaccurate measurements
- Statistical challenges with high dimensionality: feature selection in knowledge discovery
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(4)
This page was built for publication: The essential ability of sparse reconstruction of different compressive sensing strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q362190)