Backward Optimized Orthogonal Matching Pursuit
arXiv:math/0401279 · doi:10.1109/LSP.2004.833503
Abstract
A recursive approach for shrinking coefficients of an atomic decomposition is proposed. The corresponding algorithm evolves so as to provide at each iteration a) the orthogonal projection of a signal onto a reduced subspace and b) the index of the coefficient to be disregarded in order to construct a coarser approximation minimizing the norm of the residual error.
Accpeted for publication in IEEE Signal Processing Letters- 15 pages
Cited by in corpus (9)
- Constructive updating/downdating of oblique projectors: a generalization of the Gram-Schmidt process
- From cardinal spline wavelet bases to highly coherent dictionaries
- Approximating the ground state of fermion system by multiple determinant states: matching pursuit approach
- Adaptive non-uniform B-spline dictionaries on a compact interval
- On the Optimality of Backward Regression: Sparse Recovery and Subset Selection
- Cooperative Greedy Pursuit Strategies for Sparse Signal Representation by Partitioning
- Measurements design and phenomena discrimination
- Sparse Representation of Gravitational Sound
- Sparse Representations for Structured Noise Filtering