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

Computer scienceCompressed sensingArtificial intelligence

Affiliated Institutions

Related Publications

Publication Info

Year
2007
Type
article
Pages
III - 117
Citations
71
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

71
OpenAlex

Cite This

Seung-Jean Kim, Kwangmoo Koh, Michael Lustig et al. (2007). An Efficient Method for Compressed Sensing. , III - 117. https://doi.org/10.1109/icip.2007.4379260

Identifiers

DOI
10.1109/icip.2007.4379260