<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="2.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Neurosci.</journal-id>
<journal-title>Frontiers in Neuroscience</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Neurosci.</abbrev-journal-title>
<issn pub-type="epub">1662-453X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fnins.2024.1364338</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>3D-CAM: a novel context-aware feature extraction framework for neurological disease classification</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" equal-contrib="yes">
<name>
<surname>Ying</surname>
<given-names>Yuhan</given-names>
</name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<xref ref-type="author-notes" rid="fn0001"><sup>&#x2020;</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/2617007/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
</contrib>
<contrib contrib-type="author" equal-contrib="yes">
<name>
<surname>Huang</surname>
<given-names>Xin</given-names>
</name>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<xref ref-type="author-notes" rid="fn0001"><sup>&#x2020;</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Song</surname>
<given-names>Guoli</given-names>
</name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhao</surname>
<given-names>Yiwen</given-names>
</name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhao</surname>
<given-names>XinGang</given-names>
</name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/416009/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Shi</surname>
<given-names>Lin</given-names>
</name>
<xref ref-type="aff" rid="aff5"><sup>5</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/1488051/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Gao</surname>
<given-names>Ziqi</given-names>
</name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/2618889/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Li</surname>
<given-names>Andi</given-names>
</name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/2428022/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Gao</surname>
<given-names>Tian</given-names>
</name>
<xref ref-type="aff" rid="aff6"><sup>6</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Lu</surname>
<given-names>Hua</given-names>
</name>
<xref ref-type="aff" rid="aff7"><sup>7</sup></xref>
<xref ref-type="corresp" rid="c002"><sup>&#x002A;</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Fan</surname>
<given-names>Guoguang</given-names>
</name>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x002A;</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/521321/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>State Key Laboratory of Robotics, Shenyang Institute of Automation, Chinese Academy of Sciences</institution>, <addr-line>Shenyang</addr-line>, <country>China</country></aff>
<aff id="aff2"><sup>2</sup><institution>Institutes for Robotics and Intelligent Manufacturing, Chinese Academy of Sciences</institution>, <addr-line>Shenyang</addr-line>, <country>China</country></aff>
<aff id="aff3"><sup>3</sup><institution>University of Chinese Academy of Sciences</institution>, <addr-line>Beiing</addr-line>, <country>China</country></aff>
<aff id="aff4"><sup>4</sup><institution>Department of Radiology, The First Hospital of China Medical University</institution>, <addr-line>Shenyang</addr-line>, <country>China</country></aff>
<aff id="aff5"><sup>5</sup><institution>Department of Neurosurgery, Beijing Tiantan Hospital, Capital Medical University</institution>, <addr-line>Beijing</addr-line>, <country>China</country></aff>
<aff id="aff6"><sup>6</sup><institution>Shenyang Ligong University</institution>, <addr-line>Shenyang</addr-line>, <country>China</country></aff>
<aff id="aff7"><sup>7</sup><institution>Department of Neurosurgery, Affiliated Hospital of Jiangnan University</institution>, <addr-line>Wuxi</addr-line>, <country>China</country></aff>
<author-notes>
<fn fn-type="edited-by" id="fn0002"><p>Edited by: Ningbo Yu, Nankai University, China</p></fn>
<fn fn-type="edited-by" id="fn0003"><p>Reviewed by: Xufeng Yao, University of Shanghai for Science and Technology, China</p><p>Changcheng Shi, Ningbo Institute of Materials Technology and Engineering (CAS), China</p></fn>
<corresp id="c001">&#x002A;Correspondence: Guoguang Fan, <email>fanguog@sina.com</email></corresp>
<corresp id="c002">Hua Lu, <email>luhua1969@hotmail.com</email></corresp>
<fn fn-type="equal" id="fn0001"><p><sup>&#x2020;</sup>These authors have contributed equally to this work and share first authorship</p></fn>
</author-notes>
<pub-date pub-type="epub">
<day>29</day>
<month>02</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>18</volume>
<elocation-id>1364338</elocation-id>
<history>
<date date-type="received">
<day>02</day>
<month>01</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>16</day>
<month>02</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x00A9; 2024 Ying, Huang, Song, Zhao, Zhao, Shi, Gao, Li, Gao, Lu and Fan.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Ying, Huang, Song, Zhao, Zhao, Shi, Gao, Li, Gao, Lu and Fan</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>In clinical practice and research, the classification and diagnosis of neurological diseases such as Parkinson&#x2019;s Disease (PD) and Multiple System Atrophy (MSA) have long posed a significant challenge. Currently, deep learning, as a cutting-edge technology, has demonstrated immense potential in computer-aided diagnosis of PD and MSA. However, existing methods rely heavily on manually selecting key feature slices and segmenting regions of interest. This not only increases subjectivity and complexity in the classification process but also limits the model&#x2019;s comprehensive analysis of global data features. To address this issue, this paper proposes a novel 3D context-aware modeling framework, named 3D-CAM. It considers 3D contextual information based on an attention mechanism. The framework, utilizing a 2D slicing-based strategy, innovatively integrates a Contextual Information Module and a Location Filtering Module. The Contextual Information Module can be applied to feature maps at any layer, effectively combining features from adjacent slices and utilizing an attention mechanism to focus on crucial features. The Location Filtering Module, on the other hand, is employed in the post-processing phase to filter significant slice segments of classification features. By employing this method in the fully automated classification of PD and MSA, an accuracy of 85.71%, a recall rate of 86.36%, and a precision of 90.48% were achieved. These results not only demonstrates potential for clinical applications, but also provides a novel perspective for medical image diagnosis, thereby offering robust support for accurate diagnosis of neurological diseases.</p>
</abstract>
<kwd-group>
<kwd>medical image analysis</kwd>
<kwd>computer-aided diagnosis</kwd>
<kwd>deep learning</kwd>
<kwd>Parkinson&#x2019;s disease</kwd>
<kwd>multiple system atrophy</kwd>
<kwd>regional Homogeneity</kwd>
<kwd>general feature extraction network</kwd>
</kwd-group>
<counts>
<fig-count count="3"/>
<table-count count="3"/>
<equation-count count="14"/>
<ref-count count="26"/>
<page-count count="9"/>
<word-count count="6629"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Neuroprosthetics</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="sec1">
<label>1</label>
<title>Introduction</title>
<p>In clinical practice, Parkinson&#x2019;s Disease (PD) and Multiple System Atrophy (MSA) are two neurodegenerative diseases. Despite their obvious differences in prognosis, treatment, and pathologic features, they are extremely similar in early symptoms (<xref ref-type="bibr" rid="ref14">Palma et al., 2018</xref>). This poses a great challenge for doctors in their diagnosis (<xref ref-type="bibr" rid="ref20">Song et al., 2007</xref>; <xref ref-type="bibr" rid="ref1">Antonini, 2010</xref>). Parkinson&#x2019;s disease has a high degree of heterogeneity, with different clinical subtypes, which makes diagnosis difficult (<xref ref-type="bibr" rid="ref25">Wullner et al., 2023</xref>). According to statistics, the misdiagnosis rate of early-stage Parkinson&#x2019;s disease can be as high as 20&#x2013;30% (<xref ref-type="bibr" rid="ref17">Poewe and Wenning, 2002</xref>). Misdiagnosis can potentially lead to doctors providing patients with incorrect treatment plans, resulting in disease progression and even irreversible neurological damage. Therefore, it is evident that diagnostic methods that rely solely on the personal experience of physicians may not be sufficiently reliable. As a result, there is an urgent need for a scientifically validated auxiliary diagnostic approaches to assist doctors in making diagnoses.</p>
<p>In recent years, with the development of medical imaging technology, many studies have been conducted to differentiate PD and MSA using advanced medical imaging. Among them, machine learning-based methods for extracting medical image features have shown promising results. For example, <xref ref-type="bibr" rid="ref5">Chen et al. (2017</xref>, <xref ref-type="bibr" rid="ref4">2023)</xref> explored the differences in brain functional connectivity patterns between patients with PD and MSA, provided a diagnostic tool for PD and MSA using machine learning methods. <xref ref-type="bibr" rid="ref16">Pang et al. (2020)</xref> extracted radiomics features on Susceptibility-weighted-imaging using machine learning methods for differential diagnosis of PD and MSA. <xref ref-type="bibr" rid="ref12">Kim et al. (2022)</xref> constructed a machine learning model to extract radiological features using medical images, successfully differentiating various types of Parkinsonian syndromes. <xref ref-type="bibr" rid="ref2">Bu et al. (2023)</xref> utilized different kinds of medical images to build a radiological model based on machine learning to differentiate PD from MSA. Although the above methods have shown good results in the diagnosis of PD and MSA, they all rely on manually selecting key feature slices and segmenting regions of interest. In addition, the features extracted by machine learning methods are filtered from a fixed set, which also presents limitations.</p>
<p>Currently, deep learning, as a cutting-edge technology of machine learning, shows great potential in the field of computer-aided diagnosis (<xref ref-type="bibr" rid="ref7">Greenspan et al., 2016</xref>) and has made remarkable achievements in many aspects such as medical image analysis, pathology diagnosis and clinical decision support (<xref ref-type="bibr" rid="ref13">Litjens et al., 2017</xref>; <xref ref-type="bibr" rid="ref15">Panayides et al., 2020</xref>; <xref ref-type="bibr" rid="ref19">Rehman et al., 2021</xref>). Some scholars have started applying deep learning techniques to studies on PD or MSA (<xref ref-type="bibr" rid="ref27">Zhao et al., 2019</xref>; <xref ref-type="bibr" rid="ref11">Jyotiyana et al., 2022</xref>; <xref ref-type="bibr" rid="ref24">Wu et al., 2022</xref>). Among them, for the specific task of PD and MSA classification, some scholars have achieved considerable results by applying deep learning methods based on medical images. For example, <xref ref-type="bibr" rid="ref10">Huseyn (2020)</xref> utilized Magnetic Resonance Imaging (MRI) with an improved AlexNet network structure to diagnose Parkinson&#x2019;s disease, multiple system atrophy, and healthy individuals. <xref ref-type="bibr" rid="ref18">Rau et al. (2023)</xref> proposed a deep learning algorithm capable of precisely segmenting the nucleus and shell, applying it to the diagnosis of PD and MSA. Compared to the aforementioned machine learning algorithms, although the features extracted by these methods are no longer limited to a fixed set of features, they still need to rely on manually selecting key feature slices and segmenting regions of interest, which does not allow for fully automated classification and diagnosis of diseases.</p>
<p>Therefore, we urgently need to develop a fully automatic classification model that can achieve classification diagnosis of PD and MSA without the need for manually selecting key feature slices and segmenting regions of interest. This approach would allow the model to comprehensively utilize data from the entire brain, enabling a comprehensive analysis of lesion features across various brain regions, thereby providing more reliable support for accurate diagnosis. In this study, we propose a novel 3D context-aware modeling framework called 3D-CAM. It allows a suitable convolutional neural network to be freely selected and embedded according to the dataset features in order to construct a classification model. The framework employs a 2D slicing-based strategy to process 3D Regional homogeneity (ReHo) data from brain Blood Oxygenation Level Dependent (BOLD) sequences (<xref ref-type="bibr" rid="ref26">Zang et al., 2004</xref>). It segments the data into multiple 2D slices and uses them to train the classification model. The framework integrates two innovative modules: the Contextual Information Module and the Location Filtering Module. The Contextual Information Module is a feature enhancement module that can be inserted into any feature layer. It not only introduces features of adjacent slices, but also utilizes an attention mechanism to analyze the feature similarity between adjacent slices, enhancing focus on crucial features. This step effectively complements the inadequacy of 2D classification models in handling spatial information and contextual relationships. The Location Filtering Module is a post-processing module that not only leverages the 2D slice information to enable the model to concentrate on the slice segments with key features, but also analyzes and integrates the 2D slice information into the final 3D classification results. This step contributes to enhancing the model&#x2019;s classification performance and enables it to identify key features more accurately.</p>
<p>The main contributions of this paper are as follows:</p>
<list list-type="bullet">
<list-item><p>A feature extraction framework called 3D-CAM is proposed for neurological disease classification. The framework achieves automatic classification with significant results in the classification tasks of PD and MSA.</p></list-item>
<list-item><p>We propose a Contextual Information Module that can fuse the features of adjacent slices in any feature layer, enabling the network to emphasize key features and capture the spatial correlation between slices.</p></list-item>
<list-item><p>We propose a Location Filtering Module that accurately concentrates on slice segments with key features, effectively enhancing the model&#x2019;s classification performance by analyzing and integrating 2D slice information into 3D classification results.</p></list-item>
</list>
</sec>
<sec sec-type="materials|methods" id="sec2">
<label>2</label>
<title>Materials and methods</title>
<sec id="sec3">
<label>2.1</label>
<title>Dataset and preprocessing</title>
<p>The dataset for this study was obtained from the Neurology Outpatient Department of the First Hospital of China Medical University, covering patient data from July 2020 to August 2023.</p>
<p>For data acquisition, a 3.0&#x2009;T MRI scanner outfitted with a 32-channel head coil was employed to acquire high-resolution T1 weighted MRI sequence and BOLD sequences in accordance with standardized scanning protocols. Subsequently, these sequences underwent processing to derive ReHo data. All processing procedures were executed using the Data Processing &#x0026; Analysis of Brain Imaging (DPABI, RRID:SCR_010501), encompassing artifact removal, motion correction, temporal adjustments, and spatial normalization, as documented in pertinent literature (<xref ref-type="bibr" rid="ref3">ChaoGan and YuFeng, 2010</xref>). Rigorous data quality assurance measures were undertaken, including meticulous data cleansing with manual exclusion of motion exceeding 3&#x2009;mm, to ensure the integrity of the dataset.</p>
<p>Finally, we successfully obtained ReHo data from 189 patients, including 105 PD cases and 84 MSA cases. To ensure the effectiveness of model training, tuning, and evaluation, we divided these datasets into training set, validation set, and testing set according to the ratio of 7:1:2. Detailed sample information is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p>
<fig position="float" id="fig1">
<label>Figure 1</label>
<caption>
<p>Example of ReHo data slices for PD patients and MSA patients.</p>
</caption>
<graphic xlink:href="fnins-18-1364338-g001.tif"/>
</fig>
</sec>
<sec id="sec4">
<label>2.2</label>
<title>Experimental setup and evaluation criteria</title>
<sec id="sec5">
<label>2.2.1</label>
<title>Implementation</title>
<p>The classification models in this paper are programmed using Python and Pytorch. We performed all experiments on a personal workstation with an Nvidia GeForce RTX 3080 GPU. For the optimizer, we chose a learning rate of 0.0001, a weight decay of 0.0001, and used a stochastic gradient descent algorithm with a momentum of 0.9. The batch size for training was set to 32. In addition, we chose the cross-entropy loss function during the training process. This loss function is widely used in classification problems and can effectively measure the difference between the model output and the real labels, which helps to optimize the network parameters to improve the classification accuracy.</p>
</sec>
<sec id="sec6">
<label>2.2.2</label>
<title>Evaluation criteria</title>
<p>In evaluating the network&#x2019;s classification performance, various evaluation metrics were introduced, including accuracy, precision, and recall. These indices are defined by <xref ref-type="disp-formula" rid="EQ1 EQ2 EQ3">Equations (1)&#x2013;(3)</xref>. Where TP, FN, FP and TN represent correctly classified positive samples, misclassified positive samples, misclassified negative samples and correctly classified negative samples, respectively. In this paper, positive samples are PD patient data and negative samples are MSA patient data.</p>
<disp-formula id="EQ1"><label>(1)</label><mml:math id="M1"><mml:mi mathvariant="italic">Accuracy</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn><mml:mo>%</mml:mo></mml:math></disp-formula>
<disp-formula id="EQ2"><label>(2)</label><mml:math id="M2"><mml:mi mathvariant="italic">Recall</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn><mml:mo>%</mml:mo></mml:math></disp-formula>
<disp-formula id="EQ3"><label>(3)</label><mml:math id="M3"><mml:mi mathvariant="italic">Precision</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn><mml:mo>%</mml:mo></mml:math></disp-formula>
<p>In addition, we introduce the Receiver Operating Characteristic (ROC) curve and the Area Under the Curve (AUC). The ROC curve is a curve plotted with the True Positive Rate (TPR) as the vertical coordinate and the False Positive Rate (FPR) as the horizontal coordinate at different thresholds. The AUC value is the area under the ROC curve, which is used as a measure of the quality of the classifier&#x2019;s prediction. The closer the AUC value is to 1, the better the performance of the classifier. In order to verify the robustness and generalization ability of the model, several experiments were conducted and the results were statistically analyzed and compared.</p>
</sec>
</sec>
<sec id="sec7">
<label>2.3</label>
<title>Methodology</title>
<sec id="sec8">
<label>2.3.1</label>
<title>Overall framework</title>
<p>In this work, we propose a novel deep learning-based framework for 3D medical image classification, named 3D-CAM. The framework of 3D-CAM is illustrated in <xref ref-type="fig" rid="fig2">Figure 2</xref>. 3D-CAM employs a 2D slicing-based strategy to slice the 3D ReHo data into multiple 2D slices for putting into the network. Unlike traditional training methods, we incorporate several adjacent slices surrounding the current slice as inputs to the network. 3D-CAM can be divided into two main stages as follows.</p>
<fig position="float" id="fig2">
<label>Figure 2</label>
<caption>
<p>Network architecture of 3D-CAM. The upper part depicts the overall structure of 3D-CAM, including the specific configuration of the Location Filtering Module. The lower part depicts the detailed structure of the Contextual Information Module.</p>
</caption>
<graphic xlink:href="fnins-18-1364338-g002.tif"/>
</fig>
<p>In the first stage, we freely choose a suitable convolutional network, such as ResNet (<xref ref-type="bibr" rid="ref8">He et al., 2016</xref>), and embed it into the 3D-CAM framework. As the convolutional network extracts features from the current slice layer by layer, it also simultaneously extracts features from adjacent slices. During the feature extraction process, we introduce a Contextual Information Module at an optimal location. This module can simultaneously receive feature maps of the current slice and its adjacent slices as inputs, thereby achieving the effect of introducing contextual information. In order to make the network focused on overall features and capture the spatial correlation between slices, we introduce attention mechanism in this module. By analyzing the similarity between the features of the current slice and its adjacent slices, we reassign weights to different features for feature enhancement. Afterwards, the enhanced features are further processed by convolutional networks to obtain the prediction results of 2D slices.</p>
<p>In the second stage, we introduce a Location Filtering Module to enhance the classification performance and integrate the 2D classification information into 3D classification results. This module is designed to filter the sliced segments with more significant classification features. In this step, we categorize all the 2D slice data used for training by location and compute the prediction accuracies of the slices with different locations in validation set. Based on this analysis, we filter out the consecutive slices with high prediction accuracy as the key prediction segments of the sample. Following this, we apply a voting mechanism to integrate the prediction results of each 2D slice within the segment to obtain 3D prediction results. This process aims to optimize and accurately extract segments with significant classification features serving as the basis for 3D classification.</p>
</sec>
<sec id="sec9">
<label>2.3.2</label>
<title>Contextual information module</title>
<p>When a 2D slicing-based strategy is used to process 3D data, the connection between different 2D slices is usually ignored, which leads to the loss of some spatial information. Therefore, to comprehensively capture data features and conduct a holistic analysis, we propose a Contextual Information Module, depicted in specific structure as illustrated in <xref ref-type="fig" rid="fig2">Figure 2</xref>.</p>
<p>When inserting a Contextual Information Module at the <inline-formula><mml:math id="M4"><mml:mi>l</mml:mi></mml:math></inline-formula>th layer of a neural network with a depth of <inline-formula><mml:math id="M5"><mml:mi>L</mml:mi></mml:math></inline-formula> to extract features, each input slice, following the initial <inline-formula><mml:math id="M6"><mml:mi>l</mml:mi></mml:math></inline-formula> layers of the neural network, generates a collection of feature maps denoted as (<xref ref-type="disp-formula" rid="EQ4">4</xref>). <inline-formula><mml:math id="M8"><mml:msubsup><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> denotes the set of feature maps obtained by extracting the <inline-formula><mml:math id="M9"><mml:mi>i</mml:mi></mml:math></inline-formula>th input slice in the <inline-formula><mml:math id="M10"><mml:mi>l</mml:mi></mml:math></inline-formula>th layer of the neural network. <inline-formula><mml:math id="M11"><mml:mi>N</mml:mi></mml:math></inline-formula> denotes the number of feature maps in the <inline-formula><mml:math id="M12"><mml:mi>l</mml:mi></mml:math></inline-formula>th layer, and <inline-formula><mml:math id="M13"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> denotes the <inline-formula><mml:math id="M14"><mml:mi>j</mml:mi></mml:math></inline-formula>th feature map extracted from the <inline-formula><mml:math id="M15"><mml:mi>i</mml:mi></mml:math></inline-formula>th input slice after passing through <inline-formula><mml:math id="M16"><mml:mi>l</mml:mi></mml:math></inline-formula> layers of the neural network.</p>
<disp-formula id="EQ4"><label>(4)</label><mml:math id="M17"><mml:msubsup><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>=</mml:mo><mml:mfenced open="{" close="}" separators=",,,"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>&#x2026;</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:mfenced></mml:math></disp-formula>
<p>When the network acquires <inline-formula><mml:math id="M18"><mml:msubsup><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula>, its adjacent slices features <inline-formula><mml:math id="M19"><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M20"><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> are also acquired at the same time and stored in the contextual feature module.</p>
<p>Next, to enhance the neural network&#x2019;s attention to the overall features as well as to capture the spatial correlation between slices, we introduce attention mechanism. We compute the similarity between the feature map <inline-formula><mml:math id="M21"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> obtained from the current slice and the feature maps <inline-formula><mml:math id="M22"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M23"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> of its adjacent slices. The Structural Similarity Index (SSIM) (<xref ref-type="bibr" rid="ref23">Wang et al., 2004</xref>) is used here as a similarity measure. SSIM is an effective image similarity metric and its computation includes the consideration of statistics such as mean, variance and covariance. The SSIM formula (<xref ref-type="disp-formula" rid="EQ5">5</xref>) for calculating the similarity between two feature maps <italic>A</italic> and <italic>B</italic> is as follows:</p>
<disp-formula id="EQ5"><label>(5)</label><mml:math id="M24"><mml:mi mathvariant="normal">SSIM</mml:mi><mml:mfenced open="(" close=")" separators=","><mml:mi>A</mml:mi><mml:mi>B</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mfenced open="(" close=")"><mml:mrow><mml:mn>2</mml:mn><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mi>B</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:mn>2</mml:mn><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mi mathvariant="italic">AB</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:mfenced open="(" close=")"><mml:mrow><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mi>A</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mi>B</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mfenced open="(" close=")"><mml:mrow><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>A</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>B</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfrac></mml:math></disp-formula>
<p>In this formula, <inline-formula><mml:math id="M25"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math id="M26"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:math></inline-formula> denote the pixel mean values of feature maps <inline-formula><mml:math id="M27"><mml:mi>A</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M28"><mml:mi>B</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M29"><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mi>A</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M30"><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mi>B</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:math></inline-formula>denote their respective pixel variances, <inline-formula><mml:math id="M31"><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mi mathvariant="italic">AB</mml:mi></mml:msub></mml:math></inline-formula> is their pixel covariance, and <inline-formula><mml:math id="M32"><mml:msub><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math id="M33"><mml:msub><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula> are constants introduced for stability.</p>
<p>Based on the aforementioned SSIM formula, we define the weight (<xref ref-type="disp-formula" rid="EQ6">6</xref>) as the average value of the similarity between the feature map <inline-formula><mml:math id="M35"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> and its adjacent slices of the feature maps <inline-formula><mml:math id="M36"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula>, <inline-formula><mml:math id="M37"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula>. The formula for this weight is as follows:</p>
<disp-formula id="EQ6"><label>(6)</label><mml:math id="M38"><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">SSIM</mml:mi><mml:mfenced open="(" close=")" separators=","><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:mfenced><mml:mo>+</mml:mo><mml:mi mathvariant="normal">SSIM</mml:mi><mml:mfenced open="(" close=")" separators=","><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:mfenced></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:math></disp-formula>
<p>In this formula, <inline-formula><mml:math id="M39"><mml:mi mathvariant="normal">SSIM</mml:mi><mml:mfenced open="(" close=")" separators=","><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:mfenced></mml:math></inline-formula> denotes the similarity between feature maps <inline-formula><mml:math id="M40"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M41"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula>, while <inline-formula><mml:math id="M42"><mml:mi mathvariant="normal">SSIM</mml:mi><mml:mfenced open="(" close=")" separators=","><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:mfenced></mml:math></inline-formula> denotes the similarity between feature maps <inline-formula><mml:math id="M43"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M44"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula>. The introduction of such weights aims to make the network paying more attention to the consistency of overall features while capturing spatial correlations between slices.</p>
<p>In order to better capture the correlation between feature maps, we specially design a neural network (<xref ref-type="disp-formula" rid="EQ7">7</xref>, <xref ref-type="disp-formula" rid="EQ8">8</xref>) structure to dynamically adjust the original weight <inline-formula><mml:math id="M45"><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula>. This structure comprises two linear layers and two activation functions. Here, <inline-formula><mml:math id="M46"><mml:msub><mml:mi>W</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math id="M47"><mml:msub><mml:mi>b</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> denote the weight matrix and bias terms of the first linear layer, and <inline-formula><mml:math id="M48"><mml:mi mathvariant="normal">ReLU</mml:mi></mml:math></inline-formula> denotes the activation function of the first layer. <inline-formula><mml:math id="M49"><mml:msub><mml:mi>W</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math id="M50"><mml:msub><mml:mi>b</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula> denote the weight matrix and bias terms of the second linear layer, and <inline-formula><mml:math id="M51"><mml:mi mathvariant="normal">Sigmoid</mml:mi></mml:math></inline-formula> denotes the activation function of the second layer. The formulas are as follows:</p>
<disp-formula id="EQ7"><label>(7)</label><mml:math id="M52"><mml:msubsup><mml:mi>h</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>=</mml:mo><mml:mi mathvariant="normal">ReLU</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>.</mml:mo><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mfenced></mml:math></disp-formula>
<disp-formula id="EQ8"><label>(8)</label><mml:math id="M53"><mml:msup><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>=</mml:mo><mml:mi mathvariant="normal">Sigmoid</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi>h</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mfenced></mml:math></disp-formula>
<p>Then, applying the adjusted weight <inline-formula><mml:math id="M54"><mml:msup><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> to the original feature map, the weighted feature map <xref ref-type="disp-formula" rid="EQ7">(9)</xref> can be obtained.</p>
<disp-formula id="EQ9"><label>(9)</label><mml:math id="M56"><mml:msubsup><mml:mover><mml:mi>f</mml:mi><mml:mo>&#x0302;</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>=</mml:mo><mml:msup><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></disp-formula>
<p>After that, each feature map in <inline-formula><mml:math id="M57"><mml:msubsup><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> is weighted based on the previously mentioned steps to form a new set (<xref ref-type="disp-formula" rid="EQ10">10</xref>) of feature maps:</p>
<disp-formula id="EQ10"><label>(10)</label><mml:math id="M59"><mml:msubsup><mml:mover><mml:mi>F</mml:mi><mml:mo>&#x0302;</mml:mo></mml:mover><mml:mi>i</mml:mi><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>=</mml:mo><mml:mfenced open="{" close="}" separators=",,,"><mml:msubsup><mml:mover><mml:mi>f</mml:mi><mml:mo>&#x0302;</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:msubsup><mml:mover><mml:mi>f</mml:mi><mml:mo>&#x0302;</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>&#x2026;</mml:mo><mml:msubsup><mml:mover><mml:mi>f</mml:mi><mml:mo>&#x0302;</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:mfenced></mml:math></disp-formula>
<p>By introducing the attention mechanism, we adjust the weight of each feature map. The new set of feature maps <inline-formula><mml:math id="M60"><mml:msubsup><mml:mover><mml:mi>F</mml:mi><mml:mo>&#x0302;</mml:mo></mml:mover><mml:mi>i</mml:mi><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> contains more spatially relevant and globally consistent features. It is conducive to better integrating spatial information into the feature extraction process, improving the perceptual ability and performance of the network.</p>
<p>In order to better incorporate the spatial information into the feature extraction network, we embed the feature maps <inline-formula><mml:math id="M61"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M62"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> of adjacent slices together into the network, so as to comprehensively considering the contribution of adjacent slices features to the current features. We use weights &#x03B1;, &#x03B2; to perform weighted summation on the feature map sets <inline-formula><mml:math id="M65"><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula>, <inline-formula><mml:math id="M66"><mml:msubsup><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M67"><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> to obtain the final feature (<xref ref-type="disp-formula" rid="EQ12">11</xref>) after enhancement, where &#x03B1; is a smaller weight than &#x03B2; to emphasize the importance of the current slice. The formula of <inline-formula><mml:math id="M69"><mml:msubsup><mml:mi>W</mml:mi><mml:mi>i</mml:mi><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></inline-formula> is:</p>
<disp-formula id="EQ12"><label>(11)</label><mml:math id="M70"><mml:msubsup><mml:mi>W</mml:mi><mml:mi>i</mml:mi><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mfenced open="(" close=")"><mml:mi>l</mml:mi></mml:mfenced></mml:msubsup></mml:math></disp-formula>
<p>This approach efficiently integrates the features of adjacent slices into the current feature maps, enhancing the capacity for global information representation of features.</p>
<p>After processing in the Contextual Information Module, we obtain a set of enhanced feature maps. These feature maps contain more spatial information and help the network to focus more on overall feature consistency while taking into account the importance of different features. Using similarity information to enhance the perception of spatial correlation can improve the feature representation capability of the network.</p>
</sec>
<sec id="sec10">
<label>2.3.3</label>
<title>Location filtering module</title>
<p>In order to improve the classification performance and integrate the 2D classification information into 3D classification results, this paper introduces a Location Filtering Module. In many 3D medical datasets, such as the dataset used in this paper, the slices at both ends usually contain less image information. Therefore, we want to filter the slice segments with more significant classification features located in the center location and vote them as key slice segments to obtain more accurate classification results.</p>
<p>First, we calculated the prediction accuracies of slices at different locations in the validation set. Let the number of 2D slices for each sample be <inline-formula><mml:math id="M71"><mml:mi>N</mml:mi></mml:math></inline-formula> and the location number be <inline-formula><mml:math id="M72"><mml:mi>i</mml:mi></mml:math></inline-formula> (from 1 to <inline-formula><mml:math id="M73"><mml:mi>N</mml:mi></mml:math></inline-formula>). The accuracy of each location <inline-formula><mml:math id="M74"><mml:mi>i</mml:mi></mml:math></inline-formula> is <inline-formula><mml:math id="M75"><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> (<xref ref-type="disp-formula" rid="EQ13">12</xref>). Here, <inline-formula><mml:math id="M76"><mml:mi mathvariant="italic">Correc</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> denotes the number of correctly predicted samples at location <inline-formula><mml:math id="M77"><mml:mi>i</mml:mi></mml:math></inline-formula>, and <inline-formula><mml:math id="M78"><mml:mi mathvariant="italic">Tota</mml:mi><mml:msub><mml:mi>l</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> denotes the total number of samples at location <inline-formula><mml:math id="M79"><mml:mi>i</mml:mi></mml:math></inline-formula>.</p>
<disp-formula id="EQ13"><label>(12)</label><mml:math id="M80"><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="italic">Correc</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="italic">Tota</mml:mi><mml:msub><mml:mi>l</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn><mml:mo>%</mml:mo></mml:math></disp-formula>
<p>Next, we aim to find a contiguous segment among all possible slice segments where the average accuracy within that segment exceeds the threshold <inline-formula><mml:math id="M81"><mml:mi>T</mml:mi></mml:math></inline-formula>. Additionally, this segment should be the longest among all possible segments, in order to retain as much information as possible while maintaining a high level of accuracy. This selected segment can be considered as the key slice segment and will be involved in subsequent voting and analyses. The formula to find this segment (<xref ref-type="disp-formula" rid="EQ14">13</xref>) is shown below:</p>
<disp-formula id="EQ14"><label>(13)</label><mml:math id="M82"><mml:mfenced open="(" close=")" separators=","><mml:mi>S</mml:mi><mml:mi>L</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="normal">argmax</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mfenced open="(" close=")"><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x00B7;</mml:mo><mml:mn>1</mml:mn><mml:mfenced open="(" close=")"><mml:mrow><mml:munderover><mml:mstyle displaystyle="true"><mml:mo stretchy="true">&#x2211;</mml:mo></mml:mstyle><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>+</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>&#x003E;</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x00B7;</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced></mml:math></disp-formula>
<p>In this equation, <inline-formula><mml:math id="M83"><mml:mi>j</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M84"><mml:mi>k</mml:mi></mml:math></inline-formula> are parameters used to search for the longest segment. <inline-formula><mml:math id="M85"><mml:mi>j</mml:mi></mml:math></inline-formula> represents the starting position, while <inline-formula><mml:math id="M86"><mml:mi>k</mml:mi></mml:math></inline-formula> represents the length of the segment. <inline-formula><mml:math id="M87"><mml:mn>1</mml:mn><mml:mfenced open="(" close=")"><mml:mo>&#x00B7;</mml:mo></mml:mfenced></mml:math></inline-formula> is an indicator function that returns 1 if <inline-formula><mml:math id="M88"><mml:munderover><mml:mstyle displaystyle="true"><mml:mo stretchy="true">&#x2211;</mml:mo></mml:mstyle><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>+</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>&#x003E;</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x00B7;</mml:mo><mml:mi>T</mml:mi></mml:math></inline-formula> and 0 otherwise. Through this step, we finally identify the region of interest with a starting position <inline-formula><mml:math id="M89"><mml:mi>S</mml:mi></mml:math></inline-formula> and length <inline-formula><mml:math id="M90"><mml:mi>L</mml:mi></mml:math></inline-formula> with high prediction accuracy and use it as the key prediction segment.</p>
<p>Next, we adopt a voting mechanism to integrate the prediction results of each 2D slice located at the key slice segment aforementioned (<xref ref-type="disp-formula" rid="EQ15">14</xref>). The specific formula is as follows:</p>
<disp-formula id="EQ15"><label>(14)</label><mml:math id="M91"><mml:mi>P</mml:mi><mml:mfenced open="(" close=")"><mml:mi>c</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:msup><mml:mi>N</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mfrac><mml:munderover><mml:mstyle displaystyle="true"><mml:mo stretchy="true">&#x2211;</mml:mo></mml:mstyle><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:msup><mml:mi>N</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:munderover><mml:mn>1</mml:mn><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>c</mml:mi></mml:mrow></mml:mfenced></mml:math></disp-formula>
<p>In this equation, <inline-formula><mml:math id="M92"><mml:mi>P</mml:mi><mml:mfenced open="(" close=")"><mml:mi>c</mml:mi></mml:mfenced></mml:math></inline-formula> denotes the probability that the final weighted voting prediction result is class <inline-formula><mml:math id="M93"><mml:mi>c</mml:mi></mml:math></inline-formula>. <inline-formula><mml:math id="M94"><mml:msup><mml:mi>N</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> denotes the total number of filtered slices in the key slice segment. <inline-formula><mml:math id="M95"><mml:mn>1</mml:mn><mml:mfenced open="(" close=")"><mml:mo>&#x00B7;</mml:mo></mml:mfenced></mml:math></inline-formula> is an indicator function, which indicates 1 when <inline-formula><mml:math id="M96"><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>c</mml:mi></mml:math></inline-formula>, and 0 otherwise. <inline-formula><mml:math id="M97"><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> denotes the prediction category of the <inline-formula><mml:math id="M98"><mml:mi>i</mml:mi></mml:math></inline-formula>th slice. Finally, 3D prediction results can be obtained based on the prediction probability <inline-formula><mml:math id="M99"><mml:mi>P</mml:mi><mml:mfenced open="(" close=")"><mml:mi>c</mml:mi></mml:mfenced></mml:math></inline-formula>.</p>
</sec>
</sec>
</sec>
<sec sec-type="results" id="sec11">
<label>3</label>
<title>Results</title>
<p>In order to verify the reliability of the proposed method in this paper and to propose new methods for automatic diagnosis of PD and MSA, we conducted the following experiments.</p>
<sec id="sec12">
<label>3.1</label>
<title>Model selection and performance comparison</title>
<p>We applied our proposed innovative framework, 3D-CAM, to the classification tasks of PD and MSA. Specifically, we applied the two innovative modules, the Contextual Information Module and the Location Filtering Module, to specific layers of the classical model in order to enhance its performance. To ensure consistency, we inserted the Contextual Information Module in the layers corresponding to the 32&#x2009;&#x00D7;&#x2009;32 feature maps of each model. Additionally, we have investigated several families of classical convolutional neural network models, including EfficientNet (<xref ref-type="bibr" rid="ref22">Tan and Le, 2020</xref>), DenseNet (<xref ref-type="bibr" rid="ref9">Huang et al., 2018</xref>), ResNet (<xref ref-type="bibr" rid="ref8">He et al., 2016</xref>), and Inception (<xref ref-type="bibr" rid="ref21">Szegedy et al., 2015</xref>) as backbones. In order to identify the model with the best performance in our task, we compared multiple versions in each model family. Finally, we selected the best-performing model from each family for further analysis. The experimental results are detailed in <xref ref-type="table" rid="tab1">Table 1</xref>.</p>
<table-wrap position="float" id="tab1">
<label>Table 1</label>
<caption>
<p>Comparative experimental results of different models.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Model</th>
<th align="center" valign="top">Accuracy</th>
<th align="center" valign="top">Recall</th>
<th align="center" valign="top">Precision</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="top">Inception</td>
<td align="center" valign="top">65.71%</td>
<td align="center" valign="top">68.18%</td>
<td align="center" valign="top">75.00%</td>
</tr>
<tr>
<td align="left" valign="top">Inception +3D-CAM</td>
<td align="center" valign="top">77.14%</td>
<td align="center" valign="top">77.27%</td>
<td align="center" valign="top">85.00%</td>
</tr>
<tr>
<td align="left" valign="top">DenseNet</td>
<td align="center" valign="top">68.57%</td>
<td align="center" valign="top">72.73%</td>
<td align="center" valign="top">76.19%</td>
</tr>
<tr>
<td align="left" valign="top">DenseNet +3D-CAM</td>
<td align="center" valign="top">80.00%</td>
<td align="center" valign="top">81.82%</td>
<td align="center" valign="top">85.71%</td>
</tr>
<tr>
<td align="left" valign="top">EfficientNet</td>
<td align="center" valign="top">71.72%</td>
<td align="center" valign="top">68.18%</td>
<td align="center" valign="top">83.33%</td>
</tr>
<tr>
<td align="left" valign="top">EfficientNet +3D-CAM</td>
<td align="center" valign="top">82.86%</td>
<td align="center" valign="top">86.36%</td>
<td align="center" valign="top">86.36%</td>
</tr>
<tr>
<td align="left" valign="top">ResNet</td>
<td align="center" valign="top">71.42%</td>
<td align="center" valign="top">72.73%</td>
<td align="center" valign="top">80.00%</td>
</tr>
<tr>
<td align="left" valign="top"><bold>ResNet&#x2009;+&#x2009;3D-CAM</bold></td>
<td align="center" valign="top"><bold>85.71%</bold></td>
<td align="center" valign="top"><bold>86.36%</bold></td>
<td align="center" valign="top"><bold>90.48%</bold></td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>The best-performing results are highlighted in bold.</p>
</table-wrap-foot>
</table-wrap>
<p>In our experiments, we observe that different feature extraction networks can be embedded into 3D-CAM, while all of them show different degrees of improvement in classification accuracy. We also find that for our task, ResNet34-based 3D-CAM shows the best performance with 85.71% accuracy on the test set.</p>
</sec>
<sec id="sec13">
<label>3.2</label>
<title>Ablation experiments</title>
<p>To verify the effect of our proposed two modules on the model performance, we conducted ablation experiments. On the currently best-performing model, we gradually removed these two modules and obtained two sets of ablation experimental results, as detailed in <xref ref-type="table" rid="tab2">Table 2</xref>. Here, Module 1 represents the Contextual Information Module, and Module 2 represents the Location Filtering Module.</p>
<table-wrap position="float" id="tab2">
<label>Table 2</label>
<caption>
<p>Ablation experiments.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Model</th>
<th align="center" valign="top">Accuracy</th>
<th align="center" valign="top">Recall</th>
<th align="center" valign="top">Precision</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="top">ResNet</td>
<td align="center" valign="top">71.42%</td>
<td align="center" valign="top">72.73%</td>
<td align="center" valign="top">80.00%</td>
</tr>
<tr>
<td align="left" valign="top">ResNet + Module 1</td>
<td align="center" valign="top">74.29%</td>
<td align="center" valign="top">72.73%</td>
<td align="center" valign="top">84.21%</td>
</tr>
<tr>
<td align="left" valign="top"><bold>ResNet&#x2009;+&#x2009;Module 1&#x2009;+&#x2009;Module 2</bold></td>
<td align="center" valign="top"><bold>85.71%</bold></td>
<td align="center" valign="top"><bold>86.36%</bold></td>
<td align="center" valign="top"><bold>90.48%</bold></td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>The best-performing results are highlighted in bold.</p>
</table-wrap-foot>
</table-wrap>
<p>The results of the ablation experiments showed that the removal of either module resulted in a significant decrease in model performance. This validates the importance of both modules to the model performance. These results strongly support the validity of our proposed modules and confirm their positive impact on the overall model performance.</p>
</sec>
<sec id="sec14">
<label>3.3</label>
<title>Optimal insertion location analysis of the contextual information module</title>
<p>In order to determine the optimal insertion location of the Contextual Information Module, we conducted additional experiments. On the base of the currently best-performing model, we adjusted the insertion location of the Contextual Information Module and observed its effect on the model performance. We attempted to insert the modules at locations with different feature map sizes and recorded the optimal performance of the model performance in each case, as shown in <xref ref-type="table" rid="tab3">Table 3</xref>.</p>
<table-wrap position="float" id="tab3">
<label>Table 3</label>
<caption>
<p>Experimental results inserted by the Module 1 at different locations on the optimal model.</p>
</caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left" valign="top">Feature map size at the Module 1 insertion point</th>
<th align="center" valign="top">Accuracy</th>
<th align="center" valign="top">Recall</th>
<th align="center" valign="top">Precision</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="top">64 &#x00D7;&#x2009;64</td>
<td align="center" valign="top">80.00%</td>
<td align="center" valign="top">81.82%</td>
<td align="center" valign="top">85.71%</td>
</tr>
<tr>
<td align="left" valign="top"><bold>32 &#x00D7; 32</bold></td>
<td align="center" valign="top"><bold>85.71%</bold></td>
<td align="center" valign="top"><bold>86.36%</bold></td>
<td align="center" valign="top"><bold>90.48%</bold></td>
</tr>
<tr>
<td align="left" valign="top">16 &#x00D7;&#x2009;16</td>
<td align="center" valign="top">82.86%</td>
<td align="center" valign="top">81.82%</td>
<td align="center" valign="top">90.00%</td>
</tr>
<tr>
<td align="left" valign="top">8 &#x00D7;&#x2009;8</td>
<td align="center" valign="top">74.29%</td>
<td align="center" valign="top">77.27%</td>
<td align="center" valign="top">80.95%</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>The best-performing results are highlighted in bold.</p>
</table-wrap-foot>
</table-wrap>
<p>The results above show that inserting the Contextual Information Module after a feature map of 32&#x00D7;32 size can bring the maximum performance improvement to the model with an accuracy of 85.71%. The ROC curve of the best-performing model is shown in <xref ref-type="fig" rid="fig3">Figure 3</xref>, with an AUC value of 0.85. This result also demonstrates the impact of different insertion locations of the Contextual Information Module on the model performance. These results strongly support the necessity of exploring the optimal insertion location for the Contextual Information Module and provide important ideas for improving the model performance.</p>
<fig position="float" id="fig3">
<label>Figure 3</label>
<caption>
<p>ROC curve.</p>
</caption>
<graphic xlink:href="fnins-18-1364338-g003.tif"/>
</fig>
<p>In summary, through all the aforementioned experiments, we have successfully determined the optimal model for this task. This process not only validates the effectiveness of the proposed innovative modules, but also provides an effective method for the automatic classification of PD and MSA.</p>
</sec>
</sec>
<sec sec-type="discussion" id="sec15">
<label>4</label>
<title>Discussion</title>
<p>Our experimental results demonstrate that the deep learning framework 3D-CAM can effectively classify PD and MSA based on medical images, achieving a classification accuracy of 85.71% and an AUC value of 0.85. This outcome shows the capability of our research method to learn disease-related image features from medical imaging data in an effective manner.</p>
<p>We speculate that the reason why the 3D-CAM framework performs well in experiments and outperforms other classical deep learning models is because it is specifically designed for PD and MSA classification tasks. It not only learns features from the current slice but also integrates key features from adjacent slices. At the same time, by utilizing attention mechanisms, it allows the network to focus more on overall features and the segment of slices that contain crucial features.</p>
<p>Recently, several studies have shown promising results in the diagnosis of PD and MSA using machine learning methods, such as <xref ref-type="bibr" rid="ref5">Chen et al. (2017)</xref>, <xref ref-type="bibr" rid="ref16">Pang et al. (2020)</xref>, <xref ref-type="bibr" rid="ref2">Bu et al. (2023)</xref>, and <xref ref-type="bibr" rid="ref4">Chen et al. (2023)</xref>. Among them, the dataset volume used by <xref ref-type="bibr" rid="ref16">Pang et al. (2020)</xref> is comparable to our research, making it highly relevant. They obtained an AUC value of 0.862 in the classification task of PD and MSA on the test set, slightly higher than our result of 0.85. Although their results slightly outperforms the one we proposed, the approach by <xref ref-type="bibr" rid="ref16">Pang et al. (2020)</xref> relies on manually selecting key feature slices and segmenting regions of interest, which greatly increases the subjectivity and complexity of the classification process. Moreover, the features extracted by machine learning methods are selected from a fixed set, which also presents limitations. The other studies based on machine learning methods mentioned above also suffer from these issues.</p>
<p>Some researchers have attempted to diagnose PD and MSA through deep learning methods, such as <xref ref-type="bibr" rid="ref10">Huseyn (2020)</xref> and <xref ref-type="bibr" rid="ref18">Rau et al. (2023)</xref>. Among them, <xref ref-type="bibr" rid="ref10">Huseyn (2020)</xref> proposed an innovative deep learning model, achieving an accuracy of about 88% in the classification task of PD and MSA, slightly higher than our proposed model&#x2019;s accuracy of 85.71%. However, the aforementioned deep learning methods still rely on manually selecting key feature slices and segmenting regions of interest, which does not allow for fully automated classification and diagnosis of diseases. In addition, neurodegenerative diseases affect the entire brain of patients, and relying solely on local brain information within the regions of interest limits exploration of lesion features in other brain regions.</p>
<p>Compared to previous studies, 3D-CAM framework has achieved significant progress in the classification of PD and MSA. It no longer rely on manual selection of slices and regions of interest, successfully achieving fully automated classification. This method significantly reduces the investment of manpower and time. Additionally, by conducting direct analysis of global brain data instead of restricting to specific regions of interest, it enables the capture of more comprehensive feature information from the entire brain, leading to a significant enhancement in diagnostic accuracy and efficiency.</p>
<p>However, despite the promising results achieved by our approach, it is important to note some potential limitations. Firstly, although we have conducted our research using a large amount of data, the outcomes are still constrained by the current dataset. In the future, with the increase of data volume, we are expected to further optimize the model to obtain more reliable and comprehensive diagnostic results. Secondly, our study has focused solely on the classification tasks of PD and MSA, and applications to other neurological disorders have not been explored. Therefore, future research can further investigate the applicability of this framework in classifying other diseases.</p>
<p>In conclusion, our research has proposed an effective deep learning framework that offers a reliable solution for the classification of PD and MSA based on medical imaging, achieving satisfactory classification accuracy. This study offers strong support for early detection of neurodegenerative diseases and has broad prospect for clinical application. Additionally, our research provides new ideas and tools for the diagnosis and treatment of neurodegenerative diseases, and is expected to provide solid support for the future advancement of related fields.</p>
</sec>
<sec sec-type="data-availability" id="sec16">
<title>Data availability statement</title>
<p>The raw data supporting the conclusions of this article will be made available by the authors, without undue reservation.</p>
</sec>
<sec sec-type="ethics-statement" id="sec17">
<title>Ethics statement</title>
<p>The studies involving humans were approved by the Medical Research Ethics Committee of the First Affiliated Hospital of China Medical University. The studies were conducted in accordance with the local legislation and institutional requirements. The participants provided their written informed consent to participate in this study. Written informed consent was obtained from the individual(s) for the publication of any potentially identifiable images or data included in this article.</p>
</sec>
<sec sec-type="author-contributions" id="sec18">
<title>Author contributions</title>
<p>YY: Writing &#x2013; original draft, Writing &#x2013; review &#x0026; editing, Methodology, Project administration. XH: Writing &#x2013; original draft, Writing &#x2013; review &#x0026; editing, Project administration. GS: Funding acquisition, Resources, Writing &#x2013; review &#x0026; editing. YZ: Funding acquisition, Resources, Writing &#x2013; review &#x0026; editing. XZ: Funding acquisition, Resources, Writing &#x2013; review &#x0026; editing. LS: Funding acquisition, Resources, Writing &#x2013; review &#x0026; editing. ZG: Funding acquisition, Resources, Writing &#x2013; review &#x0026; editing. AL: Funding acquisition, Resources, Writing &#x2013; review &#x0026; editing. TG: Funding acquisition, Resources, Writing &#x2013; review &#x0026; editing. HL: Funding acquisition, Resources, Writing &#x2013; review &#x0026; editing. GF: Supervision, Writing &#x2013; review &#x0026; editing.</p>
</sec>
</body>
<back>
<sec sec-type="funding-information" id="sec19">
<title>Funding</title>
<p>The author(s) declare financial support was received for the research, authorship, and/or publication of this article. This work was supported by the National Natural Science Foundation of China (62073314 and 92048203), Liaoning Provincial Natural Science Foundation of China (2022-YQ-06), Beijing Hospitals Authority Clinical Medicine Development of special funding support (YGLX202321), Beijing Natural Science Foundation (JQ23038), and Wuxi Science and Technology Bureau&#x2019;s Research Project Plan (Y20222022).</p>
</sec>
<ack>
<p>We are grateful to all the patients who provided data for this study.</p>
</ack>
<sec sec-type="COI-statement" id="sec20">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="sec100" sec-type="disclaimer">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="ref1"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Antonini</surname> <given-names>A.</given-names></name></person-group> (<year>2010</year>). <article-title>Imaging for early differential diagnosis of parkinsonism</article-title>. <source>Lancet Neurol.</source> <volume>9</volume>, <fpage>130</fpage>&#x2013;<lpage>131</lpage>. doi: <pub-id pub-id-type="doi">10.1016/S1474-4422(09)70360-6</pub-id></citation></ref>
<ref id="ref2"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bu</surname> <given-names>S.</given-names></name> <name><surname>Pang</surname> <given-names>H.</given-names></name> <name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Zhao</surname> <given-names>M.</given-names></name> <name><surname>Wang</surname> <given-names>J.</given-names></name> <name><surname>Liu</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Multi-parametric radiomics of conventional T1 weighted and susceptibility-weighted imaging for differential diagnosis of idiopathic Parkinson's disease and multiple system atrophy</article-title>. <source>BMC Med. Imaging</source> <volume>23</volume>:<fpage>204</fpage>. doi: <pub-id pub-id-type="doi">10.1186/s12880-023-01169-1</pub-id>, PMID: <pub-id pub-id-type="pmid">38066432</pub-id></citation></ref>
<ref id="ref3"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>ChaoGan</surname> <given-names>Y.</given-names></name> <name><surname>YuFeng</surname> <given-names>Z.</given-names></name></person-group> (<year>2010</year>). <article-title>DPARSF: a MATLAB toolbox for "pipeline" data analysis of resting-state fMRI</article-title>. <source>Front. Syst. Neurosci.</source> <volume>4</volume>:<fpage>13</fpage>. doi: <pub-id pub-id-type="doi">10.3389/fnsys.2010.00013</pub-id>, PMID: <pub-id pub-id-type="pmid">20577591</pub-id></citation></ref>
<ref id="ref4"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>B.</given-names></name> <name><surname>Cui</surname> <given-names>W.</given-names></name> <name><surname>Wang</surname> <given-names>S.</given-names></name> <name><surname>Sun</surname> <given-names>A.</given-names></name> <name><surname>Yu</surname> <given-names>H.</given-names></name> <name><surname>Liu</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Functional connectome automatically differentiates multiple system atrophy (parkinsonian type) from idiopathic Parkinson's disease at early stages</article-title>. <source>Hum. Brain Mapp.</source> <volume>44</volume>, <fpage>2176</fpage>&#x2013;<lpage>2190</lpage>. doi: <pub-id pub-id-type="doi">10.1002/hbm.26201</pub-id>, PMID: <pub-id pub-id-type="pmid">36661217</pub-id></citation></ref>
<ref id="ref5"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>B.</given-names></name> <name><surname>Fan</surname> <given-names>G.</given-names></name> <name><surname>Sun</surname> <given-names>W.</given-names></name> <name><surname>Shang</surname> <given-names>X.</given-names></name> <name><surname>Shi</surname> <given-names>S.</given-names></name> <name><surname>Wang</surname> <given-names>S.</given-names></name> <etal/></person-group>. (<year>2017</year>). <article-title>Usefulness of diffusion-tensor MRI in the diagnosis of Parkinson variant of multiple system atrophy and Parkinson's disease: a valuable tool to differentiate between them?</article-title> <source>Clin. Radiol.</source> <volume>72</volume>, <fpage>610.e9</fpage>&#x2013;<lpage>610.e15</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.crad.2017.02.005</pub-id>, PMID: <pub-id pub-id-type="pmid">28318507</pub-id></citation></ref>
<ref id="ref7"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Greenspan</surname> <given-names>H.</given-names></name> <name><surname>Ginneken</surname> <given-names>B. V.</given-names></name> <name><surname>Summers</surname> <given-names>R. M.</given-names></name></person-group> (<year>2016</year>). <article-title>Guest editorial deep learning in medical imaging: overview and future promise of an exciting new technique</article-title>. <source>IEEE Trans. Med. Imaging</source> <volume>35</volume>, <fpage>1153</fpage>&#x2013;<lpage>1159</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TMI.2016.2553401</pub-id></citation></ref>
<ref id="ref8"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>He</surname> <given-names>K.</given-names></name> <name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Ren</surname> <given-names>S.</given-names></name> <name><surname>Sun</surname> <given-names>J.</given-names></name></person-group> (<year>2016</year>). <article-title>Deep residual learning for image recognition</article-title>. in <conf-name>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</conf-name>, <fpage>770</fpage>&#x2013;<lpage>778</lpage>.</citation></ref>
<ref id="ref9"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>G.</given-names></name> <name><surname>Liu</surname> <given-names>Z.</given-names></name> <name><surname>Van Der Maaten</surname> <given-names>L.</given-names></name> <name><surname>Weinberger</surname> <given-names>K. Q.</given-names></name></person-group> (<year>2018</year>). <article-title>Densely connected convolutional networks</article-title>. in <conf-name>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</conf-name>, <fpage>2261</fpage>&#x2013;<lpage>2269</lpage>.</citation></ref>
<ref id="ref10"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huseyn</surname> <given-names>E.</given-names></name></person-group> (<year>2020</year>). <article-title>Deep learning based early diagnostics of Parkinsons disease</article-title>. <source>arXiv</source> <comment>arXiv:2008.01792</comment></citation></ref>
<ref id="ref11"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jyotiyana</surname> <given-names>M.</given-names></name> <name><surname>Kesswani</surname> <given-names>N.</given-names></name> <name><surname>Kumar</surname> <given-names>M.</given-names></name></person-group> (<year>2022</year>). <article-title>A deep learning approach for classification and diagnosis of Parkinson&#x2019;s disease</article-title>. <source>Soft. Comput.</source> <volume>26</volume>, <fpage>9155</fpage>&#x2013;<lpage>9165</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s00500-022-07275-6</pub-id></citation></ref>
<ref id="ref12"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kim</surname> <given-names>Y. S.</given-names></name> <name><surname>Lee</surname> <given-names>J. H.</given-names></name> <name><surname>Gahm</surname> <given-names>J. K.</given-names></name></person-group> (<year>2022</year>). <article-title>Automated differentiation of atypical parkinsonian syndromes using brain Iron patterns in susceptibility weighted imaging</article-title>. <source>Diagnostics</source> <volume>12</volume>:<fpage>637</fpage>. doi: <pub-id pub-id-type="doi">10.3390/diagnostics12030637</pub-id>, PMID: <pub-id pub-id-type="pmid">35328190</pub-id></citation></ref>
<ref id="ref13"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Litjens</surname> <given-names>G.</given-names></name> <name><surname>Kooi</surname> <given-names>T.</given-names></name> <name><surname>Bejnordi</surname> <given-names>B. E.</given-names></name> <name><surname>Setio</surname> <given-names>A. A. A.</given-names></name> <name><surname>Ciompi</surname> <given-names>F.</given-names></name> <name><surname>Ghafoorian</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2017</year>). <article-title>A survey on deep learning in medical image analysis</article-title>. <source>Med. Image Anal.</source> <volume>42</volume>, <fpage>60</fpage>&#x2013;<lpage>88</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.media.2017.07.005</pub-id></citation></ref>
<ref id="ref14"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Palma</surname> <given-names>J. A.</given-names></name> <name><surname>Norcliffe-Kaufmann</surname> <given-names>L.</given-names></name> <name><surname>Kaufmann</surname> <given-names>H.</given-names></name></person-group> (<year>2018</year>). <article-title>Diagnosis of multiple system atrophy</article-title>. <source>Auton. Neurosci.</source> <volume>211</volume>, <fpage>15</fpage>&#x2013;<lpage>25</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.autneu.2017.10.007</pub-id>, PMID: <pub-id pub-id-type="pmid">29111419</pub-id></citation></ref>
<ref id="ref15"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Panayides</surname> <given-names>A. S.</given-names></name> <name><surname>Amini</surname> <given-names>A.</given-names></name> <name><surname>Filipovic</surname> <given-names>N. D.</given-names></name> <name><surname>Sharma</surname> <given-names>A.</given-names></name> <name><surname>Tsaftaris</surname> <given-names>S. A.</given-names></name> <name><surname>Young</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>AI in medical imaging informatics: current challenges and future directions</article-title>. <source>IEEE J. Biomed. Health Inform.</source> <volume>24</volume>, <fpage>1837</fpage>&#x2013;<lpage>1857</lpage>. doi: <pub-id pub-id-type="doi">10.1109/JBHI.2020.2991043</pub-id>, PMID: <pub-id pub-id-type="pmid">32609615</pub-id></citation></ref>
<ref id="ref16"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pang</surname> <given-names>H.</given-names></name> <name><surname>Yu</surname> <given-names>Z.</given-names></name> <name><surname>Li</surname> <given-names>R.</given-names></name> <name><surname>Yang</surname> <given-names>H.</given-names></name> <name><surname>Fan</surname> <given-names>G.</given-names></name></person-group> (<year>2020</year>). <article-title>MRI-based Radiomics of basal nuclei in differentiating idiopathic Parkinson's disease from parkinsonian variants of multiple system atrophy: a susceptibility-weighted imaging study</article-title>. <source>Front. Aging Neurosci.</source> <volume>12</volume>:<fpage>587250</fpage>. doi: <pub-id pub-id-type="doi">10.3389/fnagi.2020.587250</pub-id>, PMID: <pub-id pub-id-type="pmid">33281598</pub-id></citation></ref>
<ref id="ref17"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Poewe</surname> <given-names>W.</given-names></name> <name><surname>Wenning</surname> <given-names>G.</given-names></name></person-group> (<year>2002</year>). <article-title>The differential diagnosis of Parkinson's disease</article-title>. <source>Eur. J. Neurol.</source> <volume>9</volume>, <fpage>23</fpage>&#x2013;<lpage>30</lpage>. doi: <pub-id pub-id-type="doi">10.1046/j.1468-1331.9.s3.3.x</pub-id></citation></ref>
<ref id="ref18"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rau</surname> <given-names>A.</given-names></name> <name><surname>Schroter</surname> <given-names>N.</given-names></name> <name><surname>Rijntjes</surname> <given-names>M.</given-names></name> <name><surname>Bamberg</surname> <given-names>F.</given-names></name> <name><surname>Jost</surname> <given-names>W. H.</given-names></name> <name><surname>Zaitsev</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Deep learning segmentation results in precise delineation of the putamen in multiple system atrophy</article-title>. <source>Eur. Radiol.</source> <volume>33</volume>, <fpage>7160</fpage>&#x2013;<lpage>7167</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s00330-023-09665-2</pub-id>, PMID: <pub-id pub-id-type="pmid">37121929</pub-id></citation></ref>
<ref id="ref19"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Rehman</surname> <given-names>A.</given-names></name> <name><surname>Ahmed Butt</surname> <given-names>M.</given-names></name> <name><surname>Zaman</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). <article-title>A survey of medical image analysis using deep learning approaches</article-title>. in <conf-name>Proceedings of 5th International Conference on Computing Methodologies and Communication (ICCMC)</conf-name>, <fpage>1334</fpage>&#x2013;<lpage>1342</lpage>.</citation></ref>
<ref id="ref20"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Song</surname> <given-names>Y. J.</given-names></name> <name><surname>Lundvig</surname> <given-names>D. M.</given-names></name> <name><surname>Huang</surname> <given-names>Y.</given-names></name> <name><surname>Gai</surname> <given-names>W. P.</given-names></name> <name><surname>Blumbergs</surname> <given-names>P. C.</given-names></name> <name><surname>Hojrup</surname> <given-names>P.</given-names></name> <etal/></person-group>. (<year>2007</year>). <article-title>p25alpha relocalizes in oligodendroglia from myelin to cytoplasmic inclusions in multiple system atrophy</article-title>. <source>Am. J. Pathol.</source> <volume>171</volume>, <fpage>1291</fpage>&#x2013;<lpage>1303</lpage>. doi: <pub-id pub-id-type="doi">10.2353/ajpath.2007.070201</pub-id>, PMID: <pub-id pub-id-type="pmid">17823288</pub-id></citation></ref>
<ref id="ref21"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Szegedy</surname> <given-names>C.</given-names></name> <name><surname>Liu</surname> <given-names>W.</given-names></name> <name><surname>Jia</surname> <given-names>Y.</given-names></name> <name><surname>Sermanet</surname> <given-names>P.</given-names></name> <name><surname>Reed</surname> <given-names>S.</given-names></name> <name><surname>Anguelov</surname> <given-names>D.</given-names></name> <etal/></person-group>. (<year>2015</year>). <article-title>Going deeper with convolutions</article-title>. in <conf-name>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</conf-name>, <fpage>2818</fpage>&#x2013;<lpage>2826</lpage>.</citation></ref>
<ref id="ref22"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Tan</surname> <given-names>M.</given-names></name> <name><surname>Le</surname> <given-names>Q.</given-names></name></person-group> (<year>2020</year>). <article-title>EfficientNet: rethinking model scaling for convolutional neural networks</article-title>. in <conf-name>Proceedings of the International Conference on Machine Learning. PMLR</conf-name>, <fpage>6105</fpage>&#x2013;<lpage>6114</lpage>.</citation></ref>
<ref id="ref23"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>Z.</given-names></name> <name><surname>Bovik</surname> <given-names>A. C.</given-names></name> <name><surname>Sheikh</surname> <given-names>H. R.</given-names></name> <name><surname>Simoncelli</surname> <given-names>E. P.</given-names></name></person-group> (<year>2004</year>). <article-title>Image quality assessment: from error visibility to structural similarity</article-title>. <source>IEEE Trans. Image Process.</source> <volume>13</volume>, <fpage>600</fpage>&#x2013;<lpage>612</lpage>. doi: <pub-id pub-id-type="doi">10.1109/tip.2003.819861</pub-id>, PMID: <pub-id pub-id-type="pmid">15376593</pub-id></citation></ref>
<ref id="ref24"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>P.</given-names></name> <name><surname>Zhao</surname> <given-names>Y.</given-names></name> <name><surname>Wu</surname> <given-names>J.</given-names></name> <name><surname>Brendel</surname> <given-names>M.</given-names></name> <name><surname>Lu</surname> <given-names>J.</given-names></name> <name><surname>Ge</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2022</year>). <article-title>Differential diagnosis of parkinsonism based on deep metabolic imaging indices</article-title>. <source>J. Nucl. Med.</source> <volume>63</volume>, <fpage>1741</fpage>&#x2013;<lpage>1747</lpage>. doi: <pub-id pub-id-type="doi">10.2967/jnumed.121.263029</pub-id>, PMID: <pub-id pub-id-type="pmid">35241481</pub-id></citation></ref>
<ref id="ref25"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wullner</surname> <given-names>U.</given-names></name> <name><surname>Borghammer</surname> <given-names>P.</given-names></name> <name><surname>Choe</surname> <given-names>C. U.</given-names></name> <name><surname>Csoti</surname> <given-names>I.</given-names></name> <name><surname>Falkenburger</surname> <given-names>B.</given-names></name> <name><surname>Gasser</surname> <given-names>T.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>The heterogeneity of Parkinson's disease</article-title>. <source>J. Neural Transm. (Vienna)</source> <volume>130</volume>, <fpage>827</fpage>&#x2013;<lpage>838</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s00702-023-02635-4</pub-id>, PMID: <pub-id pub-id-type="pmid">37169935</pub-id></citation></ref>
<ref id="ref26"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zang</surname> <given-names>Y.</given-names></name> <name><surname>Jiang</surname> <given-names>T.</given-names></name> <name><surname>Lu</surname> <given-names>Y.</given-names></name> <name><surname>He</surname> <given-names>Y.</given-names></name> <name><surname>Tian</surname> <given-names>L.</given-names></name></person-group> (<year>2004</year>). <article-title>Regional homogeneity approach to fMRI data analysis</article-title>. <source>NeuroImage</source> <volume>22</volume>, <fpage>394</fpage>&#x2013;<lpage>400</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.neuroimage.2003.12.030</pub-id></citation></ref>
<ref id="ref27"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Zhao</surname> <given-names>Y.</given-names></name> <name><surname>Wu</surname> <given-names>P.</given-names></name> <name><surname>Wang</surname> <given-names>J.</given-names></name> <name><surname>Li</surname> <given-names>H.</given-names></name> <name><surname>Navab</surname> <given-names>N.</given-names></name> <name><surname>Yakushev</surname> <given-names>I.</given-names></name> <etal/></person-group>. (<year>2019</year>). <article-title>A 3D deep residual convolutional neural network for differential diagnosis of parkinsonian syndromes on 18F-FDG PET images</article-title>. in <conf-name>2019 41st Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)</conf-name>, <fpage>3531</fpage>&#x2013;<lpage>3534</lpage>.</citation></ref>
</ref-list>
</back>
</article>