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,...
| 主要な著者: | , |
|---|---|
| フォーマット: | Journal article |
| 言語: | English |
| 出版事項: |
2013
|