Mining The Bilinear Structure Of Data With Approximate Joint Diagonalization

2016 24th European Signal Processing Conference (EUSIPCO)(2016)

引用 4|浏览3
暂无评分
摘要
Approximate Joint Diagonalization of a matrix set can solve the linear Blind Source Separation problem. If the data possesses a bilinear structure, for example a spatio-temporal structure, transformations such as tensor decomposition can be applied. In this paper we show how the linear and bilinear joint diagonalization can be applied for extracting sources according to a composite model where some of the sources have a linear structure and other a bilinear structure. This is the case of Event Related Potentials (ERPs). The proposed model achieves higher performance in term of shape and robustness for the estimation of ERP sources in a Brain Computer Interface experiment.
更多
查看译文
关键词
bilinear data structure,approximate joint diagonalization,linear blind source separation,tensor decomposition,event related potentials,ERP sources,brain computer interface
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要