Conditions for a unique non-negative solution to an underdetermined system

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 301-307

  Wang, Meng ^a   Tang, Ao ^a  

^a Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; COLUMN SUMS; CONSTANT DEGREE; EXPANDER GRAPHS; MEASUREMENT MATRIX; NON-NEGATIVE SOLUTIONS; ORTHANT;

LINEAR SYSTEMS;

MATRIX ALGEBRA;

EID: 77949572070     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394815     Document Type: Conference Paper

References (21)

1. E. Candes, "Compressive sampling," in Proc. International Congress of Mathematics, 2006, pp. 1433-1452.
2. R. Baraniuk, "Compressive sensing," IEEE Signal Process. Mag., vol. 24, no. 4, pp. 118-121, July 2007.
3. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, April 2006.
4. E. Candes and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?" IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
5. -, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
6. D. L. Donoho and J. Tanner, "Sparse nonnegative solution of underdetermined linear equations by linear programming," in Proc. Natl. Acad. Sci. U.S.A., vol. 102, no. 27, 2005, pp. 9446-9451.
7. A. Bruckstein, M. Elad, and M. Zibulevsky, "On the uniqueness of nonnegative sparse solutions to underdetermined systems of equations," IEEE Trans. Inf. Theory, vol. 54, no. 11, pp. 4813-4820, Nov. 2008.
8. D. L. Donoho and J. Tanner, "Counting the faces of randomly-projected hypercubes and orthants, with applications," Preprint, 2008.
9. M. A. Khajehnejad, A. G. Dimakis, W. Xu, and B. Hassibi, "Sparse recovery of positive signals with minimal expansion," Preprint, 2009.
10. W. Xu and B. Hassibi, "Efficient compressive sensing with deterministic guarantees using expander graphs," in Information Theory Workshop, 2007. ITW '07. IEEE, Sept. 2007, pp. 414-419.
11. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss., "Combining geometry and combinatorics: a unified approach to sparse signal recovery," Preprint, 2008.
12. R. Berinde and P. Indyk, "Sparse recovery using sparse random matrices," MIT-CSAIL Technical Report, 2008.
13. E. J. Candes, M. B. Wakin, and S. P. Boyd, "Enhancing sparsity by reweighted l1 minimization," IEEE Trans. Inf. Theory, vol. 14, no. 5-6, pp. 877-905, Dec. 2008.
14. J. Wendel, "A problem in geometric probability," Mathematica Scandinavica, no. 11, pp. 109-111, 1962.
15. D. Gale, "Neighboring vertices on a convex polyhedron," in Linear Inequalities and Related Systems, Annals of Mathematics Studies, no. 38. Princetion, NJ: Princeton Univ. Press, 1956, pp. 255-263.
16. A. Coates, A. Hero III, R. Nowak, and B. Yu, "Internet tomography," IEEE Signal Process. Mag., vol. 19, no. 3, pp. 47-65, May 2002.
17. H. Nguyen and P. Thiran, "Using end-to-end data to infer lossy links in sensor networks," in Proc. IEEE Infocom, Apr. 2006, pp. 1-12.
18. N. Duffied, "Network tomography of binary network performance characteristics," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5373-5388, Dec. 2006.
19. Y. Zhang, M. Roughan, C. Lund, and D. Donoho, "An information-theoretic approach to traffic matrix estimation," in Proc. ACM SIGCOMM, Aug. 2003, pp. 301-312.
20. H. X. Nguyen and P. Thiran, "Network loss inference with second order statistics of end-to-end flows," in Proc. ACM SIGCOMM, 2007, pp. 227-240.
21. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Analysis of low density codes and improved designs using irregular graphs," in Proc. ACM STOC, 1998, pp. 249-258.