Kai Ma

Mr. Kai Ma

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2020 in Neuroscience
Verified
Journal Article
Closed access
KMKai Ma
Kai Ma
JYJintai Yu
Jintai Yu
WSWei Shao
Wei Shao
XXXijia Xu
Xijia Xu
ZZZhiqiang Zhang
Zhiqiang Zhang
DZDaoqiang Zhang
Daoqiang Zhang

14 January 2025 in NeuroImage
Verified
Journal Article
Open access
CLChaojun Li
Chaojun Li
KMKai Ma
Kai Ma
SLShengrong Li
Shengrong Li
XMXiangshui Meng
Xiangshui Meng
RWRan Wang
Ran Wang
QZQi Zhu
Qi Zhu
Dynamic brain networks (DBNs) can capture the intricate connections and temporal evolution among brain regions, becoming increasingly crucial in the diagnosis of neurological disorders. However, most existing researches tend to focus on isolated brain network sequence segmented by sliding windows, and they are difficult to effectively uncover the higher-order spatio-temporal topological pattern in DBNs. Meantime, it remains a challenge to utilize the structure connectivity prior in the DBNs analysis. To address these problems, we propose a multi-channel spatio-temporal graph attention contrastive network for DBNs analysis. Specifically, we first construct dynamic brain functional networks from fMRI data with sliding windows, and embed the structural connectivity derived from diffusion tensor imaging (DTI) to the dynamic functional connectivity graph representation to construct multi-modal brain network. Second, we develop a multi-channel spatial attention contrastive network to extract topological features from the brain network within each time window. This network incorporates an intra-window graph contrastive constraint to enhance the discriminative ability of the extracted features. Moreover, temporal dependencies across windows are captured by integrating feature embeddings through a self-attention mechanism, and the inter-window recurrent contrastive constraint is devised to extract higher-order spatio-temporal topological features. Finally, a multi-layer perceptron (MLP) is used to classify the brain networks. Experiments on epilepsy and ADNI datasets show that our method outperforms several state-of-the-art approaches in diagnosing performance, and it provides discriminative graph features for related brain diseases.

11 April 2022 in IEEE Transactions on Neural Systems and Rehabilitation Engineering
Verified
Journal Article
Open access
KMKai Ma
Kai Ma
SHShuo Huang
Shuo Huang
DZDaoqiang Zhang
Daoqiang Zhang
Mild cognitive impairment (MCI) belongs to the prodromal stage of Alzheimer’s disease (AD). Accurate diagnosis of MCI is very important for possibly deferring AD progression. Graph kernels, which measure the similarity between paired brain connectivity networks, have been widely used to diagnose brain diseases (e.g., MCI) and yielded promising classification performance. However, most of the existing graph kernels are based on unweighted graphs, and neglect the valuable weighted information of the edges in brain connectivity networks where edge weights convey the strengths of fiber connection or temporal correlation between paired brain regions. Accordingly, in this paper, we propose a new graph kernel called ordinal pattern kernel for measuring brain connectivity network similarity and apply it to brain disease classification tasks. Different from the existing graph kernels which measure the topological similarity of the unweighted graphs, our proposed ordinal pattern kernel can not only calculate the similarity of paired brain connectivity networks, but also capture the ordinal pattern relationship of edge weights in brain connectivity networks. To appraise the effectiveness of our proposed method, we perform extensive experiments in functional magnetic resonance imaging data of brain disease from Alzheimer’s Disease Neuroimaging Initiative database. The experimental results show that our proposed ordinal pattern kernel outperforms the state-of-the-art graph kernels in the classification tasks of MCI.

23 April 2025 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
SLShengrong Li
Shengrong Li
QZQi Zhu
Qi Zhu
LSLiang Sun
Liang Sun
KMKai Ma
Kai Ma
YJYixin Ji
Yixin Ji
DZDaoqiang Zhang
Daoqiang Zhang
Embedding multi-modal brain network analysis technology into consumer electronics, such as smart wearables, helps enable early intelligent diagnosis of brain diseases. Recent studies confirm that the functional-structural coupling in certain regions is more tightly correlated than in others. However, existing multi-modal methods often directly fuse functional brain networks (FBN) and structural brain networks (SBN), ignoring the regional heterogeneity between them. Additionally, identity information encoded in brain networks may interfere with disease diagnosis. In this paper, we develop a multi-modal brain network fusion method with regional heterogeneity constraints, and design a feature decoupling module to alleviate disease-irrelevant information. Specifically, we first divide FBN and SBN into multiple subnetworks, and introduce penalty weights to reduce the communication cost between cross-modal brain regions within the subnetwork while increasing the cost between different subnetworks. Then, under the regional heterogeneity constraints, we adopt optimal transport to simulate the transfer of brain region hubness from FBN to SBN, thereby effectively integrating the complex cross-modal interactions. Furthermore, we design a feature decoupling module to suppress ineffective features and enhance the discrimination between modality-specific features and multi-modal features. Experimental results show that the proposed method has promising performance and can identify multi-modal biomarkers for brain disease diagnosis.

1 February 2022 in Intelligent Medicine
Verified
Journal Article
Open access
KMKai Ma
Kai Ma
WSWei Shao
Wei Shao
QZQi Zhu
Qi Zhu
DZDaoqiang Zhang
Daoqiang Zhang

12 December 2023 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
KMKai Ma
Kai Ma
XWXuyun Wen
Xuyun Wen
QZQi Zhu
Qi Zhu
DZDaoqiang Zhang
Daoqiang Zhang
Brain networks, describing the functional or structural interactions of brain with graph theory, have been widely used for brain imaging analysis. Currently, several network representation methods have been developed for describing and analyzing brain networks. However, most of these methods ignored the valuable weighted information of the edges in brain networks. In this paper, we propose a new representation method (i.e., ordinal pattern tree) for brain network analysis. Compared with the existing network representation methods, the proposed ordinal pattern tree (OPT) can not only leverage the weighted information of the edges but also express the hierarchical relationships of nodes in brain networks. On OPT, nodes are connected by ordinal edges which are constructed by using the ordinal pattern relationships of weighted edges. We represent brain networks as OPTs and further develop a new graph kernel called optimal transport (OT) based ordinal pattern tree (OT-OPT) kernel to measure the similarity between paired brain networks. In OT-OPT kernel, the OT distances are used to calculate the transport costs between the nodes on the OPTs. Based on these OT distances, we use exponential function to calculate OT-OPT kernel which is proved to be positive definite. To evaluate the effectiveness of the proposed method, we perform classification and regression experiments on ADHD-200, ABIDE and ADNI datasets. The experimental results demonstrate that our proposed method outperforms the state-of-the-art graph methods in the classification and regression tasks.