• DocumentCode
    62542
  • Title

    Orthogonal matching pursuit with DCD iterations

  • Author

    Zakharov, Yuriy V. ; Nascimento, Vagner

  • Author_Institution
    Univ. of York, York, UK
  • Volume
    49
  • Issue
    4
  • fYear
    2013
  • fDate
    Feb. 14 2013
  • Firstpage
    295
  • Lastpage
    297
  • 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.
  • Keywords
    greedy algorithms; iterative methods; computationally efficient optimisation techniques; dichotomous coordinate descent iterations; greedy algorithms; orthogonal matching pursuit; sparse recovery problems;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el.2012.3923
  • Filename
    6464696
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=62542