Abstract
Practically, sparsity is expressed not in terms of an orthonormal basis but in terms an overcomplete dictionary. There are many practical examples in which a signal of interest is sparse in an overcomplete dictionary. The authors propose a new algorithm signal space fast iterative hard thresholding (SSFIHT) for the recovery of dictionary‐sparse signals. Under total perturbations, using D ‐restricted isometry property ( D ‐RIP), the authors provide the proof of convergence for SSFIHT. Comparing with the error of oracle recovery, it is easy to see that SSFIHT can provide oracle‐order recovery performance against total perturbations. Numerical simulations are performed to verify the conclusions.
Funding Information
  • National Natural Science Foundation of China (U1404603)

This publication has 28 references indexed in Scilit: