Orthogonal matching pursuit with DCD iterations

Zakharov, Y. V.; Nascimento, V.

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Google Scholar through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Orthogonal matching pursuit with DCD iterations

Full text
Author(s):	Zakharov, Y. V. ^[1] ; Nascimento, V. ^[2] 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 and sparsity-aware techniques: desing algorithms and apllications. (fapesp-york)
Grantee:	Vitor Heloiz Nascimento
Support Opportunities:	Regular Research Grants

Short URL