An Efficient Method for Compressed Sensing
- 1 January 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15224880) , III - 117-117
Abstract
Compressed sensing or compressive sampling (CS) has been receiving a lot of interest as a promising method for signal recovery and sampling. CS problems can be cast as convex problems, and then solved by several standard methods such as interior-point methods, at least for small and medium size problems. In this paper we describe a specialized interior-point method for solving CS problems that uses a preconditioned conjugate gradient method to compute the search step. The method can efficiently solve large CS problems, by exploiting fast algorithms for the signal transforms used. The method is demonstrated with a medical resonance imaging (MRI) example.Keywords
This publication has 9 references indexed in Scilit:
- Sparse MRI: The application of compressed sensing for rapid MR imagingMagnetic Resonance in Medicine, 2007
- Compressed sensingIEEE Transactions on Information Theory, 2006
- A bound optimization approach to wavelet-based image deconvolution2005
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- Least angle regressionThe Annals of Statistics, 2004
- Convex Optimization2004
- Atomic Decomposition by Basis PursuitSIAM Review, 2001
- A new approach to variable selection in least squares problemsIMA Journal of Numerical Analysis, 2000
- Applied Numerical Linear Algebra1997