Learning Graph Filters for Structure-Function Coupling based Hub Node Identification

Abstract

Over the past two decades, tools from network science have been leveraged to characterize the organization of both structural and functional networks of the brain. One such measure of network organization is hub node identification. Hubs are specialized nodes within a network that link distinct brain units corresponding to specialized functional processes. Conventional methods for identifying hub nodes utilize different types of centrality measures and participation coefficient to profile various aspects of nodal importance. These methods solely rely on the functional connectivity networks constructed from functional magnetic resonance imaging (fMRI), ignoring the structure-function coupling in the brain. In this paper, we introduce a graph signal processing (GSP) based hub detection framework that utilizes both the structural connectivity and the functional activation to identify hub nodes. The proposed framework models functional activity as graph signals on the structural connectivity. Hub nodes are then detected based on the premise that hub nodes are sparse, have higher level of activity compared to their neighbors, and the non-hub nodes' activity can be modeled as the output of a graph-based filter. Based on these assumptions, an optimization framework, GraFHub, is formulated to learn the coefficients of the optimal polynomial graph filter and detect the hub nodes. The proposed framework is evaluated on both simulated data and resting state fMRI (rs-fMRI) data from Human Connectome Project (HCP).

13 pages, 4 figures

References in corpus (15)

• Fast unfolding of communities in large networks
• Community detection in graphs
• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
• Intensity and coherence of motifs in weighted complex networks
• Weight-conserving characterization of complex functional brain networks
• Economic Small-World Behavior in Weighted Networks
• Sampling of graph signals with successive local aggregations
• Graph signal processing for machine learning: A review and new perspectives
• Sampling Signals on Graphs: From Theory to Applications
• Edge vulnerability in neural and metabolic networks
• A User Guide to Low-Pass Graph Signal Processing and its Applications
• Bayesian Estimation of Graph Signals
• Locating Temporal Functional Dynamics of Visual Short-Term Memory Binding using Graph Modular Dirichlet Energy
• Graph-signal Reconstruction and Blind Deconvolution for Structured Inputs
• Detecting Central Nodes from Low-rank Excited Graph Signals via Structured Factor Analysis