In this paper,we propose a Quasi-Orthogonal Matching Pursuit(QOMP)algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials.For the two kinds of sampled data,data ...In this paper,we propose a Quasi-Orthogonal Matching Pursuit(QOMP)algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials.For the two kinds of sampled data,data with noises and without noises,we apply the mutual coherence of measurement matrix to establish the convergence of the QOMP algorithm which can reconstruct s-sparse Legendre polynomials,Chebyshev polynomials and trigonometric polynomials in s step iterations.The results are also extended to general bounded orthogonal system including tensor product of these three univariate orthogonal polynomials.Finally,numerical experiments will be presented to verify the effectiveness of the QOMP method.展开更多
Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classi...Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classical research methods using mutual coherence or restricted isometry property of the measurement matrix,the recovery guarantee and the success probability of OMP are obtained directly by the greedy selection ratio and the probability theory.The results show that the failure probability of OMP given in this paper is exponential small with respect to the number of sampling points.In addition,the recovery guarantee of OMP obtained through classical methods is lager than that of ℓ_(1)-minimization whatever the sparsity of sparse polynomials is,while the recovery guarantee given in this paper is roughly the same as that of ℓ_(1)-minimization when the sparsity is less than 93.Finally,the numerical experiments verify the availability of the theoretical results.展开更多
基金supported by National Natural Science Foundation of China no.12071019.
文摘In this paper,we propose a Quasi-Orthogonal Matching Pursuit(QOMP)algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials.For the two kinds of sampled data,data with noises and without noises,we apply the mutual coherence of measurement matrix to establish the convergence of the QOMP algorithm which can reconstruct s-sparse Legendre polynomials,Chebyshev polynomials and trigonometric polynomials in s step iterations.The results are also extended to general bounded orthogonal system including tensor product of these three univariate orthogonal polynomials.Finally,numerical experiments will be presented to verify the effectiveness of the QOMP method.
基金supported by the National Natural Science Foundation of China(Grant No.12071019).
文摘Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classical research methods using mutual coherence or restricted isometry property of the measurement matrix,the recovery guarantee and the success probability of OMP are obtained directly by the greedy selection ratio and the probability theory.The results show that the failure probability of OMP given in this paper is exponential small with respect to the number of sampling points.In addition,the recovery guarantee of OMP obtained through classical methods is lager than that of ℓ_(1)-minimization whatever the sparsity of sparse polynomials is,while the recovery guarantee given in this paper is roughly the same as that of ℓ_(1)-minimization when the sparsity is less than 93.Finally,the numerical experiments verify the availability of the theoretical results.
