J4 ›› 2010, Vol. 37 ›› Issue (5): 835-841.doi: 10.3969/j.issn.1001-2400.2010.05.011

• Original Articles • Previous Articles     Next Articles

New blind source separation algorithm based on L1 sparse regularization and nonnegative matrix factorization

YIN Hai-qing;LIU Hong-wei   

  1. (School of Science, Xidian Univ., Xi'an  710071, China)
  • Received:2009-10-09 Online:2010-10-20 Published:2010-10-11
  • Contact: YIN Hai-qing E-mail:yinhaiqing2008@163.com

Abstract:

For the inverse problem of blind source separation (BSS), with which sources are mixed linearly, an alternating minimization algorithm based on iterative regularization and nonnegative matrix factorization(NMF) is proposed. Firstly, this problem is transformed into a bound constrained convex quadratic problem, and then a gradient projection algorithm with adaptive Barzilai-Borwein steplength selection rules is used. This method not only requires lower storage, and improves the speed of computing but also can explain the signals' sparsity and independence appropriately. Theoretical analysis and experimental results show that he new method is promising. The signal-to-Interference Ratio (SIR) can be improved for the mixed two dimensional images.

Key words: blind source separation (BSS), inverse problem, nonnegative matrix factorization(NMF), gradient projection algorithm, signal-to-interference ratio (SIR)