The Sufficient Conditions for Orthogonal Matching Pursuit to Exactly Reconstruct Sparse Polynomials

Abstract

Orthogonal matching pursuit (OMP for short) is a classical method for sparse signal recovery in compressed sensing. In this paper, we consider the application of OMP to reconstruct sparse polynomials generated by uniformly bounded orthonormal systems, which is an extension of the work on OMP to reconstruct sparse trigonometric polynomials. Firstly, in both cases of sampled data with and without noise, sufficient conditions for OMP to recover the coefficient vector of a sparse polynomial are given, which are more loose than the existing results. Then, based on a more accurate estimation of the mutual coherence of a structured random matrix, the recovery guarantees and success probabilities for OMP to reconstruct sparse polynomials are obtained with the help of those sufficient conditions. In addition, the error estimation for the recovered coefficient vector is gained when the sampled data contain noise. Finally, the validity and correctness of the theoretical conclusions are verified by numerical experiments.