Efficient compressive sensing with deterministic guarantees using expander graphs

2007 IEEE Information Theory Workshop, ITW 2007, Proceedings

Volumn , Issue , 2007, Pages 414-419

  Xu, Weiyu ^a   Hassibi, Babak ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(ALGORITHMIC) COMPLEXITY; (E ,2E) THEORY; (P ,P ,T) MEASUREMENTS; COMPRESSIVE SENSING; EMERGING TECHNOLOGIES; EXPANDER GRAPHS; SIGNAL VECTORS;

CYBERNETICS; INFORMATION THEORY; RECOVERY;

SIGNAL RECONSTRUCTION;

EID: 46749155099     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2007.4313110     Document Type: Conference Paper

References (31)

1. E. Candes, J. Romberg and T. Tao, "Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information", IEEE Transactions on Information Theory, 52(2) pp. 489 - 509, Feb. 2006.
2. E. Candes and T .Tao, "Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?", IEEE Trans. on Information Theory, 52(12) pp. 5406 - 5425, Dec. 2006.
3. E. Candes. "Compressive sampling" Proceedings of the International Congress of Mathematicians, Madrid, Spain, 2006.
4. D .Donoho, "Compressed Sensing", IEEE Transactions on Information Theory, 52(4), pp. 1289 - 1306, April 2006
5. S.S. Chen, "Basis Pursuit", PhD Thesis, Stanford University, 1995.
6. E. Candes and T. Tao, "Decoding by Linear Programming", IEEE Trans. on Information Theory, 51(12), pp. 4203 - 4215, Dec. 2005.
7. S.S. Chen, D.L. Donoho, M.A. Saunders, "Atomic Decomposition by Basis Pursuit", SIAM Journal on Scientific Computing, 1996.
8. E. Candes and J. Romberg, "Practical Signal Recovery from Random Projections", (Preprint, Jan. 2005)
9. J. Tropp and A. Gilbert, "Signal Recovery From Partial Information Via Orthogonal Matching Pursuit" (Preprint, 2005).
10. 1-norm minimization problems when the solution may be sparse", (Preprint, 2006).
11. R. A. De Vore, "Deterministic Constructions of Compressed Sensing Matrices", (Preprint, 2007).
12. J. Haupt and R. Nowak, "Signal Reconstruction from Noisy Random Projections", IEEE Trans. on Information Theory, 52(9), pp. 4036-4048, Sep. 2006.
13. E. Candes, J. Romberg, and T. Tao, "Stable Signal Recovery from Incomplete and Inaccurate Measurements", Communications on Pure and Applied Mathematics, 59(8), pp. 1207-1223, Aug. 2006.
14. D. Donoho and J. Tanner, "Neighborliness of RandomlyProjected Simplices in High Dimensions" Proc. National Academy of Sciences, 102(27), pp. 9452-9457, 2005.
15. 1-Norm Solution Is Also The Sparsest Solution", Communications on Pure and Applied Mathematics, 59(6), pp. 797-829, June 2006.
16. G. Cormode and S. Muthukrishnan, "Combinatorial Algorithms for Compressed Sensing", (Technical Report DIMACS TR 2005-40, 2005).
17. A. Gilbert, M. Strauss, J. Tropp, and R. Vershynin, "Sublinear, Small-space Approximation of Compressible Signals and Uniform Algorithmic Embeddings",(Preprint, 2005).
18. S. Sarvotham, Dror Baron, and Richard Baraniuk, "Sudocodes -Fast Measurement and Reconstruction of Sparse Signals", Proc. IEEE Int. Symposium on Information Theory (ISIT), Seattle, WA, July 2006.
19. S. Sarvotham, D. Baron, and R. Baraniuk, "Compressed Sensing Reconstruction via Belief Propagation", (Preprint, 2006).
20. A. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss, "Near-Optimal Sparse Fourier Representations via Sampling", Proc. ACM Symposium on Theory of Computing (STOC), 2002.
21. J.J. Fuchs, "Sparsity and Uniqueness for some Specific Underdetermined Linear Systems". IEEE ICASSP, vol V, pp.729-732, Philadelphia, March 2005.
22. Mehmet Akakaya and Vahid Tarokh, "Performance Bounds on Sparse Representations Using Redundant Frames". http://arxiv.org/abs/cs.IT/ 0703045, 2007
23. D. Burshtein and G. Miller, "Expander graph arguments for message passing algorithms," IEEE Transactions on Information Theory, volume 47, pp. 782-790, February 2001.
24. J. Laska, S. Kirolos, Y. Massoud, R. Baraniuk, A. Gilbert, M. Iwen, and M. Strauss, "Random Sampling for Analog-toInformation Conversion of Wideband Signals", Proc. IEEE Dallas Circuits and Systems Workshop (DCAS), Dallas, TX, 2006.
25. D. Donoho, Y. Tsaig, I. Drori and J.C. Starek, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit", (Preprint 2006).
26. M. Capalbo, O. Reingold, S. Vadhan, A. Wigderson, "Randomness Conductors and Constant-Degree Expansion Beyond the Degree/2 Barrier", Proc. of the 34th STOC, pp. 659-668, 2002.
27. M. Sipser and D. Spielman, "Expander codes", IEEE Transactions on Information Theory, Vol 42, No 6, pp. 1710-1722, 1996.
28. L.A. Bassalygo and M.S. Pinsker, "Complexity of an optimum nonblocking switching network without reconnections", Problems in Information Transmission, vol 9 no 1, pp. 84-87, 1973.
29. D. Peleg and E. Upfal, "Constructing disjoint paths on expander graphs", Combinatorica, vol 9, nO 3, pp. 289-313, 1989.
30. E. Upfal and A. Wigderson, "How to share memory in a distributed system", Journal of the Association of Computing Machines, vol 34, no pp. 116-127, 1987.
31. E. Ben-Sasson and A. Wigderson, "Short proofs are narrow-resolution made simple", Annual ACM Symposium on Theory of Computing, pp. 517-526, 1999.