Stable Signal Recovery via Randomly Enhanced Adaptive Subspace Pursuit Method

This letter addresses the stable signal recovery problem in the presence of noisy perturbations, and presents a variant of Subspace Pursuit (SP) method, called Randomly Enhanced Adaptive SP (REASP) method. REASP first adds correlative and irrelative atoms with an adaptive technique and a random strategy respectively, next detects the overall reliability, and then deletes unreliable atoms per iteration. Through these modifications, REASP is expected to achieve superior performance. The complexity analysis shows that the computational complexity of REASP is a bit higher but acceptable. The experimental results illustrate the superior performance of REASP, compared to the frequently used greedy pursuit (GP) and l₁ basis pursuit (BP) methods.