Orthonormal Expansion l1-Minimization Algorithms for Compressed Sensing
arXiv:1108.5037 · doi:10.1109/TSP.2011.2168216
Abstract
Compressed sensing aims at reconstructing sparse signals from significantly reduced number of samples, and a popular reconstruction approach is -norm minimization. In this correspondence, a method called orthonormal expansion is presented to reformulate the basis pursuit problem for noiseless compressed sensing. Two algorithms are proposed based on convex optimization: one exactly solves the problem and the other is a relaxed version of the first one. The latter can be considered as a modified iterative soft thresholding algorithm and is easy to implement. Numerical simulation shows that, in dealing with noise-free measurements of sparse signals, the relaxed version is accurate, fast and competitive to the recent state-of-the-art algorithms. Its practical application is demonstrated in a more general case where signals of interest are approximately sparse and measurements are contaminated with noise.
arXiv comment7 pages, 2 figures, 1 table
References in corpus (7)
- Message Passing Algorithms for Compressed Sensing
- Sparsity and Incoherence in Compressive Sampling
- NESTA: A Fast and Accurate First-order Method for Sparse Recovery
- Observed Universality of Phase Transitions in High-Dimensional Geometry, with Implications for Modern Data Analysis and Signal Processing
- Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing
- Linear convergence of iterative soft-thresholding
- Various thresholds for -optimization in compressed sensing