L0-regularized time-varying sparse inverse covariance estimation for tracking dynamic fMRI brain networks.

Zening Fu, Sheng Han, Ao Tan, Yiheng Tu, Zhiguo Zhang
{"title":"L0-regularized time-varying sparse inverse covariance estimation for tracking dynamic fMRI brain networks.","authors":"Zening Fu, Sheng Han, Ao Tan, Yiheng Tu, Zhiguo Zhang","doi":"10.1109/EMBC.2015.7318654","DOIUrl":null,"url":null,"abstract":"Exploration of time-varying functional brain connectivity based on functional Magnetic Resonance Imaging (fMRI) data is important for understanding dynamic brain mechanisms. l1-penalized inverse covariance is a common measure for the inference of sparse structure of functional brain networks, and it has been recently extended to estimate time-varying sparse brain networks by using a sliding window and incorporating a smoothing constraint on temporal variation. However, l1 penalty cannot induce maximum sparsity, as compared with l0 penalty, so l0 penalty is supposed to have superior quality on inverse covariance estimation. This paper introduces a novel time-varying sparse inverse covariance estimation method based on dual l0-penalties (DLP). The new DLP method estimates the sparse inverse covariance by minimizing an l0-penalized log-likelihood function and an extra l0 penalty on temporal homogeneity. A cyclic descent optimization algorithm is further developed to localize the minimum of the objective function. Experiment results on simulated signals show that the proposed DLP method can achieve better performance than conventional l1-penalized methods in estimating time-varying sparse network structures under different scenarios.","PeriodicalId":72689,"journal":{"name":"Conference proceedings : ... Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual Conference","volume":"24 1","pages":"1496-9"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference proceedings : ... Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMBC.2015.7318654","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Exploration of time-varying functional brain connectivity based on functional Magnetic Resonance Imaging (fMRI) data is important for understanding dynamic brain mechanisms. l1-penalized inverse covariance is a common measure for the inference of sparse structure of functional brain networks, and it has been recently extended to estimate time-varying sparse brain networks by using a sliding window and incorporating a smoothing constraint on temporal variation. However, l1 penalty cannot induce maximum sparsity, as compared with l0 penalty, so l0 penalty is supposed to have superior quality on inverse covariance estimation. This paper introduces a novel time-varying sparse inverse covariance estimation method based on dual l0-penalties (DLP). The new DLP method estimates the sparse inverse covariance by minimizing an l0-penalized log-likelihood function and an extra l0 penalty on temporal homogeneity. A cyclic descent optimization algorithm is further developed to localize the minimum of the objective function. Experiment results on simulated signals show that the proposed DLP method can achieve better performance than conventional l1-penalized methods in estimating time-varying sparse network structures under different scenarios.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于跟踪动态fMRI脑网络的l0正则化时变稀疏逆协方差估计。
基于功能磁共振成像(fMRI)数据的时变脑功能连接探索对于理解动态脑机制具有重要意义。l1惩罚逆协方差是一种用于推断功能性脑网络稀疏结构的常用度量,最近已通过使用滑动窗口并结合时间变化的平滑约束将其扩展到估计时变稀疏脑网络。然而,与10惩罚相比,l1惩罚不能诱导出最大的稀疏度,因此10惩罚被认为在逆协方差估计上具有更好的质量。提出了一种基于对偶10 -惩罚(DLP)的时变稀疏反协方差估计方法。新的DLP方法通过最小化一个10惩罚的对数似然函数和一个额外的10惩罚的时间同质性来估计稀疏逆协方差。进一步提出了一种循环下降优化算法,用于定位目标函数的最小值。在模拟信号上的实验结果表明,在不同场景下,DLP方法在估计时变稀疏网络结构方面比传统的11惩罚方法取得了更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.20
自引率
0.00%
发文量
0
期刊最新文献
Rapid Label-free DNA Quantification by Multi-frequency Impedance Sensing on a Chip. A Comparison of 1-D and 2-D Deep Convolutional Neural Networks in ECG Classification Brain Morphometry Analysis with Surface Foliation Theory Low-Cost, USB Connected and Multi-Purpose Biopotential Recording System. A Fast Respiratory Rate Estimation Method using Joint Sparse Signal Reconstruction based on Regularized Sparsity Adaptive Matching Pursuit.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1