1. Introduction {#sec1}
===============

EEG signal is widely used for exploring the human brain activity and is preferred over other physiological signals because they can be used to detect directly brain electrical activity changes over spans of millisecond time, whereas functional magnetic resonance imaging (fMRI) has time resolutions in seconds or minutes. Usually, EEG signal suffers from various motion artifacts generated at the capturing time. There are two main sources of artifact in neural signals other than the machine and environment. These are the muscular and ocular activities of the individual which generate low-amplitude, low-frequency electrical pulses that fall in filter range of sensors and recording equipment.

The EEG signal is contaminated by various artifacts as electrocardiogram (ECG), electrooculogram (EOG), and electromyogram (EMG). The EMG artifact is of more interest as it is having higher amplitude, broad spectrum, and variable topographical distribution than EEG signal \[[@B1]\]. The EMG artifacts have lower autocorrelation than EEG signal due to its wide frequency spectrum. Moreover, these artifacts resemble as temporal white noise. Therefore, artifact rejection is a fundamental research topic and is well researched in \[[@B2]\]. The EEMD is a data-driven and noise-assisted approach which is applied to remove motion artifacts from single-channel EEG signal \[[@B3]\].

A component-based automated separator of artifacts is required to linearly decompose the signals into source components. The components give the individual nature of information, where artifact information combines into separate sources and reconstruction of signals without these sources are claimed as artifact-free information. The performance of blind source separation (BSS) methods as independent component analysis (ICA) and CCA for EEG signal eye blink artifact removal is compared in \[[@B4]\] and concluded that CCA is more accurate and faster than ICA. The CCA algorithm performs better than ICA for muscle artifact removal because these artifacts are generated due to movement of body muscle group. Moreover, these artifacts do not represent stereotyped topography \[[@B5]\]. Anastasiadou et al. \[[@B6]\] applied CCA algorithm to remove muscle artifact from EEG signal. Moreover, artifact removal approach is improved by applying WT after CCA algorithm for automatic detection and removal of muscle artifact from EEG signal \[[@B7]\]. The cascaded combination of EEMD and CCA techniques is applied for single-channel EEG artifact removal in \[[@B8], [@B9]\]. The single-channel EEG signal is converted into the multidimensional signal by EEMD technique. In CCA, a second-order statistics is applied to segregate the artifact components from the input signal and its performance is compared and presented better in comparison of existing wavelet denoising and EEMD-ICA cascaded algorithms. Chen et al. \[[@B10]\] have improved the filtering approach by applying EEMD and MCCA (multiset CCA) to remove EMG with more computational time. To remove ocular artifacts automatically, the cascaded combination of CCA and WT algorithms is proposed in \[[@B11]\] and demonstrated that the proposed method removes artifacts significantly with preserving neural activity of the original signal. Safieddine et al. \[[@B12]\] suggested that EEMD algorithm outperforms over other stochastic and deterministic artifact removal approaches and WT algorithm performs well in the case of less noisy data.

An efficient cascaded approach EEMD-CCA-SWT is found successful for EEG motion artifact removal \[[@B13]\]. The combination of EEMD, CCA, and SWT approaches has been applied for effective suppression of the motion artifact from EEG signal. This three-stage cascaded approach removes the artifacts effectively with increased computational cost. This computational complexity is reduced in this research paper by developing an existing correlation-based algorithm with Gaussian elimination (GE) and inserted at the cascade of EEMD-SWT, leading to EEMD-GECCA-SWT which is the combination of EEMD and an improved approach GECCA (Gaussian elimination canonical correlation analysis) with SWT. This increased computational cost is effectively reduced due to applying GECCA approach in place of CCA. The left matrix division applied in GECCA allows better estimates for the matrix inversion; therefore, it improves the SWT filtering efficiency and thus improves the overall efficiency of the EEG motion artifact removal.

The paper organization is as the following. The artifact removal methods are recalled in [Section 2](#sec2){ref-type="sec"}, and then the proposed algorithm is discussed in [Section 3](#sec3){ref-type="sec"}. Details of applied EEG dataset is given in [Section 4](#sec4){ref-type="sec"}; results obtained by methods are presented, compared in tabular form, and detailed discussed in [Section 5](#sec5){ref-type="sec"}. Finally, conclusion is in [Section 6](#sec6){ref-type="sec"}.

2. Artifact Removal Methods {#sec2}
===========================

2.1. Ensemble Empirical Mode Decomposition {#sec2.1}
------------------------------------------

The EEMD algorithm decomposes a signal into a number of intrinsic mode functions (IMFs) through an iterative method termed as sifting \[[@B12]\]. At first level, the IMF1 is the mean of upper and lower envelop of original EEG signal *X*(*t*). Then residual signal is obtained by subtracting IMF1 from *X*(*t*). This process is iterated till stopping criterion is fulfilled (residual signal energy content is close to zero). The remaining residual signal is $$\begin{matrix}
{P_{n}\left( t \right) = P_{n - 1}\left( t \right) - {IMF}_{n}\left( t \right),} \\
\end{matrix}$$where *P*~*n*~(*t*) = *X*(*t*).

Finally, the signal is reconstructed by adding all IMFs and residual signal as $$\begin{matrix}
{X\left( t \right) = P_{n}\left( t \right) + \sum\limits_{i = 1}^{N}{IMF}_{i}\left( t \right).} \\
\end{matrix}$$

2.2. Gaussian Elimination Canonical Correlation Analysis (GECCA) {#sec2.2}
----------------------------------------------------------------

The standard existing CCA algorithm starts with an assumption that *X*\[*n*\] and *Y*\[*n*\] are two sets of random variables \[[@B4]\]. *X*\[*n*\] is the input vector of matrix and *Y*\[*n*\] is defined as temporally correlated by 2-D valid convolution operator from *X*\[*n*\] vectors using the linear convolution mask \[1 0 1\] as $$\begin{matrix}
{Y\left\lbrack n \right\rbrack = conv2\left( {X,\left\lbrack {1\, 0\, 1} \right\rbrack} \right).} \\
\end{matrix}$$

Merging both input vectors as $$\begin{matrix}
{Z = \left\lbrack {X;Y} \right\rbrack.} \\
\end{matrix}$$

If *ρ* is the maximum canonical correlation, *Cxx*, *Cyy* are auto covariances of vectors *X* and *Y*, respectively, and *Cxy* and *Cyx* are the cross covariance between vectors *X* and *Y*. The various possible correlation matrixes are $$\begin{matrix}
{Cxx = C\left( {1:sx,1:sx} \right) + \beta \ast eye\left( {sx} \right),} \\
\end{matrix}$$where *sx* is the size of the *X*, *sy* is the size of the *Y*, *β* is the predefined small residual constant which is set to 10^−8^ in this paper which is used by standard CCA method \[[@B2]\], and eye is the identity matrix with diagonal terms as 1 and all other terms are zero. The term *β*∗eye(*sx*) is used in order to set and maintain the initial nonzero value of the covariance matrix *Cxx*. The small value of *β* does not affect the covariance matrix values much. $$\begin{matrix}
{Cxy = C\left( {1:sx,sx + 1:sx + sy} \right),} \\
{Cyx = Cxy^{\prime},} \\
{Cyy = C\left( {sx + 1:sx + sy,sx + 1:sx + sy} \right) + ç \ast eye\left( {sy} \right),} \\
{{Cyy}^{- 1} = inv\left( {Cyy} \right).} \\
\end{matrix}$$

Two different canonical solutions are obtained from *Z* by calculating the covariance as $$\begin{matrix}
{C = \text{cov}\left( {Z.^{\prime}} \right).} \\
\end{matrix}$$

This is equivalent to two linear equations in *X* and *Y* vector directions, respectively, as $$\begin{matrix}
{p\left\lbrack n \right\rbrack = a \ast X\left\lbrack n \right\rbrack,} \\
{q\left\lbrack n \right\rbrack = b \ast Y\left\lbrack n \right\rbrack,} \\
\end{matrix}$$where *a* and *b* are weight vectors and *p*\[*n*\] and *q*\[*n*\] are canonical variates correspondent to *X*\[*n*\] and *Y*\[*n*\], respectively.

The maximum correlation between variables *a* and *b* are calculated as \[[@B8]\] $$\begin{matrix}
{\text{max}\left( \rho \right) = \frac{a^{T}C_{xy}b}{\sqrt{a^{T}C_{xx}a}\sqrt{b^{T}C_{yy}b}}.} \\
\end{matrix}$$

Now, the demixing matrix *W* is calculated by simplifying ([9](#EEq2){ref-type="disp-formula"}) as $$\begin{matrix}
{\rho^{2}a = inv\left( {Cxx} \right) \ast Cxy \ast inv\left( {Cyy} \right) \ast Cyx \ast a,} \\
\end{matrix}$$$$\begin{matrix}
{\rho^{2}b = inv\left( {Cxx} \right) \ast \left( {Cxy} \right) \ast inv\left( {Cyy} \right) \ast Cyx \ast b,} \\
\end{matrix}$$where *ρ*^2^ is calculated by obtaining Eigen values (*k*) of ([10](#EEq3){ref-type="disp-formula"}) and ([11](#EEq4){ref-type="disp-formula"}) and further, *a* and *b* variables are equal to Eigen vectors for the greatest value of *k* (Eigen value).

These weight vectors *a* and *b* are replaced in ([8](#EEq1){ref-type="disp-formula"}) to calculate canonical variates *p*\[*n*\] and *q*\[*n*\]. Moreover, the demixing matrix *W* can be calculated by inverse of estimated weight vector (*W* = *a*^−1^). Finally, the source *S*\[*n*\] is estimated by applying *W* and *p*\[*n*\] or *q*\[*n*\] as $$\begin{matrix}
{S\left\lbrack n \right\rbrack = W^{\prime}\, p\left\lbrack n \right\rbrack.} \\
\end{matrix}$$

Thus, it is observed that standard CCA algorithm uses the matrix inverse operation to solve the linear equations by obtaining the maximum value of *ρ*^2^ for determining the demixing matrix *W*.

In this research paper, a fast and efficient modified CCA algorithm is proposed which uses the backslash or left matrix division operator for solving the linear ([10](#EEq3){ref-type="disp-formula"}) and ([11](#EEq4){ref-type="disp-formula"}) to calculate Eigen values. This backslash operator is fast and efficient than the inverse operator. The remaining algorithm is similar to the CCA approach. Let us define the linear ([10](#EEq3){ref-type="disp-formula"}) as $$\begin{matrix}
{G = \rho^{2} = inv\left( C_{xx} \right) \ast C_{xy} \ast inv\left( C_{yy} \right) \ast C_{yx},} \\
\end{matrix}$$$$\begin{matrix}
{G = \rho^{2} = A \ast B,} \\
\end{matrix}$$where $$\begin{matrix}
{\, A = inv\left( C_{xx} \right) \ast C_{xy} = {C_{xx}}^{- 1} \ast C_{xy},} \\
\end{matrix}$$$$\begin{matrix}
{B = inv\left( C_{yy} \right) \ast C_{yx} = {C_{yy}}^{- 1} \ast C_{yx}.} \\
\end{matrix}$$

The parameters *A* and *B* from linear ([15](#EEq7){ref-type="disp-formula"}) and ([16](#EEq8){ref-type="disp-formula"}) are defined as $$\begin{matrix}
\begin{array}{l}
{A \ast Cxx = Cxy,} \\
{B \ast Cyy = Cyx.} \\
\end{array} \\
\end{matrix}$$

Standard CCA method uses matrix inverse to obtain the value of *A* and *B*. In this paper, the left matrix division is proposed to solve these linear ([15](#EEq7){ref-type="disp-formula"}) and ([16](#EEq8){ref-type="disp-formula"}).

The left division operator as *Cxx*\\*Cxy* can be defined as a matrix division of *Cxx* into *Cxy*, which is equal to the solution of inv(*Cxx*)∗*Cxy*. If *Cxx* is an *N*-by-*N* matrix and *Cxy* is a column vector with *N* components or a matrix containing several such columns, then *A*∗*Cxx* = *Cxy* equation can be defined in terms of left division operator as *A* = *Cxx*\\*Cxy*.

The similar solution can be defined for the matrix *B*. The solution of ([15](#EEq7){ref-type="disp-formula"}) and ([16](#EEq8){ref-type="disp-formula"}) can be written as $$\begin{matrix}
{A = Cxx\backslash Cxy,} \\
\end{matrix}$$$$\begin{matrix}
{B = Cyy\backslash Cyx.} \\
\end{matrix}$$

Equations ([18](#EEq9){ref-type="disp-formula"}) and ([19](#EEq10){ref-type="disp-formula"}) suggest that the role of inverse operation is avoided to obtain the value of parameters *A* and *B*. This will simplify the equation and thus computation time too.

### 2.2.1. The Justification of Left Division Operator Employed in GECCA {#sec2.2.1}

In order to prove left division operator, the numerator and denominator are multiplied by numerator transposed as $$\begin{matrix}
{A = {Cxx}^{T} \ast Cxx\backslash{Cxx}^{T} \ast Cxy,} \\
{B = {Cyy}^{T} \ast Cyy\backslash{Cyy}^{T} \ast Cyx.} \\
\end{matrix}$$

By shuffling the order of operator by using Gaussian elimination concept, $$\begin{matrix}
{A = {Cxx}^{T} \ast \left( {Cxx \ast {Cxx}^{T}} \right)\backslash Cxy,} \\
\end{matrix}$$$$\begin{matrix}
{B = {Cyy}^{T} \ast \left( {Cyy \ast {Cyy}^{T}} \right)\backslash Cyx,} \\
\end{matrix}$$since *Cxx* and *Cyy* are *N*-by-*N* symmetric matrix and *Cxy* and *Cyx* are column vectors with *N* components or a matrix with several such columns.

Since *Cxx*∗*Cxx*^T^ = *Cyy*∗*Cyy*^T^ = 1, therefore, ([21](#EEq11){ref-type="disp-formula"}) and ([22](#EEq12){ref-type="disp-formula"}) can be written as $$\begin{matrix}
{A = {Cxx}^{T} \ast \left( 1 \right)\backslash Cxy,} \\
\end{matrix}$$$$\begin{matrix}
{B = {Cyy}^{T} \ast \left( 1 \right)\backslash Cyx.} \\
\end{matrix}$$

For symmetric and square matrix, *Cxx*^*T*^ = *Cxx* and *Cyy*^*T*^ = *Cyy*.

Then ([23](#EEq13){ref-type="disp-formula"}) and ([24](#EEq14){ref-type="disp-formula"}) are simplified as $$\begin{matrix}
{A = Cxx\backslash Cxy,} \\
\end{matrix}$$$$\begin{matrix}
{B = Cyy\backslash Cyx.} \\
\end{matrix}$$

Replacing the values of *A* and *B* from ([25](#EEq15){ref-type="disp-formula"}) and ([26](#EEq16){ref-type="disp-formula"}) to ([14](#EEq6){ref-type="disp-formula"}), the solution of *G* is obtained as $$\begin{matrix}
{G = \left( {Cxx\backslash Cxy} \right) \ast \left( {Cyy\backslash Cyx} \right).} \\
\end{matrix}$$

The value of *G* is obtained without inverse operation by just applying left division operator. This solution not only saves the computation time but also increases the efficiency of the CCA method with minimizing the error. The obtained G = *ρ*^2^ is the Eigen value with *k* in descending order, that is, *k*~1~ \> *k*~2~ \> *k*~*n*~; *a* and *b* are the Eigen vector for the greatest value of *k*.

Then the CCA component *p*\[*n*\] = \[*p*~1~, *p*~2~,..., *p*~*n*~\] are obtained by placing the vector *X*\[*n*\] in ([8](#EEq8){ref-type="disp-formula"}), and sources are expected by using the weighted demixing matrix from *X* by using ([12](#EEq12){ref-type="disp-formula"}).

If *A* is a *M* × *N* matrix with *M* ≤ *N* and *B* is a column vector with *M* components, or a matrix with several such columns, then *X* = *A*\\*B* is the solution in the least squares sense to the under or over determined system of equations *A*∗*X* = *B*. The effective rank *K* of *A* is determined from the QR decomposition with pivoting. The solution *X* is computed which has at most *K* nonzero components per column.

### 2.2.2. Benefits of GECCA over CCA Algorithm {#sec2.2.2}

The advantage of GECCA Algorithm over CCA are as follows: The operation of CCA algorithm depends on the inverse operation to find the demixing matrix. If the input matrix is not a square matrix, then this CCA algorithm fails. However, left division operator-based GECCA algorithm provides a solution if input matrix is not square.The CCA algorithm involves the inverse of the matrix for their operation. The inverse operation is computationally complex and time-consuming. However, proposed GECCA algorithm is faster than CCA for obtaining the correlation-based source separation by employing left division operator in place of inverse operation.The proposed GECCA algorithm employs left division operator. This operator allows better estimates of the matrix inversion. These efficiently estimated coefficients once applied to SWT filter improve the SWT filtering efficiency thus improving the overall efficiency of the motion artifact removal algorithm.The CCA algorithm operation is not consistent in each situation. This issue can be overcome by the proposed GECCA algorithm.

The above discussed efficient and fast correlation-based algorithm applied with WT algorithm is discussed in the subsequent section.

2.3. Wavelet Transform (WT) {#sec2.3}
---------------------------

The artifacts available in the EEG signal are suppressed with cascaded approach of EEMD and GECCA. Although, some brain actions may be disturbed due to high-frequency sensor noise and low-pass and high-pass filter components. As these noise signal frequencies will get overlap with the brain signals, then conventional filtering technique cannot be utilized and thus this WT is applied to take away unwanted noises from EEG signal \[[@B12]\].

The most frequently applied wavelet transform is discrete wavelet transform (DWT). In the case of EEG artifact removal, preserving neural information of the signal is determinant. Thus, some latest research shows that stationary wavelet transform (SWT) is a powerful tool to remove artifacts of the signal with preserving the neural information of original EEG signal \[[@B14]\].

SWT algorithm is translation invariant, so no downsampling of the data is involved. Translation-invariance is achieved by removing the down- and upsamplers as in the DWT and upsampling the filter coefficients by a factor of 2^(*j*\ −\ 1)^ at the *j*th level of the algorithm. SWT is preferred as it removes unpredictable behavior and noise randomness in the EEG signal due to the motion artifacts remaining after two-stage filtering of EEG signals. Therefore, EEG signal gets smoothened over the length with containing all their fundamental properties. Finally, proposed algorithm based on discussed algorithm is discussed in the next section.

3. Proposed Algorithm {#sec3}
=====================

The proposed artifact removal algorithm is as follows: Define the reference EEG data from the multichannel data set for correlation match.The input artifact EEG channel is passed through EEMD to decompose with 3 ensembles to convert single-channel EEG into multichannel EEG data.Generated IMFs are passed to GECCA algorithm for source separation.The GECCA output contains traces of artifacts in the form of randomness and noise. Thus, the output of GECCA is applied further to SWT algorithm for effective artifact removal. The decomposition through SWT is performed on the frequency domain of the signal with Rigrsure thresholding.Pearson\'s correlation coefficient is used for artifact recognition and their suppression and finally reconstructed to find the artifact-free signal.Parametric evolution is carried out based on SNR and correlation improvement. The correlation is carried out with respect to reference original EEG data initially defined.The parametric evaluation of the proposed method is done with existing motion artifact removal methods.

4. EEG Signal Data Set {#sec4}
======================

The EEG data is a multichannel data considered from standard MIT scalp data set with 24 channels recorded with different electrodes. This dataset is available on PhysioNet. The data is taken for 10 seconds and with 2560 samples/signals. Sampling frequency is taken as 256 Hz, and sampling interval is of 0.00390625 sec. These data samples are reduced to 16 channels to satisfy the international standard of 10--20 channels. [Figure 1()](#fig1){ref-type="fig"} shows the first 16 channels of EEG data set available online with chb01_01_edfm.mat available at PhysioNet provided by Shoeb \[[@B15]\]. It is observed from [Figure 1()](#fig1){ref-type="fig"} that each channel is recorded with different electrode having different motion characteristics.

In [Figure 1(a)](#fig1){ref-type="fig"}, the channels 1, 5, 9, and 13 correspond to the eye blinks as shown by negative high peaks (scale of 1000 and 2000). This was displayed and referenced by Shoeb \[[@B15]\]. These channels (1, 5, 9, and 13) have maximum motion or artifacts since they have higher standard deviation 172.0907, 175.417, 136.129, and 170.467, respectively. In this paper, channel numbers 4, 7, and 11 have the least artifact effects (only with scale of 200) out of the 16 channel EEG signal, this can be quantitatively justified by their lowest mean value and standard deviation (on division by 10 scale) as shown in [Figure 1(b)](#fig1){ref-type="fig"}. The channel 7 in [Figure 1(a)](#fig1){ref-type="fig"} has the smallest standard deviation (=4,364,903) and the smallest absolute mean value (=0.228125) as shown in [Figure 1(b)](#fig1){ref-type="fig"} which justifies the minimum motion artifacts. Thus, the channel number 7 is used as a reference signal for correlation-based artifact removal. This reference signal is termed as original signal in the paper.

[Figure 2](#fig2){ref-type="fig"} compares the original or reference EEG data (channel number 7) with blue color and artifactual signals (channel number 5) with red color. The channel 5 is shown here for the comparison because it has maximum standard deviation of 175.417 with maximum peak variations with eye blink. It is observed from [Figure 2](#fig2){ref-type="fig"} that raw EEG data may suffer from either muscular motion artifact (shown under green rectangle) or eye blink artifact (shown under yellow rectangle) or both of them. The eye blink artifact may cause amplitude increase about 10 times greater than the original EEG data. The EOG artifact overlaps with EEG signal in impulsive form, while muscular motions cause random broad spectrum amplitude variations. Nature of the reference EEG data with and without artifacts is clearly shown in Figures [2(b)](#fig2){ref-type="fig"} and [2(c)](#fig2){ref-type="fig"}.

The eye blink artifact may cause amplitude increase about 10 times greater than the original EEG data. The EOG artifact overlaps with EEG signal in impulsive form, while muscular motions cause random broad spectrum amplitude variations. In this paper, the muscular motion artifact signals (as in channel 5) are naturally generated at the time of EEG data capturing with electrodes. Therefore, for the sake of clarity, the enhanced version of reference and artifact signal is shown in Figures [2(b)](#fig2){ref-type="fig"} and [2(c)](#fig2){ref-type="fig"}.

5. Result and Discussion {#sec5}
========================

The novel GECCA artifact removal approach is evaluated on artifactual EEG channel number 5 and compared with CCA algorithm. Comparison of the EEG artifact removal methods for channel number 5 using CCA and GECCA along with DWT is shown in [Figure 3](#fig3){ref-type="fig"}. The EEG signal channel number 7 is considered as pure EEG signal. The comparison of the green and yellow boxes in Figures [3(a)](#fig3){ref-type="fig"} and [3(b)](#fig3){ref-type="fig"} suggests that blind source separation- (BSS-) based proposed GECCA method removes the motion artifacts significantly better than the existing CCA-based method. Green rectangles are correspondent to CCA, and yellow rectangles are correspondent to GECCA. It is observed that the eye blink peaks with GECCA-DWT are minimized to half that of the eye blink peaks with CCA-DWT (of the order of ±200 is reduced to around ±100) as mentioned in fourth row of [Figure 3](#fig3){ref-type="fig"}. Moreover, the pattern of the second blink is also much similar to the reference EEG signal after GECCA-DWT.

The SWT algorithm is more proficient for artifact removal of neural EEG signal in comparison to DWT algorithm; consequently, the efficacy of proposed BSS approach (GECCA) is also evaluated with SWT and compared with CCA-based approaches. [Figure 4](#fig4){ref-type="fig"} provides the comparison of the EEG artifact removal methods using CCA and GECCA along with SWT filtering. The artifact removal approaches are applied on channel number 5, and performance is compared with reference channel 7 EEG signal. The comparison of the respective green and yellow boxes in Figures [4(a)](#fig4){ref-type="fig"} and [4(b)](#fig4){ref-type="fig"} suggests that the proposed GECCA method removes the motion artifacts significantly better than the existing CCA-based method. In addition, the vigilant observation and comparison of the respective green rectangles in [Figure 4(a)](#fig4){ref-type="fig"} and yellow rectangles in [Figure 4(b)](#fig4){ref-type="fig"} suggests that GECCA with SWT removes the eye blink effect better than CCA-SWT. It is observed that the eye blink peaks with GECCA-SWT are minimized to half that of the eye blink peaks with CCA-SWT (of the order of ±200 is reduced to around ±100) as mentioned in the fourth row of [Figure 4](#fig4){ref-type="fig"}. This could be quantitatively even better clear in the next sections with evaluation parametric comparison encapsulated in [Table 1](#tab1){ref-type="table"}.

The 8 reconstructed signals after SWT-smoothened approach are compared for CCA and GECCA as shown in [Figure 5](#fig5){ref-type="fig"}. It is observed that GECCA method not only preserves the information but also provides better and fast estimates. This is concluded by comparing the 2nd and 4th frequency bands as shown in Figures [5(c)](#fig5){ref-type="fig"} and [5(d)](#fig5){ref-type="fig"}.

Moreover, the proposed artifact removal method (EEMD-GECCA-SWT) outputs are compared for three distinct EEG channel data, namely, Ch 9, Ch 4, and Ch 14, as presented in [Figure 6](#fig6){ref-type="fig"}. In [Figure 6](#fig6){ref-type="fig"}, blue color presents the original artifactual signal, whereas red color signal represents the filtered output by the proposed approach. It is demonstrated that proposed method of GECCA removes the eye blink artifacts and motion artifacts significantly.

In order to evaluate the performance of the proposed method, parametric evaluation is carried out as shown in [Table 1](#tab1){ref-type="table"}. The performance of artifact removal methods is carried out for CCA and GECCA methods along with DWT and SWT filtering methods. It is observed that proposed method EEMD-GECCA-SWT reduces the mean square error (MSE) by around 15.81% and improves the DSNR performance significantly. Moreover, the higher lambda (*λ*) value indicates the improved filtering performance \[[@B8]\]. [Table 1](#tab1){ref-type="table"} shows that GECCA-based artifact removal methods attain improved lambda (*λ*) value. The vigilant observation of results on [Table 1](#tab1){ref-type="table"} also presents better correlation improvement of GECCA when compared to CCA, both for DWT and SWT. The backslash operator provides better estimation efficiency. Thus, Gaussian elimination-based approach provides improved correlation by using backslash operation which is more efficient than the matrix inverse method.

The proposed method evaluation is also carried out with the receiver operation characteristic (ROC) curve parameters as shown in [Table 2](#tab2){ref-type="table"}. The positive predictive value (PPV), negative predictive value (NPV), sensitivity (Sen), and specificity (Spe) are calculated by true positive (TP), true negative (TN), false positive (FP), and false negative (FN) \[[@B16]\] as follows: $$\begin{matrix}
{Sen = \frac{TP}{TP + FN},} \\
\end{matrix}$$$$\begin{matrix}
{Spe = \frac{TN}{TN + FP},} \\
\end{matrix}$$$$\begin{matrix}
{PPV = \frac{TP}{TP + FP},\mspace{9mu}} \\
\end{matrix}$$$$\begin{matrix}
{NPV = \frac{TN}{TN + FN}.} \\
\end{matrix}$$

The true positive (TP) indicates that the sample is identified as an artifact when it was actually an artifact. False positive (FP) presents that the sample is identified as an artifact but actually it was not. The false negative (FN) is an indicator for the absence of artifact; however, the artifact was present in the sample. Moreover, true negative (TN) indicates the absence of the artifact when the artifact was actually not present.

This ROC curve is a comparison plot between true positive rate or sensitivity and false positive rate (1 − specificity) \[[@B16]\] for accurate detection of artifact from EEG signal as shown in [Figure 7()](#fig7){ref-type="fig"}.

[Figure 7(a)](#fig7){ref-type="fig"} shows comparison of CCA and GECCA approaches based on DWT. Blue and red color horizontal line indicates the sensitivity of EEMD-CCA-DWT and EEMD-GECCA-DWT artifact removal methods, respectively. The sensitivity or true artifact detection rate for CCA-based approach is 0.39961, whereas GECCA-based approach presents improved and fast response with increased value of 0.45156. However, [Figure 7(b)](#fig7){ref-type="fig"} shows SWT-based approach comparison for CCA and GECCA algorithm with the same blue and red color code. Both approaches present almost similar sensitivity 0.43438 and 0.43789, respectively, as shown in [Table 2](#tab2){ref-type="table"}. Although, GECCA-based approach performs better than CCA artifact removal algorithm. Moreover, the sensitivity is associated with accuracy of the algorithm too. All the ROC parameters as sensitivity, specificity, PPV, and NPV as mentioned above in ([28](#EEq17){ref-type="disp-formula"}), ([29](#EEq18){ref-type="disp-formula"}), ([30](#EEq19){ref-type="disp-formula"}), and ([31](#EEq20){ref-type="disp-formula"}) are calculated for EEG signal channel number 5 and tabulated for effective comparison of CCA and GECCA-based approaches as shown in [Table 2](#tab2){ref-type="table"}. It is observed that GECCA-based approach shows improved sensitivity and thus better accuracy than CCA-based approaches with both DWT and SWT filtering. Moreover, specificity, PPV, and NPV also improve by GECCA-based methods.

In addition, the efficiency of GECCA-based artifact removal approach is also evaluated by considering ROC parameters for most artifact contaminated channel numbers (1, 3, 5, 6, 9, and 14) from [Figure 1](#fig1){ref-type="fig"}. [Table 3](#tab3){ref-type="table"} encapsulates all the ROC parameters for filtering approach based on CCA and GECCA. It is observed from [Table 3](#tab3){ref-type="table"} that GECCA-based methods show improved accuracy in comparison to CCA-based method except channel 1. Similarly, specificity, PPV, and NPV parameters are also improved for most of the channel which presents the success of GECCA-based artifact removal approach.

The use of the left matrix division operator in the GECCA algorithms executes faster than the inverse matrix method used in CCA algorithm. Therefore, the proposed GECCA method is faster than the CCA. Moreover, left matrix division allows better estimates of the matrix inversion which improves the SWT filtering efficiency thus improves the overall efficiency of the Pearson\'s correlation-based artifact removal.

This execution or computation speed is evaluated by elapsed time. The elapsed time comparison of DWT and SWT is shown in [Figure 8(a)](#fig8){ref-type="fig"} suggesting that SWT is faster than DWT. [Figure 8(b)](#fig8){ref-type="fig"} compares the elapsed time for GECCA and CCA with SWT. This presents that GECCA with SWT algorithm computation time is faster than CCA with SWT approach.

[Figure 8(a)](#fig8){ref-type="fig"} suggests that SWT is faster than DWT approach for artifact removal. Thus, SWT elapsed time is evaluated with CCA and GECCA approaches and concluded that GECCA approach with SWT is faster and efficient for EEG artifact removal.

6. Conclusion {#sec6}
=============

The measurement and processing of EEG signal result in the probability of signal contamination prominently through motion artifacts which can obstruct the important features and information quality existing in the original EEG signal. To diagnose the human neurological diseases like epilepsy, tumors, and problems associated with trauma \[[@B15]\], these artifacts must be properly pruned assuring that there is no loss of the main attributes of EEG signals. Thus, a novel algorithm GECCA is introduced in cascade with EEMD and SWT for fast and effective suppression of motion artifacts from single-channel EEG signal. The proposed GECCA method uses backslash operation to solve the linear equations. This improves the computation efficiency of the methods. The application of SWT instead of DWT improves the SNR performance of the method and faster than the DWT method too. However, the proposed algorithm may give over smoothening if not properly designed. The proposed method based on GECCA is 18% faster than the conventional CCA. The various evaluation parameters as del signal to noise ratio (DSNR), lambda (*λ*), root mean square error (RMSE), and ROC parameters are employed to compare the performance of the proposed artifact removal algorithm. The ROC parameter comparison suggested that the improved accuracy is attained with GECCA algorithm except for Ch 1. The optimum evaluation result shows the success of proposed motion artifact removal method.

Conflicts of Interest
=====================

The authors declare that they have no conflicts of interest.

![(a) Multichannel EEG data set containing the muscular and eye blink motions. (b) Statistical properties of EEG channels.](JHE2017-9674712.001){#fig1}

![(a) Comparison of referenced channel 7 and artifact channel 5 for first 10 seconds. (b) Enhanced reference data channel 7. (c) Artifact channel 5 for 3-4 seconds respective to yellow rectangle.](JHE2017-9674712.002){#fig2}

![Comparisons of EEG artifact removal methods (a) with CCA and DWT and (b) with GECCA and DWT.](JHE2017-9674712.003){#fig3}

![Comparisons of EEG artifact removal methods (a) with CCA and SWT and (b) with GECCA and SWT.](JHE2017-9674712.004){#fig4}

![Reconstructed IMFs after (a) CCA-SWT, (b) GECCA-SWT, and (c) comparison of CCA and GECCA for the 2nd and 4th reconstructed EEMD (IMFs).](JHE2017-9674712.005){#fig5}

![Artifact removal consequences with the proposed (EEMD-GECCA-SWT) method.](JHE2017-9674712.006){#fig6}

![ROC plot comparison for CCA and GECCA (a) based on DWT and (b) based on SWT.](JHE2017-9674712.007){#fig7}

![(a) Elapsed time comparison for DWT and SWT approach and (b) elapsed time comparison for proposed GECCA method with CCA method.](JHE2017-9674712.008){#fig8}

###### 

Parametric comparison of the artifact removal methods with CCA and GECCA.

  Algorithm                 With DWT filtering   With SWT filtering             
  ------------------------- -------------------- -------------------- --------- ---------
  MSE                       69.3283              51.2272              70.2484   50.1366
  Correlation improvement   0.0019               0.0666               0.0103    0.0654
  Lambda                    66.8838              86.0016              66.2544   87.2759
  DSNR                      17.7248              29.0387              17.2621   30.2080

###### 

Comparison of the ROC parameters with CCA and GECCA for channel 5.

  Algorithm     DWT filtering with   SWT filtering with              
  ------------- -------------------- -------------------- ---------- ----------
  Sensitivity   0.39961              0.45156              0.43438    0.43789
  Specificity   0.74062              0.78477              0.65469    0.82656
  Accuracy      57.0117%             61.8164%             54.4531%   63.2227%
  PPV           60.6402%             67.7211%             55.7114%   71.6294%
  NPV           55.2287%             58.8632%             53.6492%   59.5218%

###### 

Comparison of ROC parameters for 6 different EEG channels for proposed method.

  Method ↓     Parameters in %   Ch 1      Ch 3      Ch 5      Ch 6      Ch 9      Ch 14
  ------------ ----------------- --------- --------- --------- --------- --------- ---------
  With GECCA   Accuracy          57.3047   59.4141   63.2227   65.3125   63.0859   63.5352
  PPV          57.18             57.0674   71.6294   75.0319   71.9241   59.802    
  NPV          55.3368           64.0936   59.5218   61.0298   59.3263   71.8612   
  With CCA     Accuracy          57.6953   58.8672   54.4531   60.2734   62.2461   61.2109
  PPV          56.0578           62.6251   55.7114   64.7422   69.3399   58.2566   
  NPV          60.546            56.8332   53.6492   57.8837   58.9597   67.4574   

[^1]: Academic Editor: João Manuel R. S. Tavares
