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 条
  • [1] ON THE NUMBER OF ITERATIONS FOR THE MATCHING PURSUIT ALGORITHM
    Li, Fangyao
    Triggs, Christopher M.
    Dumitrescu, Bogdan
    Giurcaneanu, Ciprian Doru
    2017 25TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO), 2017, : 181 - 185
  • [2] Nearly optimal number of iterations for sparse signal recovery with orthogonal multi-matching pursuit *
    Li, Haifeng
    Wen, Jinming
    Xian, Jun
    Zhang, Jing
    INVERSE PROBLEMS, 2021, 37 (11)
  • [3] Subspace Pursuit Embedded in Orthogonal Matching Pursuit
    Ambat, Sooraj K.
    Chatterjee, Saikat
    Hari, K. V. S.
    TENCON 2012 - 2012 IEEE REGION 10 CONFERENCE: SUSTAINABLE DEVELOPMENT THROUGH HUMANITARIAN TECHNOLOGY, 2012,
  • [4] Orthogonal Matching Pursuit with Correction
    Mourad, Nasser
    Sharkas, Maha
    Elsherbeny, Mostafa M.
    2016 IEEE 12TH INTERNATIONAL COLLOQUIUM ON SIGNAL PROCESSING & ITS APPLICATIONS (CSPA), 2016, : 247 - 252
  • [5] Perturbed Orthogonal Matching Pursuit
    Teke, Oguzhan
    Gurbuz, Ali Cafer
    Arikan, Orhan
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (24) : 6220 - 6231
  • [6] Generalized Orthogonal Matching Pursuit
    Wang, Jian
    Kwon, Seokbeop
    Shim, Byonghyo
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (12) : 6202 - 6216
  • [7] Exact Recovery of Sparse Signals Using Orthogonal Matching Pursuit: How Many Iterations Do We Need?
    Wang, Jian
    Shim, Byonghyo
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2016, 64 (16) : 4194 - 4202
  • [8] Orthogonal Matching Pursuit on Faulty Circuits
    Li, Yao
    Chi, Yuejie
    Huang, Chu-Hsiang
    Dolecek, Lara
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2015, 63 (07) : 2541 - 2554
  • [9] Binary generalized orthogonal matching pursuit
    Haifeng Li
    Hao Ying
    Xiaoli Liu
    Japan Journal of Industrial and Applied Mathematics, 2024, 41 : 1 - 12
  • [10] Batch Algorithms of Matching Pursuit and Orthogonal Matching Pursuit with Applications to Compressed Sensing
    Wang, Huiyuan
    Vieira, Jose
    Ferreira, Paulo
    Jesus, Bruno
    Duarte, Isabel
    ICIA: 2009 INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, VOLS 1-3, 2009, : 809 - 814
12345