Magnetic resonance imaging (MRI) is an indispensable tool for clinical knee examination, which often scans 2D stacked slices from multiple views. Radiologists typically locate lesion regions in one view, and then refer to other views to formulate a comprehensive diagnosis. However, existing computer-aided diagnosis methods fall short of identifying and fusing local regions in multi-view scans, leading to a decline in diagnostic performance and a heavy reliance on extensively annotated data. This paper introduces a novel framework that represents multi-view MRI scans as a knee graph, and conducts diagnosis using the proposed Knee Graph Network (KGNet). Moreover, KGNet is greatly enhanced by multi-task pre-training, which requires KGNet to reconstruct masked knee local patches and segment unmasked ones working alongside corresponding decoders. Experimental evaluations on public and in-house clinical datasets confirm that our framework outperforms existing approaches in diagnosing cartilage defects, anterior cruciate ligament tears, and knee abnormalities. In conclusion, our framework demonstrates the potential of enhancing knee disease diagnosis by representing multi-view MRI scans as a graph and employing multi-task pre-training in the graph network. The code is publicly available at https://github.com/zixuzhuang/KGNet.

Aneurysm segmentation in computed tomography angiography (CTA) images is essential for medical intervention aimed at preventing subarachnoid hemorrhages. However, most existing studies tend to overlook the topological characteristics of arteries related to aneurysms, often resulting in suboptimal performance in aneurysm segmentation. To address this challenge, we propose an artery-aware global-to-local framework for aneurysm segmentation (AASeg) using CTA images of head and neck. This framework consists of two key components: 1) a centerline graph network (CG-Net) for aneurysm global localization, and 2) a point cloud network (PC-Net) for local aneurysm segmentation. The centerline graph is generated by extracting artery centerline structures from vessel masks obtained through a pre-trained model for head and neck vessel segmentation. This representation serves as a high-level representation of the artery structure, allowing for analysis of aneurysms along the entire arteries. It facilitates aneurysm localization via aneurysm-segment graph classification along the arteries. Then, local region of aneurysm segment can be sampled from the vessel mask according to the aneurysm-segment graph. Subsequently, aneurysm segmentation is performed on the point cloud constructed from the aneurysm segment through the PC-Net. Extensive experiments show that the proposed framework achieves state-of-the-art performance in aneurysm localization on a main dataset and an external testing dataset, with Recall of 84.1% and 80.7%, false positives per case of 1.72 and 1.69, and segmentation DSC of 66.1% and 60.2%, respectively.

Brain serves as a critical cornerstone of human intelligence, which involves a series of complex neuropsychological activities that lead to the coordination of various functions in the brain network. In recent years, brain network analysis methods based on graph neural networks (GNNs) have attracted increasing attention for the identification of brain disorders. However, these methods generally assume that the brain network is a homogeneous graph while ignoring its heterogeneity among human brain activities, which is reflected in both the complex connectivity of the brain network and distinctive brain functions. To overcome this problem, we propose a heterogeneous subdivision GNN (HSGNN), which captures the heterogeneous connections and functions of the brain network simultaneously. Specifically, we first employ two fundamental brain connectivity patterns to capture both statistical dependency and directional information flow among different brain regions and construct a heterogeneous brain connectivity network for each subject. Then, we develop a functional subdivision method that encodes brain networks into multiple latent feature subspaces corresponding to heterogeneous brain functions and extracts features of brain networks accordingly. Considering the intricate interactions of brain functions to facilitate cognitive activities within the brain network, we further employ the self-attention mechanism to obtain comprehensive representations of brain networks in a joint latent space. Finally, we propose a composite loss function to train the model for obtaining the heterogeneous brain network representation, which can be utilized for disease classification. The experimental results in the Alzheimer's Disease Neuroimaging Initiative (ADNI) and Autism Brain Imaging Data Exchange (ABIDE) datasets demonstrate that our method outperforms several state-of-the-art (SOTA) methods to identify different types of brain cognitive-related disorders.

Depression is a serious mental disorder with complex etiology, exhibiting strong heterogeneity in clinical manifestations such as various subtypes. Research on depression subtypes may deepen the understanding of the disease, contributing to the diagnosis and prognosis. While brain functional network and graph neural networks (GNNs) provide such a means, the task is still challenged by limited feature encoding from the informative fMRI data, ineffective information fusion of brain functional network, and small size of the recruited subjects. Therefore, we propose a hierarchical encoding and fusion framework of brain functions. First, we pre-train a model to extract the features from individual brain regions, which signify nodes in the brain functional network. Then, distinct graphs are constructed to link the nodes within each subject, resulting in multi-view graphs of the brain functional network. We further develop a graph fusion strategy to integrate the multi-view information, by referring to the local encoding of the nodes and their interactions across multiple graph instances. Finally, we attain the classification of depression subtypes based on the fused graph representation. The experimental results demonstrate that our method can superiorly distinguish major depression subtypes and outperform the state-of-the-art methods.

Resting-state fMRI (rs-fMRI) is an effective tool for quantifying functional connectivity (FC), which plays a crucial role in exploring various brain diseases. Due to the high dimensionality of fMRI data, FC is typically computed based on the region of interest (ROI), whose parcellation relies on a pre-defined atlas. However, utilizing the brain atlas poses several challenges including 1) subjective selection bias in choosing from various brain atlases, 2) parcellation of each subject's brain with the same atlas yet disregarding individual specificity; 3) lack of interaction between brain region parcellation and downstream ROI-based FC analysis. To address these limitations, we propose a novel randomizing strategy for generating brain function representation to facilitate neural disease diagnosis. Specifically, we randomly sample brain patches, thus avoiding ROI parcellations of the brain atlas. Then, we introduce a new brain function representation framework for the sampled patches. Each patch has its function description by referring to anchor patches, as well as the position description. Furthermore, we design an adaptive-selection-assisted Transformer network to optimize and integrate the function representations of all sampled patches within each brain for neural disease diagnosis. To validate our framework, we conduct extensive evaluations on three datasets, and the experimental results establish the effectiveness and generality of our proposed method, offering a promising avenue for advancing neural disease diagnosis beyond the confines of traditional atlas-based methods. Our code is available at https://github.com/mjliu2020/RandomFR.

The structure of networks can be efficiently represented using motifs, which are those subgraphs that recur most frequently. One route to understanding the motif structure of a network is to study the distribution of subgraphs using statistical mechanics. In this article, we address the use of motifs as network primitives using the cluster expansion from statistical physics. By mapping the network motifs to clusters in the gas model, we derive the partition function for a network, and this allows us to calculate global thermodynamic quantities, such as energy and entropy. We present analytical expressions for the number of certain types of motifs, and compute their associated entropy. We conduct numerical experiments for synthetic and real-world data sets and evaluate the qualitative and quantitative characterizations of the motif entropy derived from the partition function. We find that the motif entropy for real-world networks, such as financial stock market networks, is sensitive to the variance in network structure. This is in line with recent evidence that network motifs can be regarded as basic elements with well-defined information-processing functions.

The diagnosis and analysis of cancer are usually roughly judged through the accumulation of professional knowledge, which is difficult to deal with a large number of patient samples and a variety of causes and symptoms. Moreover, most of the existing machine learning methods are black-box, and can not give reasonable diagnosis basis. Therefore, an accurate and interpretable method is urgently required for cancer diagnosis. In this paper, a total of 700 serum samples consisting of three groups of patients and one group of healthy individuals were collected and subjected to SERS measurements. We rank the Raman spectra of 700 human SERA according to the feature importance, and construct the feature importance vector reflecting the spectral feature importance. We further construct candidate feature sets based on importance selection, so as to construct a random forest model based on feature ensemble selection. On the one hand, we compare the proposed method with the popular machine learning methods to verify the effectiveness in the task of cancer screening. On the other hand, we conduct qualitative and quantitative analysis of cancer characteristics, and give model basis and biomedical explanation for the impact of different important cancer characteristics on the final classification and diagnosis. Some more experimental results and discussions are included in the appendix. Our source code and appendix are available under https://github.com/liujiatong429/BIBM2021