Orthogonal matching pursuit with DCD iterations

被引：7

作者：

Zakharov, Y. V. ^{[1
]}

Nascimento, V. ^{[2
]}

机构：

[1] Univ York, York YO10 5DD, N Yorkshire, England

[2] Univ Sao Paulo, BR-05508 Sao Paulo, Brazil

来源：

ELECTRONICS LETTERS | 2013年 / 49卷 / 04期

基金：

巴西圣保罗研究基金会;

关键词：

D O I：

10.1049/el.2012.3923

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：295 / 297

页数：3

共 50 条

[41] On the efficiency of the Orthogonal Matching Pursuit in compressed sensing
Livshits, E. D.
SBORNIK MATHEMATICS, 2012, 203 (02) : 183 - 195
[42] On the Noise Robustness of Simultaneous Orthogonal Matching Pursuit
Determe, Jean-Francois
Louveaux, Jerome
Jacques, Laurent
Horlin, Francois
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 65 (04) : 864 - 875
[43] A Sharp RIP Condition for Orthogonal Matching Pursuit
Dan, Wei
ABSTRACT AND APPLIED ANALYSIS, 2013,
[44] Normalized regularized orthogonal matching pursuit algorithm
Zhang Tao
Bai Zhengyao
Yang Lu
2015 IEEE ADVANCED INFORMATION TECHNOLOGY, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (IAEAC), 2015, : 1060 - 1063
[45] Orthogonal Matching Pursuit: A Brownian Motion Analysis
Fletcher, Alyson K.
Rangan, Sundeep
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (03) : 1010 - 1021
[46] A New Generalized Orthogonal Matching Pursuit Method
Zhao L.
Liu Y.
Zhao, Liquan (zhao-liquan@163.com), 2017, Hindawi Limited, 410 Park Avenue, 15th Floor, 287 pmb, New York, NY 10022, United States (2017)
[47] Batch Look Ahead Orthogonal Matching Pursuit
Muralikrishnna, G. S.
Ambat, Sooraj K.
Hari, K. V. S.
2018 TWENTY FOURTH NATIONAL CONFERENCE ON COMMUNICATIONS (NCC), 2018,
[48] Efficiency of Orthogonal Matching Pursuit for Group Sparse Recovery
Shao, Chunfang
Wei, Xiujie
Ye, Peixin
Xing, Shuo
AXIOMS, 2023, 12 (04)
[49] Active Orthogonal Matching Pursuit for Sparse Subspace Clustering
Chen, Yanxi
Li, Gen
Gu, Yuantao
IEEE SIGNAL PROCESSING LETTERS, 2018, 25 (02) : 164 - 168
[50] A Novel Sufficient Condition for Generalized Orthogonal Matching Pursuit
Wen, Jinming
Zhou, Zhengchun
Li, Dongfang
Tang, Xiaohu
IEEE COMMUNICATIONS LETTERS, 2017, 21 (04) : 805 - 808

← 1 2 3 4 5 →