Although promising from numerous applications, current brain-computer interfaces (BCIs) still suffer from a number of limitations. In particular, they are sensitive to noise, outliers and the non-stationarity of electroencephalographic (EEG) signals, they require long calibration times and are not reliable. Thus, new approaches and tools, notably at the EEG signal processing and classification level, are necessary to address these limitations. Riemannian approaches, spearheaded by the use of covariance matrices, are such a very promising tool slowly adopted by a growing number of researchers. This article, after a quick introduction to Riemannian geometry and a presentation of the BCI-relevant manifolds, reviews how these approaches have been used for EEG-based BCI, in particular for feature representation and learning, classifier design and calibration time reduction. Finally, relevant challenges and promising research directions for EEG signal classification in BCIs are identified, such as feature tracking on manifold or multi-task learning.
28 February 2022 in IEEE Transactions on Biomedical Engineering
Objective: Relying on the idea that functional connectivity provides important insights on the underlying dynamic of neuronal interactions, we propose a novel framework that combines functional connectivity estimators and covariance-based pipelines to improve the classification of mental states, such as motor imagery. Methods: A Riemannian classifier is trained for each estimator and an ensemble classifier combines the decisions in each feature space. A thorough assessment of the functional connectivity estimators is provided and the best performing pipeline among those tested, called FUCONE, is evaluated on different conditions and datasets. Results: Using a meta-analysis to aggregate results across datasets, FUCONE performed significantly better than all state-of-the-art methods. Conclusion: The performance gain is mostly imputable to the improved diversity of the feature spaces, increasing the robustness of the ensemble classifier with respect to the inter- and intra-subject variability. Significance: Our results offer new insights into the need to consider functional connectivity-based methods to improve the BCI performance.
Conditional preference networks (CP-nets) provide a compact and intuitive graphical tool to represent the preferences of a user. However, learning such a structure is known to be a difficult problem due to its combinatorial nature. We propose, in this paper, a new, efficient, and robust query-based learning algorithm for acyclic CP-nets. In particular, our algorithm takes into account the contradictions between multiple users’ preferences by searching in a principled way the variables that affect the preferences. We provide complexity results of the algorithm, and demonstrate its efficiency through an empirical evaluation on synthetic and on real databases.