The invention relates to a direct neural interface, usually referred to by the English acronym BCI, standing for Brain Computer Interface, to allow the control of an automated effector, for example a robot or an exoskeleton, by cortical electrophysiological signals.
The field of direct neural interfaces is developing rapidly and appears to be an appealing solution for enabling the handicapped to control effectors by thought. It entails recording, generally with the aid of cortical electrodes, electrophysiological signals. The latter are processed by algorithms making it possible to extract a control signal, to control effectors. The control signal can allow the driving of an exoskeleton, of a computer or of a robot, so as to provide assistance to the user. The algorithms implemented allow translation of an instruction given by the user, this instruction being sensed, by the electrodes, in the form of signals termed electrophysiological since they are representative of the electrical activity of the neurons. This electrical activity is generally measured at the level of the cortex, by means of cortical electrodes disposed in the braincase. It can also be measured by electroencephalography electrodes, which are less intrusive since they are disposed on the scalp, but also less efficacious, in particular at the spatial resolution level. Another solution is to record the electrophysiological signals by magnetoencephalography, this requiring a dedicated facility.
The algorithms implemented are generally based on a predictive model. The predictive model uses input data, obtained by preprocessing the recorded electrophysiological signals. The input data are generally multidimensional, and comprise:
These various components form a block of multidimensional data, comprising a large number of data, that must be processed in real time or in quasi-real time to obtain an output signal representative of an action controlled by the user. The data measured, at each acquisition time interval, can be grouped together in the form of a tensor of dimension 3, so-called input tensor, each dimension corresponding to a component mentioned hereinabove. Having regard to the significant number of data to be processed, predictive models based on algorithms for reducing the number of data have been implemented. U.S. Pat. No. 9,480,583 describes the application of a multivariate partial least squares linear regression scheme making it possible to establish a control signal on the basis of recorded electrophysiological signals. Such a scheme is known by the acronym “NPLS” or by the term “N-way Partial Least Squares”. The application of such a scheme has also been described in the publication Eliseyev A, Aksenova T (2013) “Recursive N-way Partial Least Squares for Brain Computer Interface” PIOS ONE July 2013, Volume 8 Issue 7 e69962. Such a scheme is also described in the document Yelisyeyev A “Brain-Computer Interface with cortical electrical activity recording” Human health and pathology, University of Grenoble, 2011.
This scheme makes it possible to form a predictive model based on a calibration phase. The calibration phase is carried out on the basis of an input calibration tensor, comprising data representative of electrophysiological signals measured during various epochs, termed calibration input data. To each epoch there corresponds output data, representative of the control signal for the effector or of a state of the effector, the output data over all the epochs forming calibration output data.
The inventors have found that on account of the variability of the brain, the duration of validity of a predictive model is limited and that it is necessary to undertake regular updates. This involves the implementation of calibration phases spaced over time, so as to acquire calibration data. Such an update may require the manipulation of a very significant number of data, combining the data of an earlier calibration and the data of a new calibration. They have proposed a calibration method, allowing an update of the prediction model, while implementing a reasonable amount of data. The calculation power necessary for the update is then reduced, as is the duration of the update.
A first subject of the invention is a method for calibrating a direct neural interface, the interface being able to acquire electrophysiological signals and to form an input tensor on the basis of the electrophysiological signals acquired, so as to establish, with the aid of a predictive model, an output tensor, intended to control an effector, the predictive model being obtained by calibration, the calibration comprising the following steps:
The forget factor can be a positive real lying strictly between 0 and 1.
During step e), the calibration parameters can comprise a collection of projection vectors, so that after the first calibration period, step e) comprises a taking into account of a collection of projection vectors resulting from the earlier calibration.
During step e) the partial least squares multivariate regression can be performed according to several iterations, to each iteration there corresponding an iteration rank, each iteration generating a model, so-called predictive model, making it possible to estimate a tensor, so-called output tensor, on the basis of an input tensor,
The predictive model can comprise a so-called prediction matrix.
Another subject of the invention is a method of controlling an effector through a direct neural interface, comprising the following steps:
The output tensor can correspond to a state of the effector desired by the user generating the electrophysiological signals. In this case, the control signals make it possible to configure the effector according to the state thus estimated.
A third subject of the invention is a direct neural interface, comprising:
Other advantages and characteristics will emerge more clearly from the description which follows of particular embodiments of the invention which are given by way of nonlimiting examples and are represented in the figures listed hereinbelow.
The effector 5 is an actuator able to perform an action under the effect of the control signal which is addressed to it. It may entail an exoskeleton, a robot, or a computer. The effector is then controlled by the electrophysiological signals acquired by the cortical electrodes 2, via an algorithm coded in the memory 4 and implemented by the processor 3. The device 1 is a direct neural interface, in the sense that it allows the control of the effector 5 by the electrophysiological signals measured by the sensors 2. The electrophysiological signals can be acquired by cortical electrodes placed in contact with the cortex, magnetoencephalography sensors or electroencephalograph electrodes.
As indicated in conjunction with the prior art, the control signal is formed by the processor 3 on the basis of the electrophysiological signals, grouped together, after preprocessing, according to a tensor, the so-called input tensor, by implementing a predictive model. The predictive model generates an output tensor, grouping together data, so-called output data, allowing the control of the effector 5. The predictive model forms the subject of learning, or calibration, during which the control signal, the so-called output signal, is trained.
In this example, the electrophysiological signals S1 . . . SI
Each electrophysiological signal acquired by an electrode forms for example the subject of a frequency analysis according to I2 frequency bands. For example, I2=15. The frequency bands lie for example between 10 kHz and 150 kHz. The frequency analysis may be for example a wavelet transform.
Each electrophysiological signal can also form the subject of a decimation, so as to extend over I1 time increments. For example, I1=10.
The electrophysiological signals, after preprocessing (frequency analysis and decimation) are grouped into blocks of input data. Each block of input data x(n), corresponding to an instant n, is three-dimensional, and of dimension I1×I2×I3. The blocks of input data x(n) can be grouped into a tensor X, the so-called input tensor, grouping together a number N consecutive blocks of input data x(n). The input tensor is of dimension N×I1×I2×I3.
To each input data block x(n) there corresponds a control signal y(n), representing the control to be addressed to effectors at the instant n. As indicated previously, a predictive model makes it possible, on the basis of the input tensor X, to obtain a so-called output tensor Y. The output tensor groups together N consecutive blocks of output data y(n), in such a way that each block of input data x(n) is associated with a block of data output y(n), the block of output data allows the formation of the control signal for one or more effectors. The output tensor can correspond to a state of the effector, for example a position of the effector, such as desired by the individual generating the electrophysiological signals. The control signals are then adapted to configure the effector according to this state.
The dimension of each block of output data can vary according to typical cases. In the example considered, each output block drives three articulations of an arm, in this instance the wrist, the elbow and the shoulder, with three degrees of freedom per articulations. Each output block y(n) is therefore a 3×3 matrix, corresponding to the state of the three articulations.
The establishment of a predictive model according to the invention is now described in conjunction with
The output calibration signals are either measured, or imposed, but they are known, in contradistinction to the phase of use of the direct neural interface, in the course of which the output signals are estimated on the basis of the input electrophysiological signals. The output calibration signals are representative of a control signal for the effector, or of a state of the effector, during the calibration. For example, a trajectory is measured or imposed on the effector, in which case the output calibration data represent the various positions of the effector during the trajectory, each position corresponding to a state of the effector. It is also possible to observe the behavior of the individual and the intentional actuation, by the latter, of the effector, in which case the output calibration data correspond to the control signal for the effector or to the state of the effector (actuated or non-actuated). For example, as described in patent U.S. Pat. No. 9,480,583, the effector is a pedal and the output calibration signal represents the actuation of the pedal by the individual.
The input calibration data constitute a so-called calibration input tensor X(t) while the output calibration data form an output calibration tensor Y(t). t designates a time period, the so-called calibration period, at which the calibration input and output data are acquired, the input and output calibration data preferably being acquired simultaneously.
Each input calibration block x(n) has dimension I1× . . . ×Ik: each of its coordinates is denoted xn,I
Each output calibration block y(n) has dimension J1× . . . ×Jm: each of its coordinates is denoted yn,J
Step 100: constitution of the calibration tensors X(t) and Y(t).
The dimension of the input calibration tensor X(t) is N×I1× . . . ×Ik.
The dimension of the output calibration tensor Y(t) is ×J1× . . . ×Jm.
One of the particularities of the calibration is that after a first calibration period, t>1, it takes into account the earlier calibration tensors X(t−1) and Y(t−1), in the form of covariance and cross-covariance tensors. Stated otherwise, during a first calibration, corresponding to t=1, the calibration algorithm is implemented on the basis of the first calibration tensors X(t=1) and Y(t=1). During the following calibrations, account is taken of the, so-called current, calibration tensors acquired at a period t, the so-called current period, during which each calibration is performed. These calibrations take account of the covariance tensors established on the basis of the earlier calibration tensors X(t−1), Y(t−1) obtained at an earlier calibration period prior to the current period. The contribution of the earlier calibration tensors is however weighted by a forget factor λ, as described in conjunction with step 140.
Step 110: normalization: the calibration tensors X(t) and Y(t) are preferentially normalized, in such a way that each of their terms is centered and reduced with respect to an average value and to a standard deviation. Accordingly, a so-called effective number of observations is determined: N(t)=λN(t−1)+N(t) and a weighted sum
and a weighted quadratic sum
are calculated respectively according to the expressions:
where xn,i
During the first calibration (t=1), the first term of each expression is zero.
It is then possible to establish an average value
and a standard deviation
of the terms xn,i
In an identical manner, it is possible to establish an average and a standard deviation of the terms yn,j
The normalization consists in centering and reducing each term xn,i
Step 120: calculation of the covariance tensor and of the cross-covariance tensor.
The covariance tensor is:
CXX(t)=X(t)×1X(t) (10)
CXY(t)=X(t)×1Y(t) (11)
×1 designates the tensor product according to mode 1, described in the literature, in particular in the thesis mentioned in the prior art.
Step 130: taking into account of a previous calibration.
This step is a key step of the method, since it allows account to be taken of data used during a previous calibration phase, the taking into account of this history being weighted by a forget factor λ. The forget factor λ is a real lying strictly between 0 and 1.
Thus, when a calibration is carried out at a current calibration period t, it takes account of a previous calibration, carried out at an earlier calibration period t−1. The method thus makes it possible to perform an updating of calibrations, each calibration taking into account a calibration performed previously. The taking into account of the history is weighted by the forget factor λ. The smaller it is, the less the history is taken into account.
During the first calibration period, (t=1), CXX(t=1)=X(t=1)×1X(t=1) and CXY(t=1)=X(t=1)×1Y(t=1).
Step 140: updating of the predictive model
In the course of this step, the predictive model is updated by applying an algorithm known by the acronym NPLS (N-Partial Least Squares), signifying partial least squares multivariate regression, to the cross-covariance and covariance tensors resulting from step 130. The algorithm followed is an iterative algorithm, according to the principles described in the publication Dayal B. “Improved PLS Algorithms”, Journal of Chemometrics, Vol. 11, 73-85 (1997), and more precisely the modified algorithm number 2 appended to said publication. This iterative algorithm makes it possible to obtain, at each iteration f:
f is the rank of the iteration. It entails an integer lying between 1 and a maximum number of iteration F, the latter being for example equal to 200.
The detail of this step, and the obtaining of the magnitudes listed hereinabove, are described subsequently, in conjunction with
Subsequent to this step, one has a predictive model allowing the estimation Ŷf of an output tensor Y on the basis of an input tensor X according to the expression:
Ŷf={tilde over (B)}fX+Y0f (14)
The notation Ŷf designates the fact that the tensor Ŷ is estimated according to the predictive model, in this instance the matrix {tilde over (B)}f and the bias tensor Y0f that are defined in the course of iteration f.
It is noted that in contradistinction to the prior art, the input and output tensors allowing the implementation of the NPLS algorithm of are not input tensors X and Y obtained respectively with measured input and output calibration data blocks, as is described in patent U.S. Pat. No. 9,480,583. The invention implements:
The dimension of the tensors on the basis of which the iterative calibration is carried out is therefore reduced with respect to the prior art, in which the input and output calibration tensors are respectively X(t) and Y(t), whose respective dimensions are N×I1× . . . ×Ik and N×J1× . . . ×Jm.
Step 140 is carried out by incrementing the iteration rank f until a maximum iteration rank F is reached.
Step 150: end of algorithm. One then has a predictive model corresponding to each iteration rank f, calibrated on the basis of the calibration tensors X(t) and Y(t) the calibration being carried out with the aid of an earlier calibration tensor X(t−1) and Y(t−1), and more precisely with the aid of the covariance and cross-covariance tensors resulting from the earlier calibration.
The predictive calibration model can be updated on the basis of new calibration tensors X(t+1) and Y(t+1), by repeating steps 100 to 150, while incrementing the calibration period t.
The updating frequency is variable. The inventors have found that it is preferable to carry out, initially, various successive calibrations, by considering so-called initial calibration tensors Xini and Yini of large dimension, with N=7000. Such calibration tensors are acquired according to a long initial calibration duration, that may for example last more than 10 minutes. Indeed, because of the decimation, each time increment is spaced 100 ms apart. An acquisition duration N=7000 corresponds to 7000 data blocks x(n) and y(n), acquired according to a sliding acquisition duration of 1 s, each block being offset from the previous or following block by 100 ms. In the course of the initial calibration, each tensor Xini and Yini is segmented into 70 segments X(t=1) . . . X(t=70) and Y(t=1) . . . Y(t=70), or buffer, each segment comprising N=100 input and output calibration data blocks of x(n) and y(n). Each segment X(t) and Y(t) constitutes respectively an input and output calibration tensor. Thus, steps 100 to 150 hereinbelow are repeated successively, by considering each calibration tensor X(t) and Y(t) with 1≤t≤70.
On completion of these 70 successive iterative calibrations, one has a robust prediction model, that can be updated regularly for example daily or several times a day, by a short calibration sequence, requiring few data blocks x(n) and y(n), for example N=100, which, in view of the duration of each block (1 s) and of the offset between each block (100 ms), corresponds to a duration of 10 seconds. During the calibration, the user performs predetermined movements, so as to train the state of the output effector.
Between each calibration, the predictive model is used so as to estimate a state of the output tensor Y corresponding to an input tensor X by implementing the prediction expression (14). The main steps, described in
Step 200: acquisition of electrophysiological signals, preprocessing, obtaining of blocks of input data x(n) to form input tensor X
Step 210: normalization of the input tensor, as described in conjunction with step 110.
Step 220: estimation of the output tensor, Ŷf by applying the expression (14). The use of the expression (14) requires the choice of an iteration rank f. This choice may be arbitrary, by being defined, generally once and for all, on the basis of preliminary trials. The output tensor thus estimated makes it possible to obtain control signals for controlling the effector 5. For example, the output tensor comprises a state of the effector desired by the user, and the control signals formed make it possible to attain this state.
The inventors have found that during the use of the predictive model, that is to say during the estimation of an output tensor Ŷf on the basis of a measured tensor X, it is possible to determine an optimal iteration rank f, this optimal number being denoted F*
The main steps of the determination of the optimal number F* are described hereinafter in conjunction with
Step 300: initialization: f=1
Step 310: estimation Ŷf(t) of Y(t) by using a prediction matrix {tilde over (B)}f(t−1) obtained during the previous calibration: Ŷ(t)=X(t){tilde over (B)}f(t−1)+Y0f
Step 320: calculation of an error corresponding to iteration rank f, according to the expression:
eft=γeft−1+Error(Ŷf(t),Y(t))
Error (Ŷf(t),Y(t)) represents an error of estimation of Y(t), for example a quadratic error.
When t=1 (subsequent to the first calibration), eft=1=Error(Ŷf(t=1), Y(t=1)). γ is a forget factor, independent of the forget factor γ considered during steps 100 to 150, lying strictly between 0 and 1.
Step 330: incrementation of f until f=F.
Step 340: determination of F*, such that F*=arg minfeft.
According to this algorithm, the optimal iteration rank F* is adjusted after each updating of the predictive model, that is to say after each calibration period. This algorithm uses the input and output calibration tensors corresponding to a current calibration period t. It consists in obtaining an estimation of the output calibration tensor Y(t), at the current period, by applying a predictive model, ({{tilde over (B)}f}f=1F
Ŷf=F*={tilde over (B)}f=F*X+Y0f=F* (15)
The inventors have experimentally tested the algorithm for determining the optimal iteration rank F* after 70 calibrations, each calibration being carried out on a buffer of 100 data blocks (N=100). Accordingly, use has been made of calibration signals measured on a monkey, by a matrix of 64 cortical electrodes. The calibration signals measured by the electrodes are processed, so as to form the input calibration tensor X(t) such as described previously. The movements of the 3 articulations of an arm of the monkey were recorded and form the output calibration tensor Y(t).
The input data are the input calibration X(t) and output calibration Y(t) tensors, as well as projection vectors {w1f . . . wkf}f=1F
Sub-step 141: Initialization: the internal matrices P, Q and R, defined hereinafter, are initialized to 0. P∈(I
(J
(I
(I
(I
Sub-step 142: Calculation of eigenvectors. If m>1 (m is the order of the output tensor), we determine the eigenvector {tilde over (q)} corresponding to the highest eigenvalue of a matrix consisting of the product of the matrices CXX(t)
Sub-step 143: Formation of a tensor C on the basis of a matrix C formed by a matrix product CXY(t)q.: C=CXY(t){tilde over (q)}. C∈(I
Sub-step 144: Decomposition by parallel factorial analysis of the tensor C formed during step 143 by considering the projection vectors {w1f, . . . wn f}t−1 of an earlier calibration, or the projection vectors initialized to 1 during the first calibration.
Sub-step 145: formation of a tensor w=w1f∘ . . . ∘wnf and formation of a vector w∈(I
Sub-step 146: formation of the regression vector.
Sub-step 147: determination of internal vectors p and q, and updating of internal matrices P and Q and R.
P(:,f)=p; Q(:,f)=q; R(:,f)=r
Sub-step 148: Deflation.
CXY(t)=CXY(t)−(rTCXX(t)r)pqT
Sub-step 149: Updating of the matrices formation of the prediction matrix Bf: Bf=R(:,1:f) Q(:,1:f)T
The prediction matrix can form the subject of a normalization. Each term bi
and
being defined in equations (6) and (4) respectively.
Each coefficient {tilde over (b)}i
Moreover, the algorithm generates the bias tensor Y0f, each term
of which is defined by the expression:
the quantities
and
being defined in expressions (4) and (3).
The output data of the algorithm are those described in conjunction with step 140.
| Number | Date | Country | Kind |
|---|---|---|---|
| 1663473 | Dec 2016 | FR | national |
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/FR2017/053818 | 12/22/2017 | WO |
| Publishing Document | Publishing Date | Country | Kind |
|---|---|---|---|
| WO2018/122518 | 7/5/2018 | WO | A |
| Number | Name | Date | Kind |
|---|---|---|---|
| 9480583 | Aksenova et al. | Nov 2016 | B2 |
| 20140031952 | Harshbarger | Jan 2014 | A1 |
| Entry |
|---|
| International Search Report dated Mar. 23, 2018 in PCT/FR2017/053818 filed Dec. 22, 2017. |
| Number | Date | Country | |
|---|---|---|---|
| 20190320924 A1 | Oct 2019 | US |