Efficient and robust compressed sensing using optimized expander graphs

IEEE Transactions on Information Theory

Volumn 55, Issue 9, 2009, Pages 4299-4308

  Jafarpour, Sina' ^a   Xu, Weiyu ^b   Hassibi, Babak ^b   Calderbank, Robert ^a  

^a Princeton University   (United States)

^b California Institute of Technology   (United States)

Author keywords

Compressive sensing; Expander graphs; Sparse recovery; Sparse sensing matrices; Unique neighborhood property

Indexed keywords

APPROXIMATION ALGORITHMS; MATRIX ALGEBRA; RECOVERY; SIGNAL RECONSTRUCTION;

COMPRESSIVE SENSING; EXPANDER GRAPHS; SPARSE RECOVERY; SPARSE SENSING MATRICES; UNIQUE NEIGHBORHOOD PROPERTY;

GRAPH THEORY;

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

References (25)

1. E. Candés and M. Wakin, "People hearing without listening: An introduction to compressive sampling," IEEE Signal Process. Mag., vol. 25, no. 2, pp. 21-30, 2008.
2. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, "A simple proof of the restricted isometry property for random matrices," Constructive Approximation, vol. 28, no. 3, pp. 253-263, Dec. 2008.
3. W. Johnson and J. Lindenstrauss, "Extensions of Lipschitz mapping into a Hilbert space," Contemp. Math., vol. 26, pp. 189-206, Sep. 1984.
4. W. Xu and B. Hassibi, "Efficient compressive sensing with deterministic guarantees using expander graphs," in Proc. IEEE Information Theory Workshop, Lake Tahoe, CA, Sep. 2007, pp. 414-419.
5. W. Xu and B. Hassibi, "Further results on performance analysis for compressive sensing using expander graphs," in Conf. Rec. 41st Asilomar Conf. Signals, Systems and Computers (ACSSC 2007), Thousan Oaks, CA, Nov. 2008, pp. 621-625.
6. R. Berinde and P. Indyk, "Sparse Recovery Using Sparse Random Matrices," MIT, Cambridge, MA, Tech. Rep. MIT-CSAIL-TR-2008-001, Jan. 2008.
7. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss, "Combining geometry and combinatorics: A unified approach to sparse signal recovery," in Proc. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2008, pp. 798-805.
8. P. Indyk, "Explicit constructions for compressed sensing of sparse signals," in Proc. 19th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), San Francisco, CA, Jan. 2008.
9. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710-1722, Nov. 1996.
10. P. Sarnak, "What is an expander," Notices Amer. Math. Soc., vol. 51, no. 7, Aug. 2004.
11. L. Bassalygo and M. Pinsker, "Complexity of an optimum nonblocking switching network without reconnections," Probl. Inf. Transm., vol. 9, no. 1, pp. 289-313, 1973.
12. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson, "Randomness conductors and constant degree expansions beyond the degree 2 barrier," in Proc. 34th Annu.ACM Symp. Theory of Computing (STOC , Montreal, QC, Canada, May 2002, pp. 659-668.
13. M. Akcakaya and V. Tarokh, "A frame construction and a universal distortion bound for sparse representations," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2443-2450, Jun. 2008.
14. L. Applebaum, S. Howard, S. Searle, and R. Calderbank, "Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery," Appl. Comput. Harmonic Anal., vol. 26, no. 2, pp. 283-290, Mar. 2008.
15. S. Howard, R. Calderbank, and S. Searle, "A fast reconstruction algorithm for deterministic compressive sensing using second order Reed-Muller codes," in Proc. Conf. Information Sciences and Systems (CISS), Princeton, NJ, Mar. 2008, pp. 11-15.
16. R. Calderbank, S. Howard, and S. Jafarpour, "Construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property", submitted for publication.
17. R. Calderbank, S. Howard, and S. Jafarpour, "Deterministic sensing with groups of random variables", submitted for publication.
18. F. Parvaresh and B. Hassibi, "List decoding for compressed sensing", unpublished.
19. V. Guruswami, C. Umans, and S. Vadhan, "Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes," J. ACM, vol. 56, no. 4, Jun. 2009, Article No. 20.
20. F. Parvaresh and A. Vardy, "Correcting errors beyond the Guruswami-Sudan radius in polynomial time," in Proc. 46th Ann. IEEE Symp. Foundations of Computer Science, Pittsburgh, PA, Oct. 2008, pp. 285-294.
21. S. Hoory, N. Linial, and A. Wigderson, "Expander graphs and their applications," Bull. (New Series) Amer. Math. Soc., vol. 43, pp. 439-561, 2006.
22. P. Indyk and M. Ruzic, "Near-optimal sparse recovery in the l1 norm," in Proc. IEEE Symp. Foundations of Computer Science (FOCS) Philadelpha, PA, Oct. 2008, pp. 199-207.
23. 1 via expander codes," in Proc. 19th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), San Francisco, CA, Jan. 2008, pp. 649-658.
24. R. Berinde, P. Indyk, and M. Ruzic, "Practical near-optimal sparse recovery in the l1 norm," in Proc. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2008, pp. 198-205.
25. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comp. Harmonic Anal., vol. 26, no. 3, pp. 301-321, May 2009.