Sparse recovery of nonnegative signals with minimal expansion

IEEE Transactions on Signal Processing

Volumn 59, Issue 1, 2011, Pages 196-208

  Khajehnejad, M Amin ^a   Dimakis, Alexandros G ^a   Xu, Weiyu ^a   Hassibi, Babak ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

1 minimization; Compressed sensing; expander graphs

Indexed keywords

ALTERNATIVE ALGORITHMS; COMPUTATIONALLY EFFICIENT; EXPANDER GRAPHS; EXPANSION COEFFICIENTS; EXPANSION PROPERTIES; RECONSTRUCTION COMPLEXITY; RECONSTRUCTION METHOD; THREE ORDERS OF MAGNITUDE;

ALGORITHMS; COMPRESSED SENSING; GRAPHIC METHODS; MEASUREMENTS; RECOVERY; SIGNAL RECONSTRUCTION;

GRAPH THEORY;

EID: 80051743731     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2010.2082536     Document Type: Article

References (34)

1. D. Donoho, "High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension," Discr. Computat. Geom- etry, vol. 102, no. 27, pp. 617-652, 2006.
2. D. Donoho and J. Tanner, "Neighborliness of randomly-projected sim- plices in high dimensions," Proc. Nat. Acad. Sci., vol. 102, no. 27, pp. 9452-9457, 2005.
3. E. Candès, I. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency infor- mation," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
4. D. Donoho and J. Tanner, "Sparse nonnegative solution of underdeter- mined linear equations by linear programming," Proc. Nat. Acad. Sci., vol. 102, no. 27, pp. 9446-9451, 2005.
5. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss, "Com- bining geometry and combinatorics: A unied approach to sparse signal recovery," in Proc. 46th Ann. Allerton Conf., Sep. 23-26, 2008.
6. P.IndykandM.Ruzic,"Near-optimal sparserecoveryin the norm," in Proc. 49th Symp. Found. Comput. Sci. (FOCS), 2008.
7. G.CormodeandS.Muthukrishnan, "Improveddatastream summaries: The count-min sketch and its applications," FSTTCS, 2004.
8. R. Berinde, P. Indyk, and M. Ruzic, "Practical near-optimal sparse re- covery in the norm," in Proc. 46th Ann. Alletron Conf., 2008.
9. J. Tropp and A. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4655-4666, Dec. 2007.
10. R. Berinde and P. Indyk, "Sparse recovery using sparse matrices," Comput. Sci. Artif. Intell. Lab., 2008, MIT-CSAIL-TR-2008-001.
11. A. M. Bruckstein, M. Elad, and M. Zibulevsky, "A nonnegative and sparse enough solution of an underdetermined linear system of equa- tions is unique," IEEE Trans. Inf. Theory, vol. 54, pp. 4813-4820, Nov. 2008.
12. W. Xu and B. Hassibi, "Efcient compressive sensing with determin- istic guarantees using expander graphs," in Proc. IEEE Inf. Theory Workshop, Lake Tahoe, Sep. 2007.
13. W. Xu and B. Hassibi, "Further results on performance analysis for compressive sensing using expander graphs," in Proc. 41st Asilomar Conf. Signals, Syst. Comput., 2007, pp. 621-625.
14. S. Jafarpour, W. Xu, B. Hassibi, and R. Calderbank, "Efcient com- pressed sensing using high-quality expander graphs," IEEE Trans. Inf. Theory, vol. 55, no. 9, pp. 4299-4308, 2009.
15. P. Indyk, "Explicit constructions for compressed sensing of sparse sig- nals," Proc. SODA, 2008.
16. F. Parvaresh, H. Vikalo, S. Misra, and B. Hassibi, "Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays," IEEE J. Sel. Topics Signal Process., vol. 2, no. 3, pp. 275-285, 2008.
17. M. Stojnic, W. Xu, and B. Hassibi, "Compressed sensing-Proba- bilistic analysis of a null-space characterization," in IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), 2008.
18. V. Guruswami, J. R. Lee, and A. Wigderson, "Euclidean sections of with sublinear randomness and error-correction over the reals," in Proc. RANDOM, 2008.
19. V. Guruswami, J. R. Lee, and A. Razborov, "Almost Euclidean sub- spaces of via expander codes," Proc. SODA, 2008.
20. A. Feuer and A. Nemirovski, "On sparse representation in pairs of bases," IEEE Trans. Inf. Theory, vol. 49, pp. 1579-1581, 2003.
21. N. Linial and I. Novik, "How neighborly can a centrally symmetric polytope be," Discr. Computat. Geometry, pp. 273-281, 2006.
22. M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, pp. 1710-1722. 1996.
23. Y. Zhang, "When Is Missing Data Recoverable" Rice CAAM Dep., Tech. Rep. TR05-15, 2005
24. [Online]. Available: http://www.dsp.ece. rice.edu/cs/
25. D. Burshtein and G. Miller, "Expander graph arguments for message passing algorithms," IEEE Trans. Inf. Theory, vol. 47, pp. 782-790, Feb. 2001.
26. M. Capalbo, O. Reingold, S. Vadham, and A. Wigderson, "Random- ness conductors and constant-degree expanders," in Proc. 17th IEEE Ann. Conf. Computat. Complex. (CCC'02).
27. J. B. Kruskal, "Three-way arrays: Rank and uniqueness of trilinear de- compositions, with application to arithmetic complexity and statistics," Linear Algebra Appl., vol. 18, 1977.
28. W. Dai, M. Sheikh, O. Milenkovic, and R. Baraniuk, "Compressive sensing DNA microarrays," EURASIP J. Bioinform. Syst. Biol., 2009.
29. F. Zhang and H. D. Pster, "On the iterative decoding of high-rate LDPC codes with applications in compressed sensing," IEEE Trans. Inf. Theory, 2009.
30. Y. Lu, A. Montanari, and B. Parabhakar, "Counter braids: Asymp- totic optimality of the message passing decoding algorithm," in Proc. Allerton Conf., Sep. 2008.
31. J.Wolf, "Redundancy, the discrete Fouriertransform andimpulsenoise cancellation," IEEE Trans. Commun., vol. 31, 1983.
32. S. Jokar and V. Mehrmann, Sparse Representation of Solutions of Kro- necker Product of Systems
33. [Online]. Available: Arxiv http://arxiv.org/PS-cache/arxiv/pdf/0902/0902. 4587v1.pdf
34. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 2006.