2017
DOI: 10.1109/tnsre.2016.2627016
|View full text |Cite
|
Sign up to set email alerts
|

Riemannian Approaches in Brain-Computer Interfaces: A Review

Abstract: 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 matrice… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
240
0
3

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
3
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 297 publications
(243 citation statements)
references
References 63 publications
0
240
0
3
Order By: Relevance
“…A more recent single-step approach consists in learning directly from spatially correlated power-spectra with linear models and Riemannian geometry (Barachant et al, 2011Yger et al, 2017). This mathematical framework provides principles to correct for the geometric distortions arising from linear mixing of non-linear sources.…”
Section: State-of-the Art Approaches To Predict From M/eeg Observationsmentioning
confidence: 99%
“…A more recent single-step approach consists in learning directly from spatially correlated power-spectra with linear models and Riemannian geometry (Barachant et al, 2011Yger et al, 2017). This mathematical framework provides principles to correct for the geometric distortions arising from linear mixing of non-linear sources.…”
Section: State-of-the Art Approaches To Predict From M/eeg Observationsmentioning
confidence: 99%
“…In order to compute a distance of a newly arriving ERP trial sample from the above mentioned class-characterizing mean covariance matrix k an appropriate metric, allowing a simple discrimination, is employed. A point on a Riemannian manifold represents the symmetric positive definite matrix (Barachant et al, 2012; Barachant and Congedo, 2014; Yger et al, 2016). …”
Section: Methodsmentioning
confidence: 99%
“…Number of iterations N ; Weights α, β, ρ; Dimensionality of the shared subspace, p. Output:Ŷ T ∈ R nT ×l , the labels for {X T,i } nT i=1 . Calculate the covariance matrices {P S,i } nS i=1 and their mean matrix M in the source domain, using (6), (7), or (8); (14); Map each P ′ S,i to a tangent space feature vector x S,i ∈ R d×1 using (19) Then, the transferability of Source Domain S i is computed as:…”
Section: Algorithm 1: Manifold Embedded Knowledge Transfer (Mekt)mentioning
confidence: 99%