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...
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Report |
| Julkaistu: |
Wiley
2013
|
Search Result 1
Search Result 2
