A simple message-passing algorithm for compressed sensing

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 1968-1972

  Chandar, Venkat ^a   Shah, Devavrat ^a   Wornell, Gregory W ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; BIPARTITE GRAPHS; COMPRESSED SENSING; MESSAGE PASSING ALGORITHM; SPARSE APPROXIMATIONS;

BINARY CODES; GRAPH THEORY; INFORMATION THEORY; MESSAGE PASSING; SIGNAL RECONSTRUCTION;

APPROXIMATION ALGORITHMS;

EID: 77955698830     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513358     Document Type: Conference Paper

References (22)

1. D. L. Donoho, "Compressed sensing," IEEE Trans. Inform. Theory, vol. 52, pp. 1289-1306, Apr. 2006.
2. E. Candes, J. Romberg, and T. Tao, "Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inform. Theory, vol. 52, pp. 489-509, Feb. 2006.
3. E. J. Candes, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure, Appl. Math., vol. 59, pp. 1208-1223, Aug. 2006.
4. G. Cormode and S. Muthukrishnan, "Combinatorial algorithms for compressed sensing," in Proc. CISS, Princeton, NJ, Mar. 2006.
5. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comp. Harmonic Anal., vol. 26, pp. 301-321, 2009.
6. G. Cormode and S. Muthukrishnan, "Improved data stream summaries: the count-min sketch and its applications," in Proc. FSTTCS, Chennai, India, 2004.
7. P. Indyk, "Explicit constructions for compressed sensing of sparse signals," in Proc. SODA, San Francisco, CA, 2008.
8. J. A. Tropp, "Greed is good: algorithmic results for sparse approximation," IEEE Trans. Inform. Theory, vol. 50, pp. 2231-2242, Oct. 2004.
9. A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin, "Algorithmic linear dimension reduction in the L1 norm for sparse vectors," in Proc. Allerton Conf.', Monticello, IL, 2006.
10. A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin, "One sketch for all: fast algorithms for compressed sensing," in Proc. ACM STOC, pp. 237-246, 2007.
11. W. Xu and B. Hassibi, "Efficient compressive sensing with determinstic guarantees using expander graphs," in Proc. IEEE ITW, Lake Tahoe, CA, 2007.
12. R. Berinde and P. Indyk, "Sequential sparse matching pursuit," in Proc. Allerton Conf., Monticello, IL, 2009.
13. P. Indyk and M. Ruzic, "Practical near-optimal sparse recovery in the L1 norm," in Proc. Allerton Conf.', Monticello, IL, 2008.
14. M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1710-1722, Nov. 1996.
15. Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar and A. Kabbani, "Counter braids: a novel counter architecture for per-flow measurement," in Proc. ACM SIGMETRICS/Performance, June 2008.
16. D. Donoho, A. Maleki and A. Montanari, "Message passing algorithms for compressed sensing: I. Motivation and construction," in Proc. IEEE ITW, Cairo, Egypt, Jan. 2010.
17. D. Donoho, A. Maleki and A. Montanari, "Message passing algorithms for compressed sensing: II. Analysis and validation," in Proc. IEEE ITW, Cairo, Egypt, Jan. 2010.
18. R. G. Gallager, Low-Density Parity-Check Codes, MIT Press: Cambridge, MA, 1963.
19. D. Burshtein and G. Miller, "Expander graph arguments for message passing algorithms," IEEE Trans. Inform. Theory, vol. 47, pp. 782-790, Feb. 2001.
20. J. Feldman, "Decoding Error-Correcting Codes via Linear Programming," Ph. D. thesis, MIT, Cambridge, MA, Sep. 2003.
21. J. Feldman, T. Malkin, R. A. Servedio, C. Stein, and M. J. Wainwright, "LP decoding corrects a constant fraction of errors," CORC Tech. Rep. TR-2003-08, Columbia Univ., New York, Dec. 2003.
22. M. A. Khajehnejad, A. G. Dimakis, W. Xu, and B. Hassibi, "Sparse Recovery of Positive Signals with Minimal Expansion." Available at http://arxiv.org/abs/0902.4045.