林秋华

个人信息Personal Information

教授

博士生导师

硕士生导师

性别:女

毕业院校:大连理工大学

学位:博士

所在单位:信息与通信工程学院

学科:信号与信息处理

联系方式:84706002-3326; 84706697

电子邮箱:qhlin@dlut.edu.cn

扫描关注

论文成果

当前位置: 中文主页 >> 科学研究 >> 论文成果

Double Coupled Canonical Polyadic Decomposition for Joint Blind Source Separation

点击次数:

论文类型:期刊论文

发表时间:2018-07-01

发表刊物:IEEE TRANSACTIONS ON SIGNAL PROCESSING

收录刊物:SCIE

卷号:66

期号:13

页面范围:3475-3490

ISSN号:1053-587X

关键字:Joint blind source separation; tensor; coupled canonical polyadic decomposition

摘要:Joint blind source separation (J-BSS) is an emerging data-driven technique for multi-set data-fusion. In this paper, J-BSS is addressed from a tensorial perspective. We show how, by using second-order multi-set statistics in J-BSS, a specific double coupled canonical polyadic decomposition (DC-CPD) problem can be formulated. We propose an algebraic DC-CPD algorithm based on a coupled rank-1 detection mapping. This algorithm converts a possibly underdetermined DC-CPD to a set of overdetermined CPDs. The latter can be solved algebraically via a generalized eigenvalue decomposition based scheme. Therefore, this algorithm is deterministic and returns the exact solution in the noiseless case. In the noisy case, it can be used to effectively initialize optimization based DC-CPD algorithms. In addition, we obtain the deterministic and generic uniqueness conditions for DC-CPD, which are shown to be more relaxed than their CPD counterpart. We also introduce optimization based DC-CPD methods, including alternating least squares, and structured data fusion based methods. Experiment results are given to illustrate the superiority of DC-CPD over standard CPD based BSS methods and several existing J-BSS methods, with regards to uniqueness and accuracy.