Daniel Baumgarten

Jinlong Dong, Milana Komosar, Johannes Vorwerk et al.

The common spatial pattern (CSP) approach is known as one of the most popular spatial filtering techniques for EEG classification in motor imagery (MI) based brain-computer interfaces (BCIs). However, it still suffers some drawbacks such as sensitivity to noise, non-stationarity, and limitation to binary classification.Therefore, we propose a novel spatial filtering framework called scaCSP based on the scatter matrices of spatial covariances of EEG signals, which works generally in both binary and multi-class problems whereas CSP can be cast into our framework as a special case when only the range space of the between-class scatter matrix is used in binary cases.We further propose subspace enhanced scaCSP algorithms which easily permit incorporating more discriminative information contained in other range spaces and null spaces of the between-class and within-class scatter matrices in two scenarios: a nullspace components reduction scenario and an additional spatial filter learning scenario.The proposed algorithms are evaluated on two data sets including 4 MI tasks. The classification performance is compared against state-of-the-art competing algorithms: CSP, Tikhonov regularized CSP (TRCSP), stationary CSP (sCSP) and stationary TRCSP (sTRCSP) in the binary problems whilst multi-class extensions of CSP based on pair-wise and one-versus-rest techniques in the multi-class problems. The results show that the proposed framework outperforms all the competing algorithms in terms of average classification accuracy and computational efficiency in both binary and multi-class problems.The proposed scsCSP works as a unified framework for general multi-class problems and is promising for improving the performance of MI-BCIs.

Markus Haltmeier, Gerhard Zangerl, Peter Schier et al.

Magnetorelaxometry imaging is a novel tool for quantitative determination of the spatial distribution of magnetic nanoparticle inside an organism. The use of multiple excitation patterns has been demonstrated to significantly improve spatial resolution. However, increasing the number of excitation patterns is considerably more time consuming, because several sequential measurements have to be performed. In this paper, we use compressed sensing in combination with sparse recovery to reduce the total measurement time and to improve spatial resolution. For image reconstruction, we propose using the Douglas-Rachford splitting algorithm applied to the sparse Tikhonov functional including a positivity constraint. Our numerical experiments demonstrate that the resulting algorithm is capable to accurately recover the magnetic nanoparticle distribution from a small number of activation patterns. For example, our algorithm applied with 10 activations yields half the reconstruction error of quadratic Tikhonov regularization applied with 50 activations, for a tumor-like phantom.