Brain Source Localization using Constrained Low Rank Canonical Polyadic Decomposition

2018 CONFERENCE RECORD OF 52ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS(2018)

引用 2|浏览0
暂无评分
摘要
A new tensor-based source localization algorithm is presented in this paper. It is a single-step algorithm in which tensor decomposition with an efficient rank estimation and source localization are performed in only one single step. Contrary to the previous single-step tensor-based STS SISSY (Space-Time-Spike Source Imaging based on Structured Sparsity) method recently proposed by our group, the proposed method is robust to tensor over-factoring and gives more accurate results. In addition to the structural constraints on the sources required for their localization, group sparsity constraints on the loading over-estimated matrices of the constructed STS tensor is used to estimate its rank. The numerical results show the efficiency of the proposed method over the STS-SISSY one.
更多
查看译文
关键词
constrained low rank canonical polyadic decomposition,tensor-based source localization algorithm,single-step algorithm,tensor decomposition,efficient rank estimation,single-step tensor-based STS-SISSY,Space-Time-Spike Source Imaging based on Structured Sparsity,constructed STS tensor,brain Source localization,structural constraints,group sparsity constraints,electroencephalography
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要