# Arithmetic Optimization with RetinaNet Model for Motor Imagery Classification on Brain Computer Interface

Authors: Areej A. Malibari; Fahd N. Al-Wesabi; Marwa Obayya; Mimouna Abdullah Alkhonaini; Manar Ahmed Hamza; Abdelwahed Motwakel; Ishfaq Yaseen; Abu Sarwar Zamani
Journal: Journal of Healthcare Engineering
 (2022)

---

## Abstract

Brain Computer Interface (BCI) technology commonly used to enable communication for the person with movement disability. It allows the person to communicate and control assistive robots by the use of electroencephalogram (EEG) or other brain signals. Though several approaches have been available in the literature for learning EEG signal feature, the deep learning (DL) models need to further explore for generating novel representation of EEG features and accomplish enhanced outcomes for MI classification. With this motivation, this study designs an arithmetic optimization with RetinaNet based deep learning model for MI classification (AORNDL-MIC) technique on BCIs. The proposed AORNDL-MIC technique initially exploits Multiscale Principal Component Analysis (MSPCA) approach for the EEG signal denoising and Continuous Wavelet Transform (CWT) is exploited for the transformation of 1D-EEG signal into 2D time-frequency amplitude representation, which enables to utilize the DL model via transfer learning approach. In addition, the DL based RetinaNet is applied for extracting of feature vectors from the EEG signal which are then classified with the help of ID3 classifier. In order to optimize the classification efficiency of the AORNDL-MIC technique, arithmetical optimization algorithm (AOA) is employed for hyperparameter tuning of the RetinaNet. The experimental analysis of the AORNDL-MIC algorithm on the benchmark data sets reported its promising performance over the recent state of art methodologies.


---

## Body

## 1. Introduction

Brain-computer interface (BCI) is a technology that permits us to communicate with the computer, whereby the device forecasts the abstract aspect of cognitive states with brain signals, namely, electroencephalography (EEG). Also, it is named as Brain-computer interface (BCI) that is commonly associated with AI-enabled approach which permits the user to harness brain, etc [1]. It is a noninvasive approach that gathers brain oscillatory activation patterns from the scalp. The human brain produces electrical signal that is identified by using EEG. Therefore, it is highly reliable and applicable method for receiving the control command for BCI [2]. Studies involving EEG signals when imagining limb or finger movement, widely called motor imagery (MI), to function artificial intelligence (AI) technique has been witnessed in this study [3]. An effective BCI scheme has two fundamental needs that consist of effective machine learning (ML) method for the classification of feature extraction and an efficient set of EEG feature must be capable of differentiating task induced brain activities. The study aims to identify the MI-task induced EEG patterns [4, 5].Mostly, BCI system involves filtering or preprocessing to remove this undesirable component that is embedded with the EEG signals which leads to wrong conclusions and bias the analysis of the EEG [6]. Appropriate preprocessing within the BCI scheme results in cleaner EEG signal, thus enhancing the classification outcomes. The study focuses on the quantum mechanics inspired preprocessing phase within the BCI scheme, for extracting further data from the attained noisy EEG signal, and leads to increased classification performance although categorized by using multiple classification methods [7]. Especially, SVM is widely employed for MI classification in BMI. Imagery signal classification is performed by LR method. KNN is utilized in seizure detection, where NB is utilized for detecting the lower limb movement by analyzing EEG signals [8]. At the same time, DT is primarily utilized for hand amplitude modulation and movement interpretation spatial activity. Deep Learning (DL) method could considerably simplify processing channel, allow automated end-to-end training of retrieval, preprocessing, and classification models [9], while guaranteeing better performance in target. Deep neural network (DNN) stimulated by previous methods like multilayer perceptron (MLP).This study designs an arithmetic optimization with RetinaNet based deep learning model for MI classification (AORNDL-MIC) technique on BCIs. The proposed AORNDL-MIC technique undergoes two stages of reprocessing namely Multiscale Principal Component Analysis (MSPCA) based denoising and Continuous Wavelet Transform (CWT) based decomposition. Besides, the arithmetic optimization algorithm (AOA) based RetinaNet model is as feature extractor which are then classified by the use of ID3 classifier. To ensure the better results of the AORNDL-MIC approach, a number of experiments were carried out and the result is inspected under different aspects.The rest of the paper is organized as follows. Section2 offers related works, Section 3 provides proposed model, Section 4 discusses performance validation, and Section 5 draws conclusion.


## 2. Related Works

Zhang et al. [10] validate and developed a DL-based algorithm for automatically recognizing two distinct MI states by choosing the related EEG channel. It employs an automated channel selection (ACS) approach. Furthermore, we proposed a CNN method for fully exploiting the time-frequency feature, therefore outperforming conventional classification method interms of robustness and accuracy. Kant et al. [11] present an integration of DL-based TL and CWT for solving the problems. CWT transforms 1D-EEG signal into 2D time-frequency-amplitude representation enables users to make use of deep network via TL method. Corsi et al. [12] adapted a fusion technique that integrates features from instantaneously recorded MEG and EEG signals to enhance classification performance in MI-based BCI. Thomas et al. [13] introduce a discriminatory filter bank (FB) common spatial pattern model for extracting FB for the classification of MI. The presented model improves the classifier performance in BCI datasets.Dong et al. [14], proposed a hierarchical SVM approach for addressing an EEG-based 4-class MI classification process. Wavelet packet transform is applied for decomposing original EEG signal. EEG feature vector is extracted and a a two-layer HSVM approach is developed for classifying this EEG feature vector, whereas “OVO” classifier is utilized in the initial layer as well as “OVR” in the next layer. Zhang et al. [15], proposed a “brain-ID” architecture based hybrid DNN using TL method for handling single difference of 4-class MI tasks. A dedicated HDNN is designed for learning the common feature of MI signals. The suggested algorithm comprises LSTM and CNN models that are employed for decoding the spatiotemporal features of the MI signal. Zhang et al. [16] introduce 5 systems for adoptation of a DCNN based EEG-BCI scheme for decoding hand MI. All the systems are widely trained, pretrained method and adapt it to improve the efficiency.


## 3. The Proposed Model

In our study, an AORNDL-MIC approach was introduced to classify the MI on BCIs. The proposed AORNDL-MIC technique encompasses a series of operations namely MSPCA based denoising, CWT based decomposition, RetinaNet based feature extraction, AOA based hyperparameter tuning, as well as ID3 based classification.


### 3.1. Data Preprocessing

Initially, the data preprocessing takes place in two stages namely MSPCA based noise removal and CWT based decomposition. Consider a measurement data set withm sensor exists, namely xeRm. All the sensors in the measurement samples have n sampling data, that is integrated into a data matrix of size mxn. The procedure has been shown as follows [2]:(1)X=x1,x2,x3,…,xn.All the columns represent a measurement variable, and all the rows ofX denote a sample. The PCA models initiated by normalizing all the samples of X by calculating the covariance matrix of X.(2)covx≂XT.Xn−1.The method of decompositionX in its PCA, in which PeRm×A has initial A feature vector of cov (x). Once the feature decomposition of X is made, the size of feature value is arranged from larger to smaller. A indicates the amount of PCA, and it is equivalent to the amount of columns in T.T∈Rm×A denotes a matrix, in which all the columns are called as the principal element variable.(3)X=X^+Er=T.PT+Er,T=X.P.In whichλ1,λ2,…,λn represent the initial A large eigen values of covariance matrix of X, equation (4) is utilized for determining the principal component covariance,(4)Λ=XT.Xn−1=λ1…………λ2………………………λn.In the study, the wavelet transform is integrated into the PCA model for creating MSPCA to the incoming signal denoising purpose. In MSPCA, the PCA ability for extracting covariance among parameters is integrated to orthonormal wavelets’ capability. The capability of PCA is improved by integrating the multi-scale analysis. Simultaneously, it leads to the MSPCA [17]. It finds linearly correlated wavelet coefficient at multilevel sub-bands, attained using wavelet transform. It represents every subband with less features when eliminating the autocorrelated coefficient. The signal is recreated by utilizing the wavelet syntheses. It reduces unnecessary noises from the received signals and generated noise‐free and simple signal versions. Also, it can be utilized as a scalogram that is signified by exact value of CWT of the signals. MI signal is gradually changing event peppered by abrupt transient with feature taking place at distinct scales, so lower frequency event, offering maximum time localization to higher frequency, shorter duration event, and higher frequency localization to extended duration, is attained utilizing scalogram.


### 3.2. RetinaNet Based Feature Extraction

Next to the data preprocessing phase, the AORNDL-MIC technique involves the RetinaNet model as a feature extractor. RetinaNet comprises of two fully convolution networks (FCN), a feature pyramid network (FPN), and residual network (ResNet). ResNet uses distinct network layers. The important role of ResNet is the concept of RL that enables raw input data to be transferred directly to the succeeding layers. The widely employed type of network layer consists of 101‐layer, 152‐layer, and 50‐layer. The study chooses 101‐layers with the optimal training efficiency [18]. Then, extracted the feature of the echocardiography with ResNet and later transmitted to the following subnetworks. FPN is an approach to effectively extract the feature of all the dimensions in a picture with a traditional CNN. Figure 1 illustrates the overview of CNN. Firstly, use single‐dimension images as input to ResNet. Next, start from another layer of the convolution network, the feature of each layer was chosen using the FPN and later integrated to generate the last output. The class subnetwork in the FCN implemented the classifier process. Focal loss: it is an amended form of binary cross‐entropy expression, as well as the cross‐entropy loss:(5)CEp,y=−logp,ify=1,−log1−p,otherwise,whereas y∈±,1 characterizes the ground truth category and p∈0,1 signifies the predicted likelihood of algorithm for y=1.(6)pt=p,ify=1,1−p,otherwise.Figure 1
Overview of CNN.The abovementioned equation is abbreviated as(7)CEp,y=CEpt=−logpt.To resolve the problems of the data imbalance among the negative and positive instances, the novel version is changed into the subsequent form:(8)CEpt=−αtlogpt,and amongst them,(9)αt=α,ify=1,l−α,otherwise,whereas, α∈0,1 characterizes the weight factor. To resolve the problems of complex samples, the variable C is presented for obtaining the last form of focal loss [19]. Figure 2 illustrates the structure of RetinaNet.(10)FLpt=−αt1−ptγlogpt.Figure 2
RetinaNet network architecture.Since the hyperparameters of the RetinaNet model influence the overall classifier results of the AORNDL-MIC technique, the AOA is utilized. In general, as other MH approaches, the AOA consists of, exploration, and exploitation phases, stimulated by mathematical operations, like−,+,∗, and /. Firstly, the AOA generates a set of N solutions [20]. Therefore, solution or agent represents X population, as:(11)X=xN−1,1xN,1x2,1x1,1xN−1,jxN,jx2,jx1,jxN,n−1x1,n−1xN−1,nxN,nx2,nx1,n,X=x1,1⋯x1,jx1,n−1x1,nx2,1⋯x2,j⋯x2,n⋯⋯⋯⋯⋯⋮⋮⋮⋮⋮xN−1,1⋯xN−1,j⋯xN−1,nxN,1⋯xN,jxN,n−1xN,n.


### 3.3. AOA Based Hyperparameter Tuning

Then, the fitness function of solution is calculated for detecting optimal oneXb. According to the Math Optimizer Accelerated MOA values, AOA implements exploitation or exploration methods. Subsequently, MOA is upgraded by(12)MOAt=Min+t×MaxMOA−MinMOAMt,where Mt characterizes the overall amount of iterations. MinMOA and MaxOA signify the minimal and maximal values of the accelerated function, correspondingly, the division (D) and multiplication (M) are applied in the exploration stage of the AOA, as follows:(13)Xi,jt+1=Xbj÷MOP+∈×UBj−LBj×μ+LBj,r2<0.5,Xbj×MOP×UBj−LBj×μ+LBj,otherwise.Nexte signifies smaller integer value, LBjandUBj shows upper and lower limits of the searching space at jth parameter. μ=0.5 denotes the control function. Furthermore, Math Optimizer MOP is determined by(14)MOPt=1−t1/αMt1/α.α=5 characterizes the dynamic variable which defines the accuracy of the exploitation stage.Additionally, subtraction (D) and addition operator (A) operators are employed for executing the AOA exploitation phase, as follows.(15)xi,jt+1=Xbj−MOP×UBj−LBj×μ+LBj,r3<0.5,Xbj+MOP×UBj−LBj×μ+LBj,otherwise.Nowr3 characterizes an arbitrary value in [0, 1]. Next, the agent updating procedure is executed by the AOA operator [21]. In summary, Algorithm 1 demonstrates the steps included in AOA.Algorithm 1: Pseudocode of AOA.
Input: the parameter of AOA includes overall quantity of iterationsMt, dynamic exploitation variable (α), and number of agent (N).Generate the primary value for the agentXii=1,, …N/. while t<Mt doCalculate the fitness function for all the agents.Define the optimal agentXb.Upgrade theMOA and MOP using equations (11) and (13),fori=1 to N doforj=1 to Dim doUpgrade the values ofr1,r2, and r3.ifr1>MOA thenExploration stageEmploy equation (12) to upgrade the Xi.elseExploitation stageEmploy equations (14) to upgrade the Xi.end ifend forend fort=t+1end whileDisplay the optimal agentXb.


### 3.4. ID3 Based Classification

Lastly, the ID3 architecture receives the feature vector as input and carries out the classification process. The ID3 technique selects test elements with computing and relating its information gains (IG). AssumeS be the group of data instances. Supposing the class element C has m distinct values that signify m various class labels Cii=1,2,…,m. Assume that Si be the amount of instances from class Cii=1,2,…,m. The predictable data amount needed for classifying S was provided in equation (15):(16)IS1,S2,…,Sm=−∑i=1mpilog2pi,where pi signifies the probability of samples from S appropriate to class Ci.IS1,S2,…,Sm refers to the average data amount needed for identifying the class label to every instance from S.Let the elementA has v distinct values a1,a2,…,aν from the trained data set S. When A is a nominal element, Afterward, the element separates S as to v subset such that S1,S2,…,Sν, in that Sj represents the subset of S where sample from Sj has the similar element value aj on A. But, instance from Sj can have various class labels [22]. Assume Sij be the group of instances that class label is Ci from the subset of Sj|A=aj,j∈1,2,…,ν,Sj∈S in which element A=aj. The needed data amount (i.e., entropy) of element A for splitting the trained data set S was measured by (16):(17)EA=∑j=1νs1j+s2j+…+smjs×Is1j,s2j,…,smj.The minimum data amount needed, a further purity of sub‐dataset is.(18)Is1j,s2j,…,smj=−∑i=1mpijlog2pij,where pij implies the probability of instances from Sj based on class Ci.Is1j,s2j,…,smj signifies the average data amount needed for identifying the class labels to every instance from Sj. The IG of A has determined as:(19)Info GainA=IS1,S2,…,Sm−EA.Specifically, the count of novel data requirement (only dependent upon class) minus the count of novel data requirements (based the split on elementA). Selecting the element with maximal Info Gain (A) as test element that is allocated to internal node from DT. During this process, the required data amount to classify samples is minimal.


## 3.1. Data Preprocessing

Initially, the data preprocessing takes place in two stages namely MSPCA based noise removal and CWT based decomposition. Consider a measurement data set withm sensor exists, namely xeRm. All the sensors in the measurement samples have n sampling data, that is integrated into a data matrix of size mxn. The procedure has been shown as follows [2]:(1)X=x1,x2,x3,…,xn.All the columns represent a measurement variable, and all the rows ofX denote a sample. The PCA models initiated by normalizing all the samples of X by calculating the covariance matrix of X.(2)covx≂XT.Xn−1.The method of decompositionX in its PCA, in which PeRm×A has initial A feature vector of cov (x). Once the feature decomposition of X is made, the size of feature value is arranged from larger to smaller. A indicates the amount of PCA, and it is equivalent to the amount of columns in T.T∈Rm×A denotes a matrix, in which all the columns are called as the principal element variable.(3)X=X^+Er=T.PT+Er,T=X.P.In whichλ1,λ2,…,λn represent the initial A large eigen values of covariance matrix of X, equation (4) is utilized for determining the principal component covariance,(4)Λ=XT.Xn−1=λ1…………λ2………………………λn.In the study, the wavelet transform is integrated into the PCA model for creating MSPCA to the incoming signal denoising purpose. In MSPCA, the PCA ability for extracting covariance among parameters is integrated to orthonormal wavelets’ capability. The capability of PCA is improved by integrating the multi-scale analysis. Simultaneously, it leads to the MSPCA [17]. It finds linearly correlated wavelet coefficient at multilevel sub-bands, attained using wavelet transform. It represents every subband with less features when eliminating the autocorrelated coefficient. The signal is recreated by utilizing the wavelet syntheses. It reduces unnecessary noises from the received signals and generated noise‐free and simple signal versions. Also, it can be utilized as a scalogram that is signified by exact value of CWT of the signals. MI signal is gradually changing event peppered by abrupt transient with feature taking place at distinct scales, so lower frequency event, offering maximum time localization to higher frequency, shorter duration event, and higher frequency localization to extended duration, is attained utilizing scalogram.


## 3.2. RetinaNet Based Feature Extraction

Next to the data preprocessing phase, the AORNDL-MIC technique involves the RetinaNet model as a feature extractor. RetinaNet comprises of two fully convolution networks (FCN), a feature pyramid network (FPN), and residual network (ResNet). ResNet uses distinct network layers. The important role of ResNet is the concept of RL that enables raw input data to be transferred directly to the succeeding layers. The widely employed type of network layer consists of 101‐layer, 152‐layer, and 50‐layer. The study chooses 101‐layers with the optimal training efficiency [18]. Then, extracted the feature of the echocardiography with ResNet and later transmitted to the following subnetworks. FPN is an approach to effectively extract the feature of all the dimensions in a picture with a traditional CNN. Figure 1 illustrates the overview of CNN. Firstly, use single‐dimension images as input to ResNet. Next, start from another layer of the convolution network, the feature of each layer was chosen using the FPN and later integrated to generate the last output. The class subnetwork in the FCN implemented the classifier process. Focal loss: it is an amended form of binary cross‐entropy expression, as well as the cross‐entropy loss:(5)CEp,y=−logp,ify=1,−log1−p,otherwise,whereas y∈±,1 characterizes the ground truth category and p∈0,1 signifies the predicted likelihood of algorithm for y=1.(6)pt=p,ify=1,1−p,otherwise.Figure 1
Overview of CNN.The abovementioned equation is abbreviated as(7)CEp,y=CEpt=−logpt.To resolve the problems of the data imbalance among the negative and positive instances, the novel version is changed into the subsequent form:(8)CEpt=−αtlogpt,and amongst them,(9)αt=α,ify=1,l−α,otherwise,whereas, α∈0,1 characterizes the weight factor. To resolve the problems of complex samples, the variable C is presented for obtaining the last form of focal loss [19]. Figure 2 illustrates the structure of RetinaNet.(10)FLpt=−αt1−ptγlogpt.Figure 2
RetinaNet network architecture.Since the hyperparameters of the RetinaNet model influence the overall classifier results of the AORNDL-MIC technique, the AOA is utilized. In general, as other MH approaches, the AOA consists of, exploration, and exploitation phases, stimulated by mathematical operations, like−,+,∗, and /. Firstly, the AOA generates a set of N solutions [20]. Therefore, solution or agent represents X population, as:(11)X=xN−1,1xN,1x2,1x1,1xN−1,jxN,jx2,jx1,jxN,n−1x1,n−1xN−1,nxN,nx2,nx1,n,X=x1,1⋯x1,jx1,n−1x1,nx2,1⋯x2,j⋯x2,n⋯⋯⋯⋯⋯⋮⋮⋮⋮⋮xN−1,1⋯xN−1,j⋯xN−1,nxN,1⋯xN,jxN,n−1xN,n.


## 3.3. AOA Based Hyperparameter Tuning

Then, the fitness function of solution is calculated for detecting optimal oneXb. According to the Math Optimizer Accelerated MOA values, AOA implements exploitation or exploration methods. Subsequently, MOA is upgraded by(12)MOAt=Min+t×MaxMOA−MinMOAMt,where Mt characterizes the overall amount of iterations. MinMOA and MaxOA signify the minimal and maximal values of the accelerated function, correspondingly, the division (D) and multiplication (M) are applied in the exploration stage of the AOA, as follows:(13)Xi,jt+1=Xbj÷MOP+∈×UBj−LBj×μ+LBj,r2<0.5,Xbj×MOP×UBj−LBj×μ+LBj,otherwise.Nexte signifies smaller integer value, LBjandUBj shows upper and lower limits of the searching space at jth parameter. μ=0.5 denotes the control function. Furthermore, Math Optimizer MOP is determined by(14)MOPt=1−t1/αMt1/α.α=5 characterizes the dynamic variable which defines the accuracy of the exploitation stage.Additionally, subtraction (D) and addition operator (A) operators are employed for executing the AOA exploitation phase, as follows.(15)xi,jt+1=Xbj−MOP×UBj−LBj×μ+LBj,r3<0.5,Xbj+MOP×UBj−LBj×μ+LBj,otherwise.Nowr3 characterizes an arbitrary value in [0, 1]. Next, the agent updating procedure is executed by the AOA operator [21]. In summary, Algorithm 1 demonstrates the steps included in AOA.Algorithm 1: Pseudocode of AOA.
Input: the parameter of AOA includes overall quantity of iterationsMt, dynamic exploitation variable (α), and number of agent (N).Generate the primary value for the agentXii=1,, …N/. while t<Mt doCalculate the fitness function for all the agents.Define the optimal agentXb.Upgrade theMOA and MOP using equations (11) and (13),fori=1 to N doforj=1 to Dim doUpgrade the values ofr1,r2, and r3.ifr1>MOA thenExploration stageEmploy equation (12) to upgrade the Xi.elseExploitation stageEmploy equations (14) to upgrade the Xi.end ifend forend fort=t+1end whileDisplay the optimal agentXb.


## 3.4. ID3 Based Classification

Lastly, the ID3 architecture receives the feature vector as input and carries out the classification process. The ID3 technique selects test elements with computing and relating its information gains (IG). AssumeS be the group of data instances. Supposing the class element C has m distinct values that signify m various class labels Cii=1,2,…,m. Assume that Si be the amount of instances from class Cii=1,2,…,m. The predictable data amount needed for classifying S was provided in equation (15):(16)IS1,S2,…,Sm=−∑i=1mpilog2pi,where pi signifies the probability of samples from S appropriate to class Ci.IS1,S2,…,Sm refers to the average data amount needed for identifying the class label to every instance from S.Let the elementA has v distinct values a1,a2,…,aν from the trained data set S. When A is a nominal element, Afterward, the element separates S as to v subset such that S1,S2,…,Sν, in that Sj represents the subset of S where sample from Sj has the similar element value aj on A. But, instance from Sj can have various class labels [22]. Assume Sij be the group of instances that class label is Ci from the subset of Sj|A=aj,j∈1,2,…,ν,Sj∈S in which element A=aj. The needed data amount (i.e., entropy) of element A for splitting the trained data set S was measured by (16):(17)EA=∑j=1νs1j+s2j+…+smjs×Is1j,s2j,…,smj.The minimum data amount needed, a further purity of sub‐dataset is.(18)Is1j,s2j,…,smj=−∑i=1mpijlog2pij,where pij implies the probability of instances from Sj based on class Ci.Is1j,s2j,…,smj signifies the average data amount needed for identifying the class labels to every instance from Sj. The IG of A has determined as:(19)Info GainA=IS1,S2,…,Sm−EA.Specifically, the count of novel data requirement (only dependent upon class) minus the count of novel data requirements (based the split on elementA). Selecting the element with maximal Info Gain (A) as test element that is allocated to internal node from DT. During this process, the required data amount to classify samples is minimal.


## 4. Results and Discussion

The performance validation of the AORNDL-MIC technique has been validated under two dataset includes BCI competition 2003 dataset III and BCI competition IV data set 2b. The BCI competition 2003, dataset III [23], comprises 3-channel EEG data in healthy females, for the imagination of the right, and left -hand movements. The data from the analysis has of recording in the motor cortex area of brain utilizing 3 electrodes (C3, Cz, and C4) under the motor imagery of combined right-or-left-hand movement. All individual trail last to 9-second duration of data to all channels C3, Cz, and C4 per trial with every label obtainable. It holds 280 out of which 140 trials were accessible with its labels, and other 140 instances were employed for validation method. The BCI competition IV data set 2b comprises nine subjects all with 5 sessions of motor imagery experimentally, amongst that the initial 2 sessions are verified with no feedback and the remaining 3 sessions are combined online feedback [24].


### 4.1. Result Analysis on BCI Competition 2003 III Dataset

Figure3 illustrates the confusion matrices generated by the AORNDL-MIC algorithm under five iterations. At iteration-1, the AORNDL-MIC technique has identified 67 instances in left class and 68 instances in right class. Moreover, at iteration-3, the AORNDL-MIC method has identified 69 instances into left class and 68 instances into right class.Figure 3
Confusion matrix of AORNDL-MIC technique under five iterations.Furthermore, at iteration-5, the AORNDL-MIC approach has identified 67 samples into left class and 66 samples into right class.Table1 and Figures 4, 5 provides a classifier results of the AORNDL-MIC algorithm on BCI competition 2003 III dataset. The experimental result indicates the better outcomes of the AORNDL-MIC technique under each iteration. For example, with iteration-1, the AORNDL-MIC algorithm has gained precision of 97.10%, recall of 95.71%, accuracy of 94.43%, F−score of 96.40%, and kappa of 95.26%. Meanwhile, with iteration-3, the AORNDL-MIC method has reached precision of 97.18%, recall of 98.57%, accuracy of 97.86%, F−score of 97.87%, and kappa of 97.13%. Eventually, with iteration-5, the AORNDL-MIC system has obtained precision of 94.37%, recall of 95.71%, accuracy of 95%, F−score of 95.04%, and kappa of 93.30%.Table 1
Classification outcomes of AORNDL-MIC approach on BCI competition 2003 III datasets.
No. of iterationsPrecisionRecallAccuracyF-scoreKappaIteration-197.1095.7196.4396.4095.26Iteration-297.1095.7196.4396.4095.26Iteration-397.1898.5797.8697.8797.13Iteration-493.1597.1495.0095.1093.24Iteration-594.3795.7195.0095.0493.30Average95.7896.5796.1496.1694.84Figure 4
Result analysis AORNDL-MIC technique on BCI competition 2003 III datasets.Figure 5
Average analysis AORNDL-MIC technique on BCI competition 2003 III dataset.A comparative analysis of the AORNDL-MIC approach with current methodologies on the test BCI competition 2003, dataset III showed in Figure6 and Table 2. The result exhibits that the SqueezeNet, ResNet50, GoogleNet, DenseNet201, ResNet18, and ResNet101 techniques have resulted to lower kappa values of 57%, 41%, 44%, 36%, 29%, and 30% correspondingly. Next, the VGG19, AlexNet, and VGG16 models have resulted in slightly increased kappa values of 91%, 87%, and 90%, respectively. However, the proposed AORNDL-MIC technique has accomplished higher kappa value of 94.84%.Figure 6
Kappa analysis of AORNDL-MIC technique with current approaches.Table 2
Kappa analysis of AORNDL-MIC technique with existing approaches on test BCI competition 2003, dataset III.
MethodsKappaAORNDL-MIC94.84VGG1991.00AlexNet87.00VGG1690.00SqueezeNet57.00ResNet5041.00GoogleNet44.00DenseNet20136.00ResNet1829.00ResNet10130.00A comparative study of the AORNDL-MIC method with recent algorithms on the test BCI competition 2003, dataset III is illustrated in Table3 and Figure 7. The outcome demonstrates that the CSP-SVM, STFT-KNN, Optimized GA FKNN-LDA, Hybrid KNN, and WTSE-SVM techniques have resulted in minimum accuracy values of 82.86%, 83.57%, 84%, 84.29%, and 86.40%, respectively. Then, the Adaptive PP-Bayesian, STFT-DL, and CWTFB-TL methods have resulted in slightly maximal accuracy values of 90%, 90%, and 95.71% correspondingly. Lastly, the proposed AORNDL-MIC method has accomplished superior accuracy value of 96.14%.Table 3
Accuracy analysis of AORNDL-MIC technique with existing approaches on test BCI competition 2003, dataset III.
MethodsAccuracyHybrid KNN84.29CSP-SVM82.86Adaptive PP-Bayesian90.00STFT-KNN83.57STFT-DL90.00Optimized GA FKNN-LDA84.00WTSE-SVM86.40CWTFB-TL95.71AORNDL-MIC96.14Figure 7
Accuracy analysis of AORNDL-MIC approach with current methodologies.


### 4.2. Result Analysis on BCI Competition IV Data Set 2b Dataset

A classification results of the AORNDL-MIC method on BCI competition IV data set 2b under several subjects and runs is shown in Table4 and Figure 8. The experimental value indicates that the AORNDL-MIC algorithm has demonstrated better performance with an average accuracy of 85.33%, 84.22%, 90.11%, 87.11%, and 85.89% under runs 1–5, respectively.Table 4
Classification results of the AORNDL-MIC approach under several subjects and runs.
No. of runsS-1S-2S-3S-4S-5S-6S-7S-8S-9Avg.R-187.0085.0088.0086.0084.0076.0083.0096.0083.0085.33R-271.0083.0080.0094.0085.0079.0091.0083.0092.0084.22R-384.0096.0094.0098.0088.0090.0085.0089.0087.0090.11R-482.0091.0075.0089.0091.0092.0081.0088.0095.0087.11R-582.0081.0086.0091.0081.0087.0095.0089.0081.0085.89Avg.81.2087.2084.6091.6085.8084.8087.0089.0087.6086.53Figure 8
Training accuracy analysis of AORNDL-MIC technique.An average classification results of the AORNDL-MIC method under several subjects are portrayed in Figure9. The results showed that the AORNDL-MIC system has the ability of accomplishing improved outcomes with the maximum average accuracy of 81.20% under S-1, 87.20% under S-2, 84.60% under S3, 91.60% under S-4, and so on.Figure 9
Average training accuracy analysis of AORNDL-MIC technique.Table5 and Figure 10 provide a comparative study of the AORNDL-MIC system with current methodologies interms of accuracy. The experimental results indicated that the AORNDL-MIC technique has resulted in better results over the other methodologies under all subjects. For instance, with S-1, the AORNDL-MIC algorithm has accomplished higher performance of 81.20% whereas the CSP, FBCSP MIBIF, FBCSP MIRSR, and FDBN techniques have attained lower accuracy of 66%, 68%, 70%, and 81% respectively. Moreover, with S-5, the AORNDL-MIC approach has reached superior accuracy of 85.80% whereas the CSP, FBCSP MIBIF, FBCSP MIRSR, and FDBN methods have attained lesser accuracy of 77%, 93%, 93%, and 93%, respectively. Furthermore, with S-9, the AORNDL-MIC approach has gained superior accuracy of 87.60% whereas the CSP, FBCSP MIBIF, FBCSP MIRSR, and FDBN methods have achieved minimum accuracy of 83%, 88%, 87%, and 91% correspondingly.Table 5
Comparative study of AORNDL-MIC technique with recent methodologies interms of accuracy.
SubjectCSPFBCSP MIBIFFBCSP MIRSRFDBNAORNDL-MICS-166.0068.0070.0081.0081.20S-262.0059.0061.0065.0087.20S-357.0059.0061.0066.0084.60S-497.0098.0098.0098.0091.60S-577.0093.0093.0093.0085.80S-675.0080.0081.0088.0084.80S-777.0078.0078.0082.0087.00S-893.0093.0093.0094.0089.00S-983.0088.0087.0091.0087.60Average76.3379.5680.2284.2286.53Figure 10
Accuracy analysis of AORNDL-MIC technique with recent methods.For ensuring the improvement of AORNDL-MIC model, an average accuracy analysis is also made in Figure11. From the figure, it is apparent that the CSP and FBCSP MIBIF techniques have reached lower performance with an average accuracy of 76.33% and 79.56% respectively. In line with, the FBCSP MIRSR and FDBN systems have resulted in moderately increased average accuracy of 80.22% and 84.22% respectively. However, the AORNDL-MIC approach has gained effective performance over the other methodologies with the maximal average accuracy of 86.53%. By observing the experimental results and discussion, it is confirmed that the AORNDL-MIC approach has shown better results over the other methodologies.Figure 11
Average Accuracy analysis of AORNDL-MIC algorithm with current methodologies.


## 4.1. Result Analysis on BCI Competition 2003 III Dataset

Figure3 illustrates the confusion matrices generated by the AORNDL-MIC algorithm under five iterations. At iteration-1, the AORNDL-MIC technique has identified 67 instances in left class and 68 instances in right class. Moreover, at iteration-3, the AORNDL-MIC method has identified 69 instances into left class and 68 instances into right class.Figure 3
Confusion matrix of AORNDL-MIC technique under five iterations.Furthermore, at iteration-5, the AORNDL-MIC approach has identified 67 samples into left class and 66 samples into right class.Table1 and Figures 4, 5 provides a classifier results of the AORNDL-MIC algorithm on BCI competition 2003 III dataset. The experimental result indicates the better outcomes of the AORNDL-MIC technique under each iteration. For example, with iteration-1, the AORNDL-MIC algorithm has gained precision of 97.10%, recall of 95.71%, accuracy of 94.43%, F−score of 96.40%, and kappa of 95.26%. Meanwhile, with iteration-3, the AORNDL-MIC method has reached precision of 97.18%, recall of 98.57%, accuracy of 97.86%, F−score of 97.87%, and kappa of 97.13%. Eventually, with iteration-5, the AORNDL-MIC system has obtained precision of 94.37%, recall of 95.71%, accuracy of 95%, F−score of 95.04%, and kappa of 93.30%.Table 1
Classification outcomes of AORNDL-MIC approach on BCI competition 2003 III datasets.
No. of iterationsPrecisionRecallAccuracyF-scoreKappaIteration-197.1095.7196.4396.4095.26Iteration-297.1095.7196.4396.4095.26Iteration-397.1898.5797.8697.8797.13Iteration-493.1597.1495.0095.1093.24Iteration-594.3795.7195.0095.0493.30Average95.7896.5796.1496.1694.84Figure 4
Result analysis AORNDL-MIC technique on BCI competition 2003 III datasets.Figure 5
Average analysis AORNDL-MIC technique on BCI competition 2003 III dataset.A comparative analysis of the AORNDL-MIC approach with current methodologies on the test BCI competition 2003, dataset III showed in Figure6 and Table 2. The result exhibits that the SqueezeNet, ResNet50, GoogleNet, DenseNet201, ResNet18, and ResNet101 techniques have resulted to lower kappa values of 57%, 41%, 44%, 36%, 29%, and 30% correspondingly. Next, the VGG19, AlexNet, and VGG16 models have resulted in slightly increased kappa values of 91%, 87%, and 90%, respectively. However, the proposed AORNDL-MIC technique has accomplished higher kappa value of 94.84%.Figure 6
Kappa analysis of AORNDL-MIC technique with current approaches.Table 2
Kappa analysis of AORNDL-MIC technique with existing approaches on test BCI competition 2003, dataset III.
MethodsKappaAORNDL-MIC94.84VGG1991.00AlexNet87.00VGG1690.00SqueezeNet57.00ResNet5041.00GoogleNet44.00DenseNet20136.00ResNet1829.00ResNet10130.00A comparative study of the AORNDL-MIC method with recent algorithms on the test BCI competition 2003, dataset III is illustrated in Table3 and Figure 7. The outcome demonstrates that the CSP-SVM, STFT-KNN, Optimized GA FKNN-LDA, Hybrid KNN, and WTSE-SVM techniques have resulted in minimum accuracy values of 82.86%, 83.57%, 84%, 84.29%, and 86.40%, respectively. Then, the Adaptive PP-Bayesian, STFT-DL, and CWTFB-TL methods have resulted in slightly maximal accuracy values of 90%, 90%, and 95.71% correspondingly. Lastly, the proposed AORNDL-MIC method has accomplished superior accuracy value of 96.14%.Table 3
Accuracy analysis of AORNDL-MIC technique with existing approaches on test BCI competition 2003, dataset III.
MethodsAccuracyHybrid KNN84.29CSP-SVM82.86Adaptive PP-Bayesian90.00STFT-KNN83.57STFT-DL90.00Optimized GA FKNN-LDA84.00WTSE-SVM86.40CWTFB-TL95.71AORNDL-MIC96.14Figure 7
Accuracy analysis of AORNDL-MIC approach with current methodologies.


## 4.2. Result Analysis on BCI Competition IV Data Set 2b Dataset

A classification results of the AORNDL-MIC method on BCI competition IV data set 2b under several subjects and runs is shown in Table4 and Figure 8. The experimental value indicates that the AORNDL-MIC algorithm has demonstrated better performance with an average accuracy of 85.33%, 84.22%, 90.11%, 87.11%, and 85.89% under runs 1–5, respectively.Table 4
Classification results of the AORNDL-MIC approach under several subjects and runs.
No. of runsS-1S-2S-3S-4S-5S-6S-7S-8S-9Avg.R-187.0085.0088.0086.0084.0076.0083.0096.0083.0085.33R-271.0083.0080.0094.0085.0079.0091.0083.0092.0084.22R-384.0096.0094.0098.0088.0090.0085.0089.0087.0090.11R-482.0091.0075.0089.0091.0092.0081.0088.0095.0087.11R-582.0081.0086.0091.0081.0087.0095.0089.0081.0085.89Avg.81.2087.2084.6091.6085.8084.8087.0089.0087.6086.53Figure 8
Training accuracy analysis of AORNDL-MIC technique.An average classification results of the AORNDL-MIC method under several subjects are portrayed in Figure9. The results showed that the AORNDL-MIC system has the ability of accomplishing improved outcomes with the maximum average accuracy of 81.20% under S-1, 87.20% under S-2, 84.60% under S3, 91.60% under S-4, and so on.Figure 9
Average training accuracy analysis of AORNDL-MIC technique.Table5 and Figure 10 provide a comparative study of the AORNDL-MIC system with current methodologies interms of accuracy. The experimental results indicated that the AORNDL-MIC technique has resulted in better results over the other methodologies under all subjects. For instance, with S-1, the AORNDL-MIC algorithm has accomplished higher performance of 81.20% whereas the CSP, FBCSP MIBIF, FBCSP MIRSR, and FDBN techniques have attained lower accuracy of 66%, 68%, 70%, and 81% respectively. Moreover, with S-5, the AORNDL-MIC approach has reached superior accuracy of 85.80% whereas the CSP, FBCSP MIBIF, FBCSP MIRSR, and FDBN methods have attained lesser accuracy of 77%, 93%, 93%, and 93%, respectively. Furthermore, with S-9, the AORNDL-MIC approach has gained superior accuracy of 87.60% whereas the CSP, FBCSP MIBIF, FBCSP MIRSR, and FDBN methods have achieved minimum accuracy of 83%, 88%, 87%, and 91% correspondingly.Table 5
Comparative study of AORNDL-MIC technique with recent methodologies interms of accuracy.
SubjectCSPFBCSP MIBIFFBCSP MIRSRFDBNAORNDL-MICS-166.0068.0070.0081.0081.20S-262.0059.0061.0065.0087.20S-357.0059.0061.0066.0084.60S-497.0098.0098.0098.0091.60S-577.0093.0093.0093.0085.80S-675.0080.0081.0088.0084.80S-777.0078.0078.0082.0087.00S-893.0093.0093.0094.0089.00S-983.0088.0087.0091.0087.60Average76.3379.5680.2284.2286.53Figure 10
Accuracy analysis of AORNDL-MIC technique with recent methods.For ensuring the improvement of AORNDL-MIC model, an average accuracy analysis is also made in Figure11. From the figure, it is apparent that the CSP and FBCSP MIBIF techniques have reached lower performance with an average accuracy of 76.33% and 79.56% respectively. In line with, the FBCSP MIRSR and FDBN systems have resulted in moderately increased average accuracy of 80.22% and 84.22% respectively. However, the AORNDL-MIC approach has gained effective performance over the other methodologies with the maximal average accuracy of 86.53%. By observing the experimental results and discussion, it is confirmed that the AORNDL-MIC approach has shown better results over the other methodologies.Figure 11
Average Accuracy analysis of AORNDL-MIC algorithm with current methodologies.


## 5. Conclusion

In this study, an AORNDL-MIC system was developed to categorize MI on BCIs. The proposed AORNDL-MIC technique encompasses a series of operations namely MSPCA based denoising, CWT based decomposition, RetinaNet based feature extraction, AOA based hyperparameter, and ID3 based classification. The AOA is employed to tune the hyperparameter of RetinaNet and improves the classification performance of the AORNDL-MIC technique. For ensuring the outcome of the AORNDL-MIC method, a number of experiments were performed and the outcome is examined under different aspects. The experiment results of the AORNDL-MIC algorithm on the benchmark datasets reported its promising outcome over the current state of art approaches. In the future, hybrid DL model can be utilized for boosting the efficacy of the MI classification process.



---

*Source: 3987494-2022-03-24.xml*