论文标题
来自单个时间点的时间依赖性脑图数据综合的深度浏览网架构
Deep EvoGraphNet Architecture For Time-Dependent Brain Graph Data Synthesis From a Single Timepoint
论文作者
论文摘要
学习如何预测脑连接组(即图)的开发和衰老对于绘制脑部功能障碍性演化的disorder和跨disordord景观的未来至关重要。确实,预测随着时间的推移出现和演变的纵向(即,时间依赖性)脑功能障碍性,可以帮助在很早的阶段为无序患者设计个性化治疗方法。尽管具有重要意义,但在文献中,大脑图的进化模型在很大程度上被忽略了。在这里,我们提出了Evographnet,这是第一个端到端的几何深度学习驱动图生成网络(GGAN),用于从单个时间点预测时间依赖时间的脑图演变。我们的evographNet架构层叠了一组与时间相关的ggans,每个Ggan在特定的时间点上传达其预测的大脑图,以在后续时间点训练喀斯喀特的下一个GGAN。因此,我们通过将每个发电机的输出作为其后继器的输入来获得每个预测的时间点,这使我们能够以末端方式仅使用一个时间点预测给定数量的时间点。在每个时间点,为了更好地使预测的脑图的分布与地面图形的分布相结合,我们进一步整合了辅助kullback-leibler发散损失函数。为了捕获两个连续观测之间的时间依赖性,我们施加了L1损失,以最大程度地减少两个序列化脑图之间的稀疏距离。一系列针对我们的evographnet变体和消融版本的基准表明,我们可以使用单个基线时间点实现最低的大脑图进化预测误差。我们的EvographNet代码可在http://github.com/basiralab/evographnet上获得。
Learning how to predict the brain connectome (i.e. graph) development and aging is of paramount importance for charting the future of within-disorder and cross-disorder landscape of brain dysconnectivity evolution. Indeed, predicting the longitudinal (i.e., time-dependent ) brain dysconnectivity as it emerges and evolves over time from a single timepoint can help design personalized treatments for disordered patients in a very early stage. Despite its significance, evolution models of the brain graph are largely overlooked in the literature. Here, we propose EvoGraphNet, the first end-to-end geometric deep learning-powered graph-generative adversarial network (gGAN) for predicting time-dependent brain graph evolution from a single timepoint. Our EvoGraphNet architecture cascades a set of time-dependent gGANs, where each gGAN communicates its predicted brain graphs at a particular timepoint to train the next gGAN in the cascade at follow-up timepoint. Therefore, we obtain each next predicted timepoint by setting the output of each generator as the input of its successor which enables us to predict a given number of timepoints using only one single timepoint in an end- to-end fashion. At each timepoint, to better align the distribution of the predicted brain graphs with that of the ground-truth graphs, we further integrate an auxiliary Kullback-Leibler divergence loss function. To capture time-dependency between two consecutive observations, we impose an l1 loss to minimize the sparse distance between two serialized brain graphs. A series of benchmarks against variants and ablated versions of our EvoGraphNet showed that we can achieve the lowest brain graph evolution prediction error using a single baseline timepoint. Our EvoGraphNet code is available at http://github.com/basiralab/EvoGraphNet.