@Article{JCM-34-1,
author = {Liao, Anping and Xie, Jiaxin and Yang, Xiaobo and Wang, Peng},
title = {The Exact Recovery of Sparse Signals via Orthogonal Matching Pursuit},
journal = {Journal of Computational Mathematics},
year = {2016},
volume = {34},
number = {1},
pages = {70--86},
abstract = {<p style="text-align: justify;">This paper aims to investigate sufficient conditions for the recovery of sparse signals via the orthogonal matching pursuit (OMP) algorithm. In the noiseless case, we present a novel sufficient condition for the exact recovery of all $k$-sparse signals by the OMP algorithm, and demonstrate that this condition is sharp. In the noisy case, a sufficient condition for recovering the support of $k$-sparse signal is also presented. Generally, the computation for the restricted isometry constant (RIC) in these sufficient conditions is typically difficult, therefore we provide a new condition which is not only computable but also sufficient for the exact recovery of all $k$-sparse signals.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.1510-m2015-0284},
url = {https://global-sci.com/article/84546/the-exact-recovery-of-sparse-signals-via-orthogonal-matching-pursuit}
}