GPU accelerated greedy algorithms for compressed sensing
For appropriate matrix ensembles, greedy algorithms have proven to be an efficient means of solving the combinatorial optimization problem associated with compressed sensing. This paper describes an implementation for graphics processing units (GPU) of hard thresholding, iterative hard thresholding,...
| Auteurs principaux: | , |
|---|---|
| Format: | Journal article |
| Langue: | English |
| Publié: |
2013
|