Signal reconstruction from noisy random projections

IEEE Transactions on Information Theory

Volumn 52, Issue 9, 2006, Pages 4036-4048

  Haupt, Jarvis ^a   Nowak, Robert ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Complexity regularization; Data compression; Denoising; Rademacher chaos; Random projections; Sampling; Wireless sensor networks

Indexed keywords

ALGORITHMS; DATA COMPRESSION; ITERATIVE METHODS; RANDOM PROCESSES; SAMPLING; SENSOR DATA FUSION; SIGNAL ENCODING; SPURIOUS SIGNAL NOISE;

COMPLEXITY REGULARIZATION; DENOISING; RADEMACHER CHAOS; RANDOM PROJECTIONS; WIRELESS SENSOR NETWORKS;

SIGNAL RECONSTRUCTION;

EID: 33748575920     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.880031     Document Type: Article

References (25)

1. E. Candés, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
2. E. Candés and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies," IEEE Trans. Inf. Theory, 2004, to be published.
3. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
4. P. Feng and Y. Bresler, "Spectrum-blind minimum-rate sampling and reconstruction of multiband signals," in Proc. IEEE Int. Conf. Acoust. Speech Sig. Process., Atlanta, GA, May 1996, vol. 3, pp. 1689-1692.
5. M. Gastpar and Y. Bresler, "On the necessary density for spectrum-blind nonuniform sampling subject to quantization," in Proc. IEEE Int. Conf. Acoust. Speech Sig. Process., Istanbul, Jun. 2000, vol. 1, pp. 348-351.
6. A. C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. J. Strauss, "Near-optimal sparse Fourier representations via sampling," in Proc. 2002 ACM Symp. Theory Comput. (STOC), 2002, pp. 152-161.
7. J. Zou, A. Gilbert, M. Strauss, and I. Daubechies, "Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis," J. Comput. Phys., vol. 211, no. 2, pp. 572-595, Jan. 2006.
8. M. Vetterli, P. Marziliano, and T. Blu, "Sampling signals with finite rate of innovation," IEEE Trans. Signal Process., vol. 50, no. 6, pp. 1417-1428, Jun. 2002.
9. I. Maravic and M. Vetterli, "Sampling and reconstruction of signals with finite rate of innovation in the presence of noise," IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2788-2805, Aug. 2005.
10. E. Candés and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
11. E. Candés, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math., 2005, submitted for publication.
12. E. Candés and T. Tao, "The Dantzig selector: Statistical estimation when p is much larger than n," Ann. Stat., 2005, submitted for publication.
13. A. R. Barron, "Complexity regularization with application to artificial neural networks," in Nonparametric Functional Estimation and Related Topics. New York: Kluwer-Academic, 1991, pp. 561-576.
14. C. Craig, "On the Tchebychef inequality of Bernstein," Ann. Math. Stat., vol. 4, no. 2, pp. 94-102, May 1933.
15. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
16. M. Figueiredo and R. Nowak, "An EM algorithm for wavelet-based image restoration," IEEE Trans. Image Process., vol. 12, no. 8, pp. 906-916, Aug. 2003.
17. I. Daubechies, M. Defrise, and C. D. Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Commun. Pure Appl. Math, vol. 57, no. 11, pp. 1413-1457, Nov. 2004.
18. M. Figueiredo and R. Nowak, "A bound optimization approach to wavelet-based image deconvolution," in Proc. Int. Conf. Image Process., Sep. 2005, vol. 2, pp. 782-785.
19. 1-norm near-solution approximates the sparsest near-solution," Commun. Pure Appl. Math, vol. 59, no. 7, pp. 907-934, July 2006.
20. M. Gastpar and M. Vetterli, "Source-channel communication in sensor networks," in Proc. Inf. Process. Sensor Netw., Apr. 2003, pp. 162-177.
21. M. Gastpar, B. Rimoldi, and M. Vetterli, "To code, or not to code: Lossy source-channel communication revisited," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1147-1158, May 2003.
22. W. Bajwa, A. Sayeed, and R. Nowak, "Matched source-channel communication for field estimation in wireless sensor networks," in Proc. Inf. Process. Sensor Netw., Apr. 2005, pp. 332-339.
23. W. Bajwa, J. Haupt, A. Sayeed, and R. Nowak, "Compressive wireless sensing," in Proc. Inf. Process. Sensor Netw., Nashville, TN, Apr. 2006.
24. M. Rabbat, J. Haupt, A. Singh, and R. Nowak, "Decentralized compression and predistribution via randomized gossip," in Proc. Inf. Process. Sensor Netw., Nashville, TN, Apr. 2006.
25. P(g)," Annales de l'Institut Fourier, vol. 20, no. 2, pp. 335-402, 1970.