Coherence-Based Performance Guarantees of Orthogonal Matching Pursuit

arXiv1209.6267MaRDI QIDQ6235969FDOQ6235969

Authors: Yuejie Chi, Robert Calderbank 

Publication date: 27 September 2012

Abstract: In this paper, we present coherence-based performance guarantees of Orthogonal Matching Pursuit (OMP) for both support recovery and signal reconstruction of sparse signals when the measurements are corrupted by noise. In particular, two variants of OMP either with known sparsity level or with a stopping rule are analyzed. It is shown that if the measurement matrix $Xinmathbb{C}^{nimesp}$ satisfies the strong coherence property, then with $ngtrsimmathcalO(klogp)$, OMP will recover a $k$-sparse signal with high probability. In particular, the performance guarantees obtained here separate the properties required of the measurement matrix from the properties required of the signal, which depends critically on the minimum signal to noise ratio rather than the power profiles of the signal. We also provide performance guarantees for partial support recovery. Comparisons are given with other performance guarantees for OMP using worst-case analysis and the sorted one step thresholding algorithm.

This page was built for publication: Coherence-Based Performance Guarantees of Orthogonal Matching Pursuit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6235969)