On Probability of Support Recovery for Orthogonal Matching Pursuit Using Mutual Coherence
Information Theory
2017-09-28 v2 math.IT
Abstract
In this paper we present a new coherence-based performance guarantee for the Orthogonal Matching Pursuit (OMP) algorithm. A lower bound for the probability of correctly identifying the support of a sparse signal with additive white Gaussian noise is derived. Compared to 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 closer match to empirically obtained results of the OMP algorithm.
Keywords
Cite
@article{arxiv.1706.09288,
title = {On Probability of Support Recovery for Orthogonal Matching Pursuit Using Mutual Coherence},
author = {Ehsan Miandji and Mohammad Emadi and Jonas Unger and Ehsan Afshari},
journal= {arXiv preprint arXiv:1706.09288},
year = {2017}
}
Comments
Submitted to IEEE Signal Processing Letters. arXiv admin note: substantial text overlap with arXiv:1608.00381