Efficient Least Residual Greedy Algorithms for Sparse Recovery
arXiv:2004.06661 · doi:10.1109/TSP.2020.2988427
Abstract
We present a novel stagewise strategy for improving greedy algorithms for sparse recovery. We demonstrate its efficiency both for synthesis and analysis sparse priors, where in both cases we demonstrate its computational efficiency and competitive reconstruction accuracy. In the synthesis case, we also provide theoretical guarantees for the signal recovery that are on par with the existing perfect reconstruction bounds for the relaxation-based solvers and other sophisticated greedy algorithms.
arXiv commentaccepted to IEEE Transactions on Signal Processing
References in corpus (14)
- Observed Universality of Phase Transitions in High-Dimensional Geometry, with Implications for Modern Data Analysis and Signal Processing
- The Cosparse Analysis Model and Algorithms
- Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
- Greedy-Like Algorithms for the Cosparse Analysis Model
- Near-optimal compressed sensing guarantees for total variation minimization
- Nearly Optimal Bounds for Orthogonal Least Squares
- Compressed Sensing with General Frames via Optimal-dual-based -analysis
- Joint k-step analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares
- Back-Projection based Fidelity Term for Ill-Posed Linear Inverse Problems
- Orthogonal Matching Pursuit with Replacement
- Compressed Sensing with Coherent and Redundant Dictionaries
- Improved Analyses for SP and CoSaMP Algorithms in Terms of Restricted Isometry Constants
- Generalizing CoSaMP to Signals from a Union of Low Dimensional Linear Subspaces
- Projection onto the Cosparse Set is NP-Hard