“…Orthogonal matching pursuit (OMP) [2,3], the most classical greedy pursuit algorithm, encompasses two fundamental aspects of greedy pursuit algorithms: matching pursuit and least squares. Over the years, numerous novel greedy pursuit algorithms have been proposed to refine support set selection strategies based on OMP, such as generalized OMP (gOMP) [4], stagewise OMP (StOMP) [5], searching forward OMP (SFOMP) [6], regularized OMP (ROMP) [7], compressive sampling MP (CoSaMP) [8], subspace pursuit (SP) [9], and sparsity adaptive MP (SAMP) [10]. All of the above algorithms select multiple column vectors at each iteration, and the latter three algorithms employ techniques like backtracking or pruning to replace incorrect column vectors from the support set.…”