Perturbation analysis of signal space fast iterative hard thresholding with redundant dictionaries
Authors:
Open Access
- 1 June 2017
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in IET Signal Processing
- Vol. 11 (4) , 462-468
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.Keywords
Funding Information
- National Natural Science Foundation of China (U1404603)
This publication has 28 references indexed in Scilit:
- Near oracle performance and block analysis of signal space greedy methodsJournal of Approximation Theory, 2015
- Fast Iterative Hard Thresholding for Compressed SensingIEEE Signal Processing Letters, 2014
- Generalized Orthogonal Matching PursuitIEEE Transactions on Signal Processing, 2012
- Hard Thresholding Pursuit: An Algorithm for Compressive SensingSIAM Journal on Numerical Analysis, 2011
- Normalized Iterative Hard Thresholding: Guaranteed Stability and PerformanceIEEE Journal of Selected Topics in Signal Processing, 2010
- Subspace Pursuit for Compressive Sensing Signal ReconstructionIEEE Transactions on Information Theory, 2009
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samplesApplied and Computational Harmonic Analysis, 2009
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency informationIEEE Transactions on Information Theory, 2006
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004