# Stationary subspace analysis

Stationary Subspace Analysis (SSA)[1] is a blind source separation algorithm which factorizes a multivariate time series into stationary and non-stationary components.

## Introduction

In many settings, the measured time series contains contributions from various underlying sources that cannot be measured directly. For instance, in EEG analysis, the electrodes on the scalp record the activity of a large number of sources located inside the brain.[2] These sources can be stationary or non-stationary, but they are not discernible in the electrode signals, which are a mixture of these sources. SSA allows the separation of the stationary from the non-stationary sources in an observed time series.

According to the SSA model,[1] the observed multivariate time series $x(t)$ is assumed to be generated as a linear superposition of stationary sources $s^\mathfrak{s}(t)$ and non-stationary sources $s^\mathfrak{n}(t)$,

$x(t) = A s(t) = \begin{bmatrix} A^\mathfrak{s} & A^\mathfrak{n} \end{bmatrix} \begin{bmatrix} s^\mathfrak{s}(t) \\ s^\mathfrak{n}(t) \\ \end{bmatrix},$

where $A$ is an unknown but time-constant mixing matrix; $A^\mathfrak{s}$ and $A^\mathfrak{n}$ are the basis of the stationary and non-stationary subspace respectively.

Given samples from the time series $x(t)$, the aim of Stationary Subspace Analysis is to estimate the inverse mixing matrix $A^{-1}$ separating the stationary from non-stationary sources in the mixture $x(t)$.

## Identifiability of the solution

The true stationary sources $s^\mathfrak{s}(t)$ are identifiable (up to a linear transformation) and the true non-stationary subspace $A^\mathfrak{n}$ is identifiable. The true non-stationary sources $s^\mathfrak{n}(t)$ and the true stationary subspace $A^\mathfrak{s}$ cannot be identified, because arbitrary contributions from the stationary sources do not change the non-stationary nature of a non-stationary source[1]

## Applications and extensions

Stationary subspace analysis has been successfully applied to Brain-computer interfacing,[3] computer vision[4] and temporal segmentation. There are variants of the SSA problem that can be solved analytically in closed form, without numerical optimization.[5]