title: Online blind source separation using incremental nonnegative matrix factorization with volume constraint.
abstract: Online blind source separation (BSS) is proposed to overcome the high computational cost problem, which limits the practical applications of traditional batch BSS algorithms. However, the existing online BSS methods are mainly used to separate independent or uncorrelated sources. Recently, nonnegative matrix factorization (NMF) shows great potential to separate the correlative sources, where some constraints are often imposed to overcome the non-uniqueness of the factorization. In this paper, an incremental NMF with volume constraint is derived and utilized for solving online BSS. The volume constraint to the mixing matrix enhances the identifiability of the sources, while the incremental learning mode reduces the computational cost. The proposed method takes advantage of the natural gradient based multiplication updating rule, and it performs especially well in the recovery of dependent sources. Simulations in BSS for dual-energy X-ray images, online encrypted speech signals, and high correlative face images show the validity of the proposed method.
authors.affiliation: School of Electronics and Information Engineering, South China University of Technology, Guangzhou 510641, China. zhou.guoxu@mail.scut.edu.cn
authors.forename: Guoxu
authors.initials: G
authors.lastname: Zhou
authors.forename: Zuyuan
authors.initials: Z
authors.lastname: Yang
authors.forename: Shengli
authors.initials: S
authors.lastname: Xie
authors.forename: Jun-Mei
authors.initials: JM
authors.lastname: Yang
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D005145:Face; D006801:Humans; D009010:Monte Carlo Method; D009862:Online Systems; D010363:Pattern Recognition, Automated / Q000379:methods*; D014057:Tomography, X-Ray Computed