Practical Signal Recovery from Random Projections

Can we recover a signal f 2 R N from a small number of linear measurements? A series of recent papers developed a collection of results showing that it is surprisingly possible to reconstruct certain types of signals accurately from limited measurements. In a nutshell, suppose that f is compressible in the sense that it is well-approximated by a linear combination of M vectors taken from a known basis . Then not knowing anything in advance about the signal, f can (very nearly) be recovered from about M logN generic nonadaptive measurements only. The recovery procedure is concrete and consists in solving a simple convex optimization program. In this paper, we show that these ideas are of practical significance. Inspired by theoretical developments, we propose a series of practical recovery procedures and test them on a series of signals and images which are known to be well approximated in wavelet bases. We demonstrate empirically that it is possible to recover an object from about 3M ‐5M projections onto generically chosen vectors with the same accuracy as the ideal M -term wavelet approximation. We briefly discuss possible implications in the areas of data compression and medical imaging.

[1]  Ingrid Daubechies,et al.  Ten Lectures on Wavelets , 1992 .

[2]  Jerome M. Shapiro,et al.  Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..

[3]  D. Donoho Unconditional Bases Are Optimal Bases for Data Compression and for Statistical Estimation , 1993 .

[4]  I. Johnstone,et al.  Ideal spatial adaptation by wavelet shrinkage , 1994 .

[5]  D. L. Donoho,et al.  Ideal spacial adaptation via wavelet shrinkage , 1994 .

[6]  William A. Pearlman,et al.  A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..

[7]  Michael T. Orchard,et al.  Space-frequency quantization for wavelet image coding , 1997, IEEE Trans. Image Process..

[8]  Martin Vetterli,et al.  Data Compression and Harmonic Analysis , 1998, IEEE Trans. Inf. Theory.

[9]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[10]  Mario Bertero,et al.  Introduction to Inverse Problems in Imaging , 1998 .

[11]  S. Mallat A wavelet tour of signal processing , 1998 .

[12]  Bryan Usevitch,et al.  A tutorial on modern lossy wavelet image compression: foundations of JPEG 2000 , 2001, IEEE Signal Process. Mag..

[13]  P. Laguna,et al.  Signal Processing , 2002, Yearbook of Medical Informatics.

[14]  Emmanuel J. Candès,et al.  New multiscale transforms, minimum total variation synthesis: applications to edge-preserving image reconstruction , 2002, Signal Process..

[15]  E. Candès,et al.  Astronomical image representation by the curvelet transform , 2003, Astronomy & Astrophysics.

[16]  E. Candès,et al.  New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities , 2004 .

[17]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[18]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[19]  Tony F. Chan,et al.  Total Variation Wavelet Inpainting , 2006, Journal of Mathematical Imaging and Vision.