Performance comparisons of greedy algorithms in compressed sensing
Compressed sensing has motivated the development of numerous sparse approximation algorithms designed to return a solution to an underdetermined system of linear equations where the solution has the fewest number of nonzeros possible, referred to as the sparsest solution. In the compressed sensing s...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
John Wiley and Sons, Ltd.
2015
|