• Aucun résultat trouvé

Decoding Directed Brain Activity in fMRI using Support Vector Machines and Gaussian Processes

N/A
N/A
Protected

Academic year: 2021

Partager "Decoding Directed Brain Activity in fMRI using Support Vector Machines and Gaussian Processes"

Copied!
1
0
0

Texte intégral

(1)

Introduction

Methods

jschrouff@ulg.ac.be

References

On the strictly controlled exploration session, SVM and GP classification gave equivalent results: an accurate classification of the data from all subjects. On the other hand, the definition of the mental imagery session led to complex data sets, comprising more "random" activity linked to the subject's recalling activity and decision making process. Still, the best combinations of techniques were able to classify accurately the mental images from 6 out of the 9 subjects. The poor results of the 3 remaining subjects could be due to variable mental activity, too short mental event or unbalanced number of events per category.

Conclusions

[1] Haynes and Rees (2006) Nat Rev Neurosci, vol. 7, pp. 523-534.

[2] Kamitani and Tong (2005) Nature Neuroscience, vol. 8, pp. 679-685. [3] Polyn et al. (2005) Science, vol. 310, pp. 1963-1966.

[4] Friston et al. (2007) Elsevier Academic Press.

Poster number: 570

Hypnotic state

The default network

Connectivity graphs

Associating a particular behavioral, cognitive or perceptual state to a specific pattern of fMRI voxels activity is still a challenge. Decoding of brain activity is usually performed using multivariate techniques [1] in highly controlled environments containing temporally separated states [2,3]. However, everyone is aware that this does not represent realistic information processing in the brain, where many stimuli are dealt with simultaneously or in short overlapping time periods.

Aim: test a more realistic approach of brain information processing

using complex data sets.

9 healthy volunteers

(age: 19-29, mean 24.9, 4 females) 2 fMRI sessions:

- Maze exploration: temporally controlled and balanced.

- Mental Imagery: complex data set since the number and the

duration of events are user-defined. Imbalances between categories.

Using 3 types of images (the 3 classes): Faces (F), Buildings (B) and Animals (A) Preprocessing using SPM8.

Feature selection using a General Linear Model (GLM [4]) and/or Support Vector Machines (SVM, [5]). Classification using SVM or Gaussian Processes (GP, [6]). These techniques were combined into the following procedures:

- Procedure 1: GLM feature selection and SVM classification - Procedure 2: GLM feature selection and GP classification

- Procedure 3: SVM feature selection and GP classification

- Procedure 4: GLM and SVM feature selection and GP classification Accuracy measures using cross-validation (nested if needed) and an Error-Correcting Output Code approach (ECOC [7], table 1) to obtain multiclass predictions.

SVM codewords GP codewords

F-B F-A B-A F-B F-A B-A

F

1

1

0

1

1

0.5

B

-1

0

1

0

0.5

1

A

0

-1

-1

0.5

0

0

Table 1: codewords of the ECOC approach, using either binary outputs (SVM) or probabilities (GP)

For the exploration session, all procedures could significantly (p<0.01) classify the data from the 9 subjects.

For the mental imagery session, our results showed that 6 data sets out of 9 could be significantly modeled by either SVM or GP (figure). Procedures 1 and 4 performed significantly better in

terms of overall accuracy than the others.

However, it was observed that GP better modeled the less represented class (namely the building class) than SVM, leading to significant differences in class accuracies between procedures 1 and 4.

We also noted that model accuracies tended to be related to the level of imbalances on the classification task, and to task performance of the volunteers. However, no significant correlation could be found between these measures (too small sample?).

Figure: median accuracies and interquartile range for all subjects and procedures. Red line represents the 33 % chance level, while ‘n.s’ means not significant.

Results

Acknowledgments

Belgian National Research Funds (FRIA-FNRS), the University of Liège and BIAL.

1Cyclotron Research Centre, University of Liège, Belgium

2Giga-R, Systems Biology and Chemical Biology, University of Liège, Belgium

3Department of Electrical Engineering and Computer Science, University of Liège, Belgium 4Department of Neurology, Liège University Hospital, Belgium

J. Schrouff

1,3

, C. Kussé

1

, L. Wehenkel

2, 3

, P. Maquet

1, 4

and C. Phillips

1, 3

[5] Burges (1998) Data Mining and Knowledge Discovery, vol. 2, pp. 121-167. [6] Rasmussen and Williams (2006) the MIT Press.

Références

Documents relatifs

Arrest usually followed a period of surveillance and resulted in the pris-r oner s either being detained in his own house or being taken to some form of prison. He was

Classifier fusion refers to combining information after the classification or matching stage. Information to combine is the classifier output which can either be a class

Moreno, On the use of support vector machines for phonetic classification, IEEE International Conference on Acoustics, Speech and Signal Processing 2 (1999) 585–588.

The numerous simulations (as done for the first example in table 1) have allowed to choose the type of kernel (Gaussian) and to set the values of parameters C and σ (C =

For various bearing conditions, the FRF feature estimations will be different, as Figure 2 demonstrates in different colors. However, as the uncertainty exists,

In this work the most representative group of textural features are selected using two metaheuristics, namely Genetic Algorithms [7] and Particle Swarm Optimization [8]..

In this section, we explain ant system (AS) and ant colony system (ACS) in solving traveling salesman problem since we used many aspects of these approaches. We will then

Choix de la s´eparation: hyperplan qui classifie correctement les donn´ees (lorsque c’est possible) et qui se trouve “le plus loin possible de tous les exemples”..