liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Performance Guarantee for Orthogonal Matching Pursuit Using Mutual Coherence
Qualcomm Technol Inc, CA 95110 USA.
Linköping University, Department of Science and Technology, Media and Information Technology. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Science and Technology, Media and Information Technology. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-7765-1747
2018 (English)In: Circuits, systems, and signal processing, ISSN 0278-081X, E-ISSN 1531-5878, Vol. 37, no 4, p. 1562-1574Article in journal (Refereed) Published
Abstract [en]

In this paper, we present a new performance guarantee for the orthogonal matching pursuit (OMP) algorithm. We use mutual coherence as a metric for determining the suitability of an arbitrary overcomplete dictionary for exact recovery. Specifically, a lower bound for the probability of correctly identifying the support of a sparse signal with additive white Gaussian noise and an upper bound for the mean square error is derived. Compared to the previous work, the new bound takes into account the signal parameters such as dynamic range, noise variance, and sparsity. Numerical simulations show significant improvements over previous work and a much closer correlation to empirical results of OMP.

Place, publisher, year, edition, pages
Springer, 2018. Vol. 37, no 4, p. 1562-1574
Keywords [en]
Compressed sensing; Sparse representation; Orthogonal matching pursuit; Sparse recovery
National Category
Probability Theory and Statistics
Identifiers
URN: urn:nbn:se:liu:diva-147092DOI: 10.1007/s00034-017-0602-xISI: 000427149100010OAI: oai:DiVA.org:liu-147092DiVA, id: diva2:1199565
Available from: 2018-04-20 Created: 2018-04-20 Last updated: 2018-06-12

Open Access in DiVA

fulltext(525 kB)33 downloads
File information
File name FULLTEXT02.pdfFile size 525 kBChecksum SHA-512
39458ba6c111b03f3350e9019d616516f70107dce88c4787b12bcdd93d16be2e3213eb3cc242820632bf26d6c07a56a474dff2c08c15600b919fc8fa607d23c7
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Miandji, EhsanUnger, Jonas

Search in DiVA

By author/editor
Miandji, EhsanUnger, Jonas
By organisation
Media and Information TechnologyFaculty of Science & Engineering
In the same journal
Circuits, systems, and signal processing
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 33 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 124 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf