On the uniqueness of nonnegative sparse solutions to underdetermined systems of equations

IEEE Transactions on Information Theory

Volumn 54, Issue 11, 2008, Pages 4813-4820

  Bruckstein, Alfred M ^a   Elad, Michael ^a   Zibulevsky, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

1; Basis pursuit; Greedy algorithm; Linear system; Positive orthant; Sparse solution; Uniqueness

Indexed keywords

COHERENT LIGHT; ELECTRIC NETWORK ANALYSIS; LINEAR EQUATIONS; LINEAR SYSTEMS; TURBULENT FLOW;

BASIS PURSUIT; GREEDY ALGORITHM; POSITIVE ORTHANT; SPARSE SOLUTION; UNIQUENESS;

SOLUTIONS;

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

References (24)

1. S. S. Chen, D. L. Donoho, and M.A. Saunders, "Atomic decomposition by basis pursuit," SIAM Rev., vol. 43, pp. 129-159, Jan. 2001.
2. M. Chu and R. Plemmons, "Nonnegative matrix factorization and applications," IMAGE-Bull. Int. Linear Algebra Soc., vol. 34, pp. 2-7, Jul. 2005.
3. 1 minimization," Proc. Nat. Acad. Scien. USA, vol. 100, pp. 2197-2202, Mar. 2003.
4. D. L. Donoho and M. Elad, "On the stability of the basis pursuit in the presence of noise," Signal Process., vol. 86, pp. 511-532, Mar. 2006.
5. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2845-2862, Nov. 2001.
6. D. L. Donoho, M. Elad, and V. N. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 6-18, Jan. 2006.
7. D. L. Donoho and J. Tanner, "Sparse nonnegative solutions of underdetermined linear equations by linear programming," Proc. Nat. Acad. Sci. USA, vol. 102, no. 27, pp. 9446-9451, 2005.
8. D. L. Donoho and J. Tanner, "Thresholds for the recovery of sparse solutions via L1 minimization," in Proce. Conf. Information Sciences and Systems, Princeton, NJ, Mar. 2006.
9. D. L. Donoho and J. Tanner, "Neighborliness of randomly-projected simplices in high dimensions," Proc. Nat. Acad. Sci. USA, vol. 102, no.27, pp.9452-9457, 2005.
10. M. Elad, "Optimized projections for compressed- sensing," IEEE Trans. Signal Process., vol. 55, no. 12, pp. 5695-5702, Dec. 2007.
11. M. Elad and A. M. Bruckstein, "A generalized uncertainty principle and sparse representation in pairs of bases," IEEE Trans. Inf. Theory vol. 48, no. 9, pp. 2558-2567, Sep. 2002.
12. O. D. Escoda, L. Granai, and P. Vandergheynst, "On the use of a priori information for sparse signal approximations," IEEE Trans. Signal Process., vol. 54, no. 9, pp. 3468-3482, Sep. 2006.
13. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
14. T. Hazan, S. Polak, and A. Shashua, "Sparse image coding using a 3d nonnegative tensor factorization," in Proc. Int. Conf. Computer Vision (ICCV), Beijing, China, Oct. 2005, pp. 50-57.
15. R. Gribonval and M. Nielsen, "On the strong uniqueness of highly sparse representations from redundant dictionaries," in Proc. ICA 2004: Lecture Notes In Computer Science. Berlin, Germany: Springer-Verlag, 2004, vol. 3195, pp. 201-208.
16. S. Mallat and Z. Zhang, "Matching pursuit with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
17. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Conf. Rec. 27th Asilomar Conf. Signals, Systems and Computing, Pacific Grove, CA, Nov. 1993, vol. 1, pp. 40-44.
18. P. Pauca, J. Piper, and R. Plemmons, "Nonnegative matrix factorization for spectral data analysis," Linear Algebra and Applications, 416, pp. 29-47, Jul. 2006.
19. S. Raboi, "On the recovery of missing samples via sparsity conditions," M.Sc. thesis, Elec. Eng. Dept., Technion-Israel Inst. Technol., Haifa, Israel, 2007.
20. A. Shashua and T. Hazan, "Non-negative tensor factorization with applications to statistics and computer vision," in Proc. Int. Conf. Machine Learning (ICML), Bonn, Germany, Aug. 2005.
21. A. Shashua, R. Zass, and T. Hazan, "Multi-way clustering using super-symmetric nonnegative tensor factorization," in Proc. Europ. Conf. Computer Vision (ECCV), Graz, Austria, May 2006, pp. 595-608.
22. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
23. J. A. Tropp, "Just relax: Convex programming methods for identifying sparse signals in noise," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1030-1051, Mar. 2006.
24. R. Zass and A. Shashua, "Nonnegative sparse PCA," in Proc. Conf. Neural Information and Processing Systems (NIPS), Dec. 2006.