DocumentCode :
2034639
Title :
An Efficient Method for Compressed Sensing
Author :
Kim, Seung-Jean ; Koh, Kwangmoo ; Lustig, Michael ; Boyd, Stephen
Author_Institution :
Stanford Univ., Stanford
Volume :
3
fYear :
2007
fDate :
Sept. 16 2007-Oct. 19 2007
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 :
conjugate gradient methods; signal sampling; compressed sensing; compressive sampling; interior-point method; medical resonance imaging; preconditioned conjugate gradient method; signal recovery; Biomedical imaging; Compressed sensing; Gradient methods; Least squares methods; Magnetic resonance imaging; Optimization methods; Quadratic programming; Reconstruction algorithms; Sampling methods; Vectors; compressed sensing; compressive sampling; interior-point methods; l1 regularization; preconditioned conjugate gradients;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Image Processing, 2007. ICIP 2007. IEEE International Conference on
Conference_Location :
San Antonio, TX
ISSN :
1522-4880
Print_ISBN :
978-1-4244-1437-6
Electronic_ISBN :
1522-4880
Type :
conf
DOI :
10.1109/ICIP.2007.4379260
Filename :
4379260
Link To Document :
بازگشت