Common spatial pattern

Common spatial pattern (CSP) is a mathematical procedure used in signal processing for separating a multivariate signal into additive subcomponents which have maximum differences in variance between two windows.^[1]

Let X 1 {\displaystyle \mathbf {X} _{1}} of size ( n , t 1 ) {\displaystyle (n,t_{1})} and X 2 {\displaystyle \mathbf {X} _{2}} of size ( n , t 2 ) {\displaystyle (n,t_{2})} be two windows of a multivariate signal, where n {\displaystyle n} is the number of signals and t 1 {\displaystyle t_{1}} and t 2 {\displaystyle t_{2}} are the respective number of samples.

The CSP algorithm determines the component w T {\displaystyle \mathbf {w} ^{\text{T}}} such that the ratio of variance (or second-order moment) is maximized between the two windows:

w = arg ⁡ max w ‖ w X 1 ‖ 2 ‖ w X 2 ‖ 2 {\displaystyle \mathbf {w} ={\arg \max }_{\mathbf {w} }{\frac {\left\|\mathbf {wX} _{1}\right\|^{2}}{\left\|\mathbf {wX} _{2}\right\|^{2}}}}

The solution is given by computing the two covariance matrices:

R 1 = X 1 X 1 T t 1 {\displaystyle \mathbf {R} _{1}={\frac {\mathbf {X} _{1}\mathbf {X} _{1}^{\text{T}}}{t_{1}}}}

R 2 = X 2 X 2 T t 2 {\displaystyle \mathbf {R} _{2}={\frac {\mathbf {X} _{2}\mathbf {X} _{2}^{\text{T}}}{t_{2}}}}

Then, the simultaneous diagonalization of those two matrices (also called generalized eigenvalue decomposition) is realized. We find the matrix of eigenvectors P = [ p 1 ⋯ p n ] {\displaystyle \mathbf {P} ={\begin{bmatrix}\mathbf {p} _{1}&\cdots &\mathbf {p} _{n}\end{bmatrix}}} and the diagonal matrix D {\displaystyle \mathbf {D} } of eigenvalues { λ 1 , ⋯ , λ n } {\displaystyle \{\lambda _{1},\cdots ,\lambda _{n}\}} sorted by decreasing order such that:

P T R 1 P = D {\displaystyle \mathbf {P} ^{\mathrm {T} }\mathbf {R} _{1}\mathbf {P} =\mathbf {D} }

and

P T R 2 P = I n {\displaystyle \mathbf {P} ^{\mathrm {T} }\mathbf {R} _{2}\mathbf {P} =\mathbf {I} _{n}}

with I n {\displaystyle \mathbf {I} _{n}} the identity matrix.

This is equivalent to the eigendecomposition of R 2 − 1 R 1 {\displaystyle \mathbf {R} _{2}^{-1}\mathbf {R} _{1}} :

R 2 − 1 R 1 = P D P − 1 {\displaystyle \mathbf {R} _{2}^{-1}\mathbf {R} _{1}=\mathbf {PDP} ^{-1}}

w T {\displaystyle \mathbf {w} ^{\text{T}}} will correspond to the first column of P {\displaystyle \mathbf {P} } :

w = p 1 T {\displaystyle \mathbf {w} =\mathbf {p} _{1}^{\text{T}}}

The eigenvectors composing P {\displaystyle \mathbf {P} } are components with variance ratio between the two windows equal to their corresponding eigenvalue:

λ i = ‖ p i T X 1 ‖ 2 ‖ p i T X 2 ‖ 2 {\displaystyle \mathbf {\lambda } _{i}={\frac {\left\|\mathbf {p} _{i}^{\text{T}}\mathbf {X} _{1}\right\|^{2}}{\left\|\mathbf {p} _{i}^{\text{T}}\mathbf {X} _{2}\right\|^{2}}}}

The vectorial subspace E i {\displaystyle E_{i}} generated by the i {\displaystyle i} first eigenvectors [ p 1 ⋯ p i ] {\displaystyle {\begin{bmatrix}\mathbf {p} _{1}&\cdots &\mathbf {p} _{i}\end{bmatrix}}} will be the subspace maximizing the variance ratio of all components belonging to it:

E i = arg ⁡ max E ( min p ∈ E ‖ p T X 1 ‖ 2 ‖ p T X 2 ‖ 2 ) {\displaystyle E_{i}={\arg \max }_{E}{\begin{pmatrix}\min _{p\in E}{\frac {\left\|\mathbf {p^{\text{T}}X} _{1}\right\|^{2}}{\left\|\mathbf {p^{\text{T}}X} _{2}\right\|^{2}}}\end{pmatrix}}}

On the same way, the vectorial subspace F j {\displaystyle F_{j}} generated by the j {\displaystyle j} last eigenvectors [ p n − j + 1 ⋯ p n ] {\displaystyle {\begin{bmatrix}\mathbf {p} _{n-j+1}&\cdots &\mathbf {p} _{n}\end{bmatrix}}} will be the subspace minimizing the variance ratio of all components belonging to it:

F j = arg ⁡ min F ( max p ∈ F ‖ p T X 1 ‖ 2 ‖ p T X 2 ‖ 2 ) {\displaystyle F_{j}={\arg \min }_{F}{\begin{pmatrix}\max _{p\in F}{\frac {\left\|\mathbf {p^{\text{T}}X} _{1}\right\|^{2}}{\left\|\mathbf {p^{\text{T}}X} _{2}\right\|^{2}}}\end{pmatrix}}}

CSP can be applied after a mean subtraction (a.k.a. "mean centering") on signals in order to realize a variance ratio optimization. Otherwise CSP optimizes the ratio of second-order moment.

• The standard use consists on choosing the windows to correspond to two periods of time with different activation of sources (e.g. during rest and during a specific task).
• It is also possible to choose the two windows to correspond to two different frequency bands in order to find components with specific frequency pattern.^[2] Those frequency bands can be on temporal or on frequential basis. Since the matrix P {\displaystyle \mathbf {P} } depends only of the covariance matrices, the same results can be obtained if the processing is applied on the Fourier transform of the signals.
• Y. Wang ^[3] has proposed a particular choice for the first window X 1 {\displaystyle \mathbf {X} _{1}} in order to extract components which have a specific period. X 1 {\displaystyle \mathbf {X} _{1}} was the mean of the different periods for the examined signals.
• If there is only one window, R 2 {\displaystyle \mathbf {R} _{2}} can be considered as the identity matrix and then CSP corresponds to Principal component analysis.

Linear discriminant analysis (LDA) and CSP apply in different circumstances. LDA separates data that have different means, by finding a rotation that maximizes the (normalized) distance between the centers of the two sets of data. On the other hand, CSP ignores the means. Thus CSP is good, for example, in separating the signal from the noise in an event-related potential (ERP) experiment because both distributions have zero mean and there is no distinction for LDA to separate. Thus CSP finds a projection that makes the variance of the components of the average ERP as large as possible so the signal stands out above the noise.

The CSP method can be applied to multivariate signals in generally, is commonly found in application to electroencephalographic (EEG) signals. Particularly, the method is often used in brain–computer interfaces to retrieve the component signals which best transduce the cerebral activity for a specific task (e.g. hand movement).^[4] It can also be used to separate artifacts from EEG signals.^[2]

CSP can be adapted for the analysis of the event-related potentials.^[5]

• Blind signal separation