GPU accelerated greedy algorithms for compressed sensing
From MaRDI portal
Recommendations
- Performance comparisons of greedy algorithms in compressed sensing.
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
- Phase transitions for greedy sparse approximation algorithms
- Iterative hard thresholding for compressed sensing
Cites work
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing
- Compressive sampling
- Decoding by Linear Programming
- Fast <it>k</it>-selection algorithms for graphics processing units
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- For most large underdetermined systems of equations, the minimal 𝓁<sub>1</sub>‐norm near‐solution approximates the sparsest near‐solution
- GPU accelerated greedy algorithms for compressed sensing
- Greed is Good: Algorithmic Results for Sparse Approximation
- Hard thresholding pursuit: an algorithm for compressive sensing
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Iterative hard thresholding for compressed sensing
- Matching pursuits with time-frequency dictionaries
- Matrix recipes for hard thresholding methods
- Probing the Pareto frontier for basis pursuit solutions
- Selection by distributive partitioning
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Approximate Solutions to Linear Systems
- Sparse Reconstruction by Separable Approximation
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Stable signal recovery from incomplete and inaccurate measurements
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
Cited in
(6)- Performance comparisons of greedy algorithms in compressed sensing.
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Graphics processing units and high-dimensional optimization
- High-performance processing of covariance matrices using GPU computations
- GPU accelerated greedy algorithms for compressed sensing
- Expander \(\ell_0\)-decoding
This page was built for publication: GPU accelerated greedy algorithms for compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744210)
