| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ York, York YO10 5DD, N Yorkshire - England
[2] Univ Sao Paulo, BR-05508 Sao Paulo - Brazil
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | ELECTRONICS LETTERS; v. 49, n. 4, p. 295-297, 2013. |
| Web of Science Citations: | 7 |
| Abstract | |
Greedy algorithms are computationally efficient optimisation techniques for solving sparse recovery problems. Matching pursuit (MP) and orthogonal MP (OMP) are popular greedy algorithms; MP possesses the lowest complexity whereas OMP provides better performance. In this reported work, OMP is modified using dichotomous coordinate descent (DCD) iterations and an algorithm is arrived at that has performance close to that of OMP and complexity even lower than that of MP. (AU) | |
| FAPESP's process: | 12/50565-1 - Adaptive compressive sensing-aware techniques: desinf algorithms and applications |
| Grantee: | Vitor Heloiz Nascimento |
| Support Opportunities: | Regular Research Grants |