Near-Optimal Sparse Recovery in the L1 Norm
Authors:
- Piotr IndykPIPiotr Indyk
- Milan RuzicMRMilan Ruzic
- 1 October 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 199-207
Abstract
We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a high-dimensional vector xisinRopfn from its lower-dimensional sketch AxisinRopfm. Specifically, we focus on the sparse recovery problem in the L1 norm: for a parameter k, given the sketch Ax, compute an approximation xcirc of x such that the L1 approximation error parx-xcircpar1 is close to minx' parx-x'par1, where x' ranges over all vectors with at most k terms. The sparse recovery problem has been subject to extensive research over the last few years. Many solutions to this problem have been discovered, achieving different trade-offs between various attributes, such as the sketch length, encoding and recovery times. In this paper we provide a sparse recovery scheme which achieves close to optimal performance on virtually all attributes (see Figure 1). In particular, this is the first recovery scheme that guarantees O(k log(n/k)) sketch length, and near-linear O(n log (n/k)) recovery time simultaneously. It also features low encoding and update times, and is noise-resilient.Keywords
This publication has 14 references indexed in Scilit:
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samplesApplied and Computational Harmonic Analysis, 2009
- Single-pixel imaging via compressive samplingIEEE Signal Processing Magazine, 2008
- Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs2007
- The price of privacy and the limits of LP decoding2007
- One sketch for all2007
- Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy CodesTwenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007
- Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency informationIEEE Transactions on Information Theory, 2006
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004