摘要
Orthogonal matching pursuit(OMP)algorithm is a classical greedy algorithm widely used in compressed sensing.In this paper,by exploiting the Wielandt inequality and some properties of orthogonal projection matrix,we obtained a new number of iterations required for the OMP algorithm to perform exact recovery of sparse signals,which improves significantly upon the latest results as we know.
基金
support from the National Natural Science Foundation of China No.11971204
Natural Science Foundation of Jiangsu Province of China No.BK20200108
the Zhongwu Youth Innovative Talent Program of Jiangsu University of Technology.