Abstract

Recent results show that a relatively small number of random projections of a signal can contain most of its salient information. It follows that if a signal is compressible in some orthonormal basis, then a very accurate reconstruction can be obtained from random projections. This "compressive sampling" approach is extended here to show that signals can be accurately recovered from random projections contaminated with noise. A practical iterative algorithm for signal reconstruction is proposed, and potential applications to coding, analog-digital (A/D) conversion, and remote wireless sensing are discussed

Keywords

Signal reconstructionCompressed sensingOrthonormal basisComputer scienceRandom projectionAlgorithmIterative reconstructionSIGNAL (programming language)Noise (video)Signal processingArtificial intelligenceDigital signal processing

Affiliated Institutions

Related Publications

Compressed sensing

Suppose x is an unknown vector in Ropf <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> (a digital image or signal); we pla...

2006 IEEE Transactions on Information Theory 22524 citations

Compressed sensing

Suppose x is an unknown vector in Ropfm (a digital image or signal); we plan to measure n general linear functionals of x and then reconstruct. If x is known to be compressible ...

2004 17126 citations

Publication Info

Year
2006
Type
article
Volume
52
Issue
9
Pages
4036-4048
Citations
614
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

614
OpenAlex

Cite This

Jarvis Haupt, Robert D. Nowak (2006). Signal Reconstruction From Noisy Random Projections. IEEE Transactions on Information Theory , 52 (9) , 4036-4048. https://doi.org/10.1109/tit.2006.880031

Identifiers

DOI
10.1109/tit.2006.880031