Sequential sparse matching pursuit
We propose a new algorithm, called sequential sparse matching pursuit (SSMP), for solving sparse recovery problems. The algorithm provably recovers a k-sparse approximation to an arbitrary n-dimensional signal vector x from only O(k log(n/k)) linear measurements of x. The recovery process takes time...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers,
2010-10-01T18:19:38Z.
|
| Subjects: | |
| Online Access: | Get fulltext |