版权说明 操作指南
首页 > 成果 > 详情

Optimizing pcsCPD withAlternating Rank-R andRank-1 Least Squares: Application toComplex-Valued Multi-subject fMRI Data

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
会议论文
作者:
Kuang L.-D.;Li W.;Gui Y.
通讯作者:
Kuang, L.-D.
作者机构:
[Kuang L.-D.; Gui Y.; Li W.] School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha, 410114, China
通讯机构:
[Kuang, L.-D.] S
School of Computer and Communication Engineering, China
语种:
英文
关键词:
ALS;CPD;fMRI;phase sparsity constraint;shift-invariance
期刊:
Communications in Computer and Information Science
ISSN:
1865-0929
年:
2023
卷:
1792 CCIS
页码:
290-302
会议名称:
29th International Conference on Neural Information Processing, ICONIP 2022
会议时间:
22 November 2022 through 26 November 2022
主编:
Tanveer M.Agarwal S.Ozawa S.Ekbal A.Jatowt A.
出版者:
Springer Science and Business Media Deutschland GmbH
ISBN:
9789819916412
机构署名:
本校为第一机构
院系归属:
计算机与通信工程学院
摘要:
Complex-valued shift-invariant canonical polyadic decomposition (CPD) under a spatial phase sparsity constraint (pcsCPD) showed satisfying separation performance of decomposing three-way multi-subject fMRI data into shared spatial maps (SMs), shared time courses (TCs), time delays and subject-specific intensities. However, pcsCPD exploits alternating least squares (ALS) updating rule, which converges slowly and requires data strictly conforming to the shift-invariant CPD model. As the lower rank approximation can relax the CPD model, we propose...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com