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...
| Principais autores: | , |
|---|---|
| Formato: | Report |
| Publicado em: |
Wiley
2013
|
Search Result 1
Performance comparisons of greedy algorithms in compressed sensing
Publicado em 2015
Journal article
Search Result 2
Performance comparisons of greedy algorithms in compressed sensing
Publicado em 2015
Journal article