提出首个在高阶拓扑空间进行脑图超分辨率的框架,保持关键神经连接结构。
Strongly Topology-preserving GNNs for Brain Graph Super-resolution
- 将低分辨率脑图边空间映射到高分辨率对偶图节点空间,实现拓扑一致性学习
- 在7个拓扑指标上显著优于现有方法,提升脑图结构还原精度
- 兼容各类GNN层,计算高效,适合大规模脑网络分析
脑图超分辨率(SR)是网络神经科学中一个尚未充分探索但极具应用价值的任务,可避免昂贵且耗时的医学影像采集与处理。现有方法依赖图神经网络(GNN)处理图结构数据,但多数GNN仅关注节点特征学习,存在两大局限:(1) 需要复杂计算才能学习反映连接强度或边特征的节点特征,难以扩展至大规模图;(2) 节点空间计算无法有效捕捉团、枢纽等高阶脑拓扑结构。已有研究证实脑图拓扑对阿尔茨海默病和帕金森病等神经退行性疾病具有重要意义。为此,我们提出首个在高阶拓扑空间进行表示学习的脑图超分辨率框架——STP-GSR。基于图论中的原-对偶图构型,我们设计了一种高效映射,将低分辨率(LR)脑图的边空间映射至高分辨率(HR)对偶图的节点空间。该设计使对偶图上的节点级计算天然对应于HR脑图的边级学习,从而在框架内强制实现强拓扑一致性。此外,该框架与GNN层无关,可适配更小、更轻量的GNN,降低计算开销。我们在七个关键拓扑度量上全面评估,结果表明其显著优于现有最先进方法与基线模型。
原文摘要 · Abstract (English)
Brain graph super-resolution (SR) is an under-explored yet highly relevant task in network neuroscience. It circumvents the need for costly and time-consuming medical imaging data collection, preparation, and processing. Current SR methods leverage graph neural networks (GNNs) thanks to their ability to natively handle graph-structured datasets. However, most GNNs perform node feature learning, which presents two significant limitations: (1) they require computationally expensive methods to learn complex node features capable of inferring connectivity strength or edge features, which do not scale to larger graphs; and (2) computations in the node space fail to adequately capture higher-order brain topologies such as cliques and hubs. However, numerous studies have shown that brain graph topology is crucial in identifying the onset and presence of various neurodegenerative disorders like Alzheimer and Parkinson. Motivated by these challenges and applications, we propose our STP-GSR framework. It is the first graph SR architecture to perform representation learning in higher-order topological space. Specifically, using the primal-dual graph formulation from graph theory, we develop an efficient mapping from the edge space of our low-resolution (LR) brain graphs to the node space of a high-resolution (HR) dual graph. This approach ensures that node-level computations on this dual graph correspond naturally to edge-level learning on our HR brain graphs, thereby enforcing strong topological consistency within our framework. Additionally, our framework is GNN layer agnostic and can easily learn from smaller, scalable GNNs, reducing computational requirements. We comprehensively benchmark our framework across seven key topological measures and observe that it significantly outperforms the previous state-of-the-art methods and baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。