Probability estimation for recoverability analysis of blind source separation based on sparse representation

IEEE Transactions on Information Theory

Volumn 52, Issue 7, 2006, Pages 3139-3152

  Li, Yuanqing ^a   Amari, Shun Ichi ^b   Cichocki, Andrzej ^b   Guan, Cuntai ^a  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b RIKEN BRAIN SCIENCE INSTITUTE   (Japan)

Author keywords

Blind source separation (BSS); Linear programming; Probability estimation; Recoverability; Sparse representation

Indexed keywords

COMPUTER SIMULATION; ESTIMATION; LINEAR PROGRAMMING; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

PROBABILITY ESTIMATION; RECOVERABILITY; SPARSE REPRESENTATION;

BLIND SOURCE SEPARATION;

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

References (28)

1. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Scientific Computing, vol. 20, no. 1, pp. 33-61, 1998.
2. B. A. Olshausen, P. Sallee, and M. S. Lewicki, "Learning sparse image codes using a wavelet pyramid architecture," in Advances in Neural information Processing Systems 13. Cambridge, MA: MIT Press, 2001, pp. 887-893.
3. D. L. Donoho and D. Neighborly, Polytopes and Sparse Solution of Underdetermined Linear Equations 2005 [Online]. Available: http:// www-stat.stanford.edu/donoho/Reports/2005/NPaSSULE-01-28-05.pdf
4. M. S. Lewicki and T. J. Sejnowski, "Learning overcomplete representations," Neural Comput., vol. 12, no. 2, pp. 337-365, 2000.
5. K. K. Delgado, J. F. Murray, B. D. Rao, K. Engan, T. W. Lee, and T. J. Sejnowski, "Dictionary learning algorithms for sparse representation," Neural Comput., vol. 15, pp. 349-396, 2003.
6. R. Gribonval and M. Nielsen, "Sparse decompositions in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
7. J. A. Tropp, "Algorithms for simultaneous sparse approximation, Part II: Convex relaxation," EURASIP J. Appl. Signal Process. (Special Issue on Sparse Approximations in Signal and Image Processing, 2005, accepted for publication.
8. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
9. R. Gribonval, R. Figueras, and P. Vandergheynst, "A simple test to check the optimality of sparse signal approximations," in Proc. IEEE Conf. Acoustics, Speech and Signal Processing, Philadelphia, PA, Mar. 2005, vol. V, pp. 717-720.
10. J. A. Tropp, A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss, "Improved sparse approximation over quasiincoherent dictionaries," in Proc. 2003 IEEE Int. Confe. Image Processing, Barcelona, Spain, Sep. 2003, pp. 37-40.
11. 1 minimization," Proc. Nat. Acad. Sci., vol. 100, pp. 2197-2202, 2003.
12. J. Eriksson and V. Koivunen, "Identifiability and separability of linear ICA models revisited," in Proc. 4th Int. Symp. Independent Component Analysis and Blind Signal Separation, Nara, Japan, 2003, pp. 23-27.
13. M. Davies, "Identifiability issues in noisy ICA," IEEE Signal Process. Lett., vol. 11, no. 5, pp. 470-473, May 2004.
14. J. -F. Cardoso, "Blind signal separation: Statistical principles," Proc. IEEE, vol. 86, no. 10, pp. 2009-2025, Oct. 1998.
15. Y. Li and J. Wang, "Sequential blind extraction of linearly mixed sources, IEEE Trans. Signal Process., vol. 50, no. 5, pp. 997-1007, May 2002.
16. P. Bofill and M. Zibulevsky, "Underdetermined blind source separation using sparse representations," Signal Process., vol. 81, no. 11, pp. 2353-2362, 2001.
17. M. Zibulevsky and B. A. Pearlmutter, "Blind source separation by sparse decomposition," Neural Comput., vol. 13, no. 4, pp. 863-882, 2001.
18. M. Zibulevsky, B. A. Pearlmutter, P. Bofill, and P. Kisilev, S. J. Roberts and R. M. Everson, Eds., "Blind source separation by sparse decomposition in a signal dictionary," in Independent Components Analysis: Principles and Practice. Cambridge, U.K.: Cambridge Univ. Press, 2000.
19. T. W. Lee, M. S. Lewicki, M. Girolami, and T. J. Sejnowski, "Blind source separation of more sources than mixtures using overcomplete representations," IEEE Signal Process. Lett., vol. 6, no. 4, pp. 87-90, Apr. 1999.
20. M. Girolami, "A variational method for learning sparse and overcomplete representations," Neural Comput., vol. 13, no. 11, pp. 1532-2517, 2001.
21. Y. Q. Li, A. Cichocki, and S. Amari, "Analysis of sparse representation and blind source separation," Neural Comput., vol. 16, pp. 1193-1234, 2004.
22. J.-J. Fuchs, "Recovery of exact sparse representations in the presence of noise," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Montreal, QC, Canada, 2004, pp. II-533-536.
23. D. L. Donoho, M. Elad, and V. N. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise. Feb. 2004, working draft.
24. D. M. Malioutov, M. Cetin, and A. S. Willsky, "Optimal sparse representations in general overcomplete bases," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Montreal, QC, Canada, May 2004, vol. 2, pp. II-793-796.
25. D. L. Donoho, For Most Large Underdetermined Systems of Linear Equations, the Minimal L1-Norm Nearsolution Approximates the Sparsest Near-Solution. (Report) [Online]. Available: http://www-stat.stanford. edu/donoho/reports.html
26. D. L. Donoho, For Most Large Underdetermined Systems of Linear Equations, the Minimal L1-Norm Solution is Also the Sparsest Solution. (Report) [Online]. Available: http://www-stat.stanford.edu/donoho/ reports.html
27. 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.
28. M. Elad and M. Zibulevsky, A Probabilistic Study of the Average Performance of the Basis Pursuit [Online]. Available: http:// www.cs.technion.ac.il/elad/publications/journals/