Evaluating Structural Symmetry of Weighted Brain Networks via Graph Matching

被引:0
|
作者
Hu, Chenhui [1 ]
El Fakhri, Georges [1 ]
Li, Quanzheng [1 ]
机构
[1] Massachusetts Gen Hosp, Ctr Adv Med Imaging Sci, NMMI, Boston, MA 02114 USA
来源
MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2014, PT II | 2014年 / 8674卷
关键词
network symmetry; weighted brain networks; graph matching; ADHD; rs-fMRI; coactivation network; INDIVIDUAL-DIFFERENCES; ASYMMETRIES;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We study the symmetry of weighted brain networks to understand the roles of individual brain areas and the redundancy of the brain connectivity. We quantify the structural symmetry of every node pair in the network by isomorphism of the residual graphs of those nodes. The efficacy of the symmetry measure is evaluated on both simulated networks and real data sets. In the resting state fMRI (rs-fMRI) data, we discover that subjects with inattentive type of Attention Deficit Hyperactivity Disorder (ADHD) demonstrate a higher level of network symmetry in contrast to the typically development group, consistent with former findings. Moreover, by comparing the average functional networks of normal subjects during resting state and activation, we obtain a higher symmetry level in the rs-fMRI network when applying median thresholds to the networks. But the symmetry levels of the networks are almost the same when larger thresholds are used, which may imply the invariance of the prominent network symmetry for ordinary people.
引用
收藏
页码:733 / 740
页数:8
相关论文
共 50 条
  • [1] EXPLORING HERITABILITY OF FUNCTIONAL BRAIN NETWORKS WITH INEXACT GRAPH MATCHING
    Ktena, Sofia Ira
    Arslan, Salim
    Parisot, Sarah
    Rueckert, Daniel
    2017 IEEE 14TH INTERNATIONAL SYMPOSIUM ON BIOMEDICAL IMAGING (ISBI 2017), 2017, : 354 - 357
  • [2] Symmetry-aware graph matching
    Wang, Tao
    Ling, Haibin
    Lang, Congyan
    Feng, Songhe
    PATTERN RECOGNITION, 2016, 60 : 657 - 668
  • [3] Learning Graph Matching with Graph Neural Networks
    Dobler, Kalvin
    Riesen, Kaspar
    ARTIFICIAL NEURAL NETWORKS IN PATTERN RECOGNITION, ANNPR 2024, 2024, 15154 : 3 - 12
  • [4] A new relaxation model for weighted graph matching
    Zheng K.-J.
    Gao Y.-T.
    Peng J.-G.
    Zidonghua Xuebao/Acta Automatica Sinica, 2010, 36 (08): : 1200 - 1203
  • [5] A dynamical systems approach to weighted graph matching
    Zavlanos, Michael M.
    Pappas, George J.
    AUTOMATICA, 2008, 44 (11) : 2817 - 2824
  • [6] Graph Matching Via the Lens of Supermodularity
    Konar, Aritra
    Sidiropoulos, Nicholas D.
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (05) : 2200 - 2211
  • [7] Graph Matching Using Hierarchical Fuzzy Graph Neural Networks
    Krleza, Dalibor
    Fertalj, Kresimir
    IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2017, 25 (04) : 892 - 904
  • [8] Using eigen-decomposition method for weighted graph matching
    Zhao, Guoxing
    Lu, Bin
    Tang, Jin
    Ma, Jinxin
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF THEORETICAL AND METHODOLOGICAL ISSUES, 2007, 4681 : 1283 - +
  • [9] A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM
    ALMOHAMAD, HA
    DUFFUAA, SO
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1993, 15 (05) : 522 - 525
  • [10] Vertex nomination via seeded graph matching
    Patsolic, Heather G.
    Park, Youngser
    Lyzinski, Vince
    Priebe, Carey E.
    STATISTICAL ANALYSIS AND DATA MINING, 2020, 13 (03) : 229 - 244