<?xml version="1.0" encoding="utf-8"?>
<raweb xmlns:xlink="http://www.w3.org/1999/xlink" xml:lang="en" year="2016">
  <identification id="parietal" isproject="true">
    <shortname>PARIETAL</shortname>
    <projectName>Modelling brain structure, function and variability based on high-field MRI data.</projectName>
    <theme-de-recherche>Computational Neuroscience and Medecine</theme-de-recherche>
    <domaine-de-recherche>Digital Health, Biology and Earth</domaine-de-recherche>
    <urlTeam>http://team.inria.fr/parietal/</urlTeam>
    <structure_exterieure type="Labs">
      <libelle>CEA Neurospin</libelle>
    </structure_exterieure>
    <structure_exterieure type="Organism">
      <libelle>Centre CEA-Saclay</libelle>
    </structure_exterieure>
    <header_dates_team>Creation of the Project-Team: 2009 July 01</header_dates_team>
    <LeTypeProjet>Project-Team</LeTypeProjet>
    <keywordsSdN>
      <term>3.3. - Data and knowledge analysis</term>
      <term>3.3.2. - Data mining</term>
      <term>3.3.3. - Big data analysis</term>
      <term>3.4. - Machine learning and statistics</term>
      <term>3.4.1. - Supervised learning</term>
      <term>3.4.2. - Unsupervised learning</term>
      <term>3.4.4. - Optimization and learning</term>
      <term>3.4.5. - Bayesian methods</term>
      <term>3.4.6. - Neural networks</term>
      <term>3.4.7. - Kernel methods</term>
      <term>3.4.8. - Deep learning</term>
      <term>5.3.2. - Sparse modeling and image representation</term>
      <term>5.3.3. - Pattern recognition</term>
      <term>5.9.1. - Sampling, acquisition</term>
      <term>5.9.2. - Estimation, modeling</term>
      <term>5.9.6. - Optimization tools</term>
      <term>6.2.4. - Statistical methods</term>
      <term>6.2.6. - Optimization</term>
      <term>8.2. - Machine learning</term>
      <term>8.3. - Signal analysis</term>
    </keywordsSdN>
    <keywordsSecteurs>
      <term>1.3. - Neuroscience and cognitive science</term>
      <term>1.3.1. - Understanding and simulation of the brain and the nervous system</term>
      <term>1.3.2. - Cognitive science</term>
      <term>2.2.6. - Neurodegenerative diseases</term>
      <term>2.6.1. - Brain imaging</term>
    </keywordsSecteurs>
    <UR name="Saclay"/>
    <moreinfo>
      <p>The Parietal team is localized in two places: in the Alan Turing building of Inria Saclay,
and the Neurospin building of CEA Saclay.</p>
    </moreinfo>
  </identification>
  <team id="uid1">
    <person key="parietal-2014-idm31000">
      <firstname>Bertrand</firstname>
      <lastname>Thirion</lastname>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Team leader, Inria, Research Scientist,Senior Researcher</moreinfo>
      <hdr>oui</hdr>
    </person>
    <person key="parietal-2014-idm29544">
      <firstname>Philippe</firstname>
      <lastname>Ciuciu</lastname>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>CEA, Research Scientist, Senior Researcher</moreinfo>
      <hdr>oui</hdr>
    </person>
    <person key="parietal-2016-idp125376">
      <firstname>Shan</firstname>
      <lastname>Liu</lastname>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, Research Scientist, Researcher</moreinfo>
    </person>
    <person key="parietal-2014-idm28112">
      <firstname>Gaël</firstname>
      <lastname>Varoquaux</lastname>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, Research Scientist, Researcher</moreinfo>
    </person>
    <person key="parietal-2014-idm26872">
      <firstname>Matthieu</firstname>
      <lastname>Kowalski</lastname>
      <categoryPro>Enseignant</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Associate Professor,Univ. Paris XI, Faculty Member, until Aug 2016</moreinfo>
    </person>
    <person key="parietal-2015-idp66104">
      <firstname>Kamalaker Reddy</firstname>
      <lastname>Dadi</lastname>
      <categoryPro>Technique</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>CEA</moreinfo>
    </person>
    <person key="parietal-2014-idp65088">
      <firstname>Loïc</firstname>
      <lastname>Estève</lastname>
      <categoryPro>Technique</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria</moreinfo>
    </person>
    <person key="parietal-2015-idp68744">
      <firstname>Ana Luisa</firstname>
      <lastname>Grilo Pinho</lastname>
      <categoryPro>Technique</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria</moreinfo>
    </person>
    <person key="parietal-2016-idp140208">
      <firstname>Patricio</firstname>
      <lastname>Cerda Reyes</lastname>
      <categoryPro>PhD</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, from Oct 2016</moreinfo>
    </person>
    <person key="parietal-2016-idp142656">
      <firstname>Jérome</firstname>
      <lastname>Dockès</lastname>
      <categoryPro>PhD</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, from Apr 2016</moreinfo>
    </person>
    <person key="parietal-2014-idp78768">
      <firstname>Elvis</firstname>
      <lastname>Dohmatob</lastname>
      <categoryPro>PhD</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, granted by Fondation Cooper. Scient. Campus Paris Saclay-DIGITEO</moreinfo>
    </person>
    <person key="galen-2016-idp162288">
      <firstname>Loubna</firstname>
      <lastname>El Gueddari</lastname>
      <categoryPro>PhD</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Min. Ens. Sup. Recherche, from Oct 2016</moreinfo>
    </person>
    <person key="parietal-2014-idp84896">
      <firstname>Andres</firstname>
      <lastname>Hoyos Idrobo</lastname>
      <categoryPro>PhD</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria</moreinfo>
    </person>
    <person key="parietal-2015-idp80968">
      <firstname>Carole</firstname>
      <lastname>Lazarus</lastname>
      <categoryPro>PhD</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>CEA</moreinfo>
    </person>
    <person key="parietal-2015-idp82360">
      <firstname>Arthur</firstname>
      <lastname>Mensch</lastname>
      <categoryPro>PhD</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Univ. Paris XI</moreinfo>
    </person>
    <person key="parietal-2016-idp157376">
      <firstname>Darya</firstname>
      <lastname>Chyzhyk</lastname>
      <categoryPro>PostDoc</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, from Aug 2016</moreinfo>
    </person>
    <person key="parietal-2016-idp159872">
      <firstname>Joke</firstname>
      <lastname>Durnez</lastname>
      <categoryPro>PostDoc</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, from Nov 2016</moreinfo>
    </person>
    <person key="tao-2014-idp81984">
      <firstname>Daria</firstname>
      <lastname>La Rocca</lastname>
      <categoryPro>PostDoc</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>CEA</moreinfo>
    </person>
    <person key="parietal-2016-idp164848">
      <firstname>Andre</firstname>
      <lastname>Monteiro Manoel</lastname>
      <categoryPro>PostDoc</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>CEA, from Dec 2016</moreinfo>
    </person>
    <person key="parietal-2014-idp68792">
      <firstname>Mehdi</firstname>
      <lastname>Rahim</lastname>
      <categoryPro>PostDoc</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria</moreinfo>
    </person>
    <person key="parietal-2014-idp72536">
      <firstname>Régine</firstname>
      <lastname>Bricquet</lastname>
      <categoryPro>Assistant</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, until Jun 2016</moreinfo>
    </person>
    <person key="geco-2016-idp178496">
      <firstname>Tiffany</firstname>
      <lastname>Caristan</lastname>
      <categoryPro>Assistant</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, from Jun 2016</moreinfo>
    </person>
    <person key="parietal-2014-idp76328">
      <firstname>Alexandre</firstname>
      <lastname>Abraham</lastname>
      <categoryPro>AutreCategorie</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, until Sep 2016</moreinfo>
    </person>
    <person key="parietal-2016-idp177264">
      <firstname>Moritz</firstname>
      <lastname>Boos</lastname>
      <categoryPro>AutreCategorie</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, intern, from Jul 2016 until Oct 2016</moreinfo>
    </person>
    <person key="parietal-2014-idp66328">
      <firstname>Olivier</firstname>
      <lastname>Grisel</lastname>
      <categoryPro>AutreCategorie</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, Engineers</moreinfo>
    </person>
    <person key="parietal-2016-idp182224">
      <firstname>Guillaume</firstname>
      <lastname>Lemaitre</lastname>
      <categoryPro>AutreCategorie</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, Post-Doctoral Fellow, from Dec 2016</moreinfo>
    </person>
    <person key="parietal-2016-idp184720">
      <firstname>Joao</firstname>
      <lastname>Loula Guimaraes de Campos</lastname>
      <categoryPro>AutreCategorie</categoryPro>
      <research-centre>Saclay</research-centre>
      <moreinfo>Inria, intern, from Jun 2016</moreinfo>
    </person>
  </team>
  <presentation id="uid2">
    <bodyTitle>Overall Objectives</bodyTitle>
    <subsection id="uid3" level="1">
      <bodyTitle>Overall Objectives</bodyTitle>
      <p>The Parietal team focuses on mathematical methods for modeling and
statistical inference based on neuroimaging data, with a particular
interest in machine learning techniques and applications of human
functional imaging.
This general theme splits into four research axes:</p>
      <simplelist>
        <li id="uid4">
          <p noindent="true">Modeling for neuroimaging population studies,</p>
        </li>
        <li id="uid5">
          <p noindent="true">Encoding and decoding models for cognitive imaging,</p>
        </li>
        <li id="uid6">
          <p noindent="true">Statistical and machine learning methods for large-scale data,</p>
        </li>
        <li id="uid7">
          <p noindent="true">Compressed-sensing for MRI.</p>
        </li>
      </simplelist>
      <p>Parietal is also strongly involved in open-source software development
in scientific Python (machine learning) and for neuroimaging
applications.
</p>
    </subsection>
  </presentation>
  <fondements id="uid8">
    <bodyTitle>Research Program</bodyTitle>
    <subsection id="uid9" level="1">
      <bodyTitle>Inverse problems in Neuroimaging</bodyTitle>
      <p>Many problems in neuroimaging can be framed as forward and inverse
problems.
For instance, brain population imaging is concerned with the
<i>inverse problem</i> that consists in predicting individual
information (behavior, phenotype) from neuroimaging data, while the
corresponding <i>forward problem</i> boils down to explaining
neuroimaging data with the behavioral variables.
Solving these problems entails the definition of two terms: a loss
that quantifies the goodness of fit of the solution (does the model
explain the data well enough ?), and a regularization scheme that
represents a prior on the expected solution of the problem.
These priors can be used to enforce some properties on the solutions,
such as sparsity, smoothness or being piece-wise constant.</p>
      <p noindent="true">Let us detail the model used in typical inverse problem: Let
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐗</mi></math></formula> be a neuroimaging dataset as an <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>n</mi><mrow><mi>s</mi><mi>u</mi><mi>b</mi><mi>j</mi><mi>e</mi><mi>c</mi><mi>t</mi><mi>s</mi></mrow></msub><mo>,</mo><msub><mi>n</mi><mrow><mi>v</mi><mi>o</mi><mi>x</mi><mi>e</mi><mi>l</mi><mi>s</mi></mrow></msub><mo>)</mo></mrow></math></formula>
matrix, where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>n</mi><mrow><mi>s</mi><mi>u</mi><mi>b</mi><mi>j</mi><mi>e</mi><mi>c</mi><mi>t</mi><mi>s</mi></mrow></msub></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>n</mi><mrow><mi>v</mi><mi>o</mi><mi>x</mi><mi>e</mi><mi>l</mi><mi>s</mi></mrow></msub></math></formula> are the number of subjects
under study, and the image size respectively, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐘</mi></math></formula> a set of
values that represent characteristics of interest in the observed
population, written as <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>n</mi><mrow><mi>s</mi><mi>u</mi><mi>b</mi><mi>j</mi><mi>e</mi><mi>c</mi><mi>t</mi><mi>s</mi></mrow></msub><mo>,</mo><msub><mi>n</mi><mrow><mi>f</mi><mi>e</mi><mi>a</mi><mi>t</mi><mi>u</mi><mi>r</mi><mi>e</mi><mi>s</mi></mrow></msub><mo>)</mo></mrow></math></formula> matrix, where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>n</mi><mrow><mi>f</mi><mi>e</mi><mi>a</mi><mi>t</mi><mi>u</mi><mi>r</mi><mi>e</mi><mi>s</mi></mrow></msub></math></formula> is the
number of characteristics that are tested, and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>β</mi></math></formula> an array of
shape <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>n</mi><mrow><mi>v</mi><mi>o</mi><mi>x</mi><mi>e</mi><mi>l</mi><mi>s</mi></mrow></msub><mo>,</mo><msub><mi>n</mi><mrow><mi>f</mi><mi>e</mi><mi>a</mi><mi>t</mi><mi>u</mi><mi>r</mi><mi>e</mi><mi>s</mi></mrow></msub><mo>)</mo></mrow></math></formula> that represents a set of pattern-specific
maps. In the first place, we may consider the columns
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>𝐘</mi><mn>1</mn></msub><mo>,</mo><mo>.</mo><mo>.</mo><mo>,</mo><msub><mi>𝐘</mi><msub><mi>n</mi><mrow><mi>f</mi><mi>e</mi><mi>a</mi><mi>t</mi><mi>u</mi><mi>r</mi><mi>e</mi><mi>s</mi></mrow></msub></msub></mrow></math></formula> of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Y</mi></math></formula> independently, yielding
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>n</mi><mrow><mi>f</mi><mi>e</mi><mi>a</mi><mi>t</mi><mi>u</mi><mi>r</mi><mi>e</mi><mi>s</mi></mrow></msub></math></formula> problems to be solved in parallel:</p>
      <formula textype="displaymath" type="display">
        <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
          <mrow>
            <msub>
              <mi>𝐘</mi>
              <mi>i</mi>
            </msub>
            <mo>=</mo>
            <mi>𝐗</mi>
            <msub>
              <mi>β</mi>
              <mi>i</mi>
            </msub>
            <mo>+</mo>
            <msub>
              <mi>ϵ</mi>
              <mi>i</mi>
            </msub>
            <mo>,</mo>
            <mo>∀</mo>
            <mi>i</mi>
            <mo>∈</mo>
            <mrow>
              <mo>{</mo>
              <mn>1</mn>
              <mo>,</mo>
              <mo>.</mo>
              <mo>.</mo>
              <mo>,</mo>
              <msub>
                <mi>n</mi>
                <mrow>
                  <mi>f</mi>
                  <mi>e</mi>
                  <mi>a</mi>
                  <mi>t</mi>
                  <mi>u</mi>
                  <mi>r</mi>
                  <mi>e</mi>
                  <mi>s</mi>
                </mrow>
              </msub>
              <mo>}</mo>
            </mrow>
            <mo>,</mo>
          </mrow>
        </math>
      </formula>
      <p noindent="true">where the vector contains <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>β</mi><mi>i</mi></msub></math></formula> is the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>i</mi><mrow><mi>t</mi><mi>h</mi></mrow></msup></math></formula> row of
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>β</mi></math></formula>. As the problem is clearly ill-posed, it is
naturally handled in a regularized regression framework:</p>
      <formula id-text="1" id="uid10" textype="equation" type="display">
        <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
          <mrow>
            <msub>
              <mover accent="true">
                <mi>β</mi>
                <mo>^</mo>
              </mover>
              <mi>i</mi>
            </msub>
            <mo>=</mo>
            <msub>
              <mtext>argmin</mtext>
              <msub>
                <mi>β</mi>
                <mi>i</mi>
              </msub>
            </msub>
            <msup>
              <mrow>
                <mo>∥</mo>
                <msub>
                  <mi>𝐘</mi>
                  <mi>i</mi>
                </msub>
                <mo>-</mo>
                <mi>𝐗</mi>
                <msub>
                  <mi>β</mi>
                  <mi>i</mi>
                </msub>
                <mo>∥</mo>
              </mrow>
              <mn>2</mn>
            </msup>
            <mo>+</mo>
            <mi>Ψ</mi>
            <mrow>
              <mo>(</mo>
              <msub>
                <mi>β</mi>
                <mi>i</mi>
              </msub>
              <mo>)</mo>
            </mrow>
            <mo>,</mo>
          </mrow>
        </math>
      </formula>
      <p noindent="true">where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ψ</mi></math></formula> is an adequate penalization used to regularize the
solution:</p>
      <formula id-text="2" id="uid11" textype="equation" type="display">
        <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
          <mrow>
            <mi>Ψ</mi>
            <mrow>
              <mo>(</mo>
              <mi>β</mi>
              <mo>;</mo>
              <msub>
                <mi>λ</mi>
                <mn>1</mn>
              </msub>
              <mo>,</mo>
              <msub>
                <mi>λ</mi>
                <mn>2</mn>
              </msub>
              <mo>,</mo>
              <msub>
                <mi>η</mi>
                <mn>1</mn>
              </msub>
              <mo>,</mo>
              <msub>
                <mi>η</mi>
                <mn>2</mn>
              </msub>
              <mo>)</mo>
            </mrow>
            <mo>=</mo>
            <msub>
              <mi>λ</mi>
              <mn>1</mn>
            </msub>
            <msub>
              <mrow>
                <mo>∥</mo>
                <mi>β</mi>
                <mo>∥</mo>
              </mrow>
              <mn>1</mn>
            </msub>
            <mo>+</mo>
            <msub>
              <mi>λ</mi>
              <mn>2</mn>
            </msub>
            <msub>
              <mrow>
                <mo>∥</mo>
                <mi>β</mi>
                <mo>∥</mo>
              </mrow>
              <mn>2</mn>
            </msub>
            <mo>+</mo>
            <msub>
              <mi>η</mi>
              <mn>1</mn>
            </msub>
            <msub>
              <mrow>
                <mo>∥</mo>
                <mi>∇</mi>
                <mi>β</mi>
                <mo>∥</mo>
              </mrow>
              <mrow>
                <mn>2</mn>
                <mo>,</mo>
                <mn>1</mn>
              </mrow>
            </msub>
            <mo>+</mo>
            <msub>
              <mi>η</mi>
              <mn>2</mn>
            </msub>
            <msub>
              <mrow>
                <mo>∥</mo>
                <mi>∇</mi>
                <mi>β</mi>
                <mo>∥</mo>
              </mrow>
              <mrow>
                <mn>2</mn>
                <mo>,</mo>
                <mn>2</mn>
              </mrow>
            </msub>
          </mrow>
        </math>
      </formula>
      <p noindent="true">with <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>λ</mi><mn>1</mn></msub><mo>,</mo><mspace width="0.166667em"/><msub><mi>λ</mi><mn>2</mn></msub><mo>,</mo><mspace width="0.166667em"/><msub><mi>η</mi><mn>1</mn></msub><mo>,</mo><mspace width="0.166667em"/><msub><mi>η</mi><mn>2</mn></msub><mo>≥</mo><mn>0</mn></mrow></math></formula> (this
formulation particularly highlights the fact that convex regularizers
are norms or quasi-norms). In general, only one or two of these
constraints is considered (hence is enforced with a non-zero
coefficient):</p>
      <simplelist>
        <li id="uid12">
          <p noindent="true">When <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>λ</mi><mn>1</mn></msub><mo>&gt;</mo><mn>0</mn></mrow></math></formula> only (LASSO), and to some extent, when <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>λ</mi><mn>1</mn></msub><mo>,</mo><msub><mi>λ</mi><mn>2</mn></msub><mo>&gt;</mo><mn>0</mn></mrow></math></formula> only (elastic net), the optimal solution <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>β</mi></math></formula> is
(possibly very) sparse, but may not exhibit a proper image structure;
it does not fit well with the intuitive concept of a brain map.</p>
        </li>
        <li id="uid13">
          <p noindent="true">Total Variation regularization (see Fig. <ref xlink:href="#uid15" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>) is obtained for
(<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>η</mi><mn>1</mn></msub><mo>&gt;</mo><mn>0</mn></mrow></math></formula> only), and typically yields a piece-wise constant
solution. It can be associated with Lasso to enforce both sparsity and
sparse variations.</p>
        </li>
        <li id="uid14">
          <p noindent="true">Smooth lasso is obtained with (<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>η</mi><mn>2</mn></msub><mo>&gt;</mo><mn>0</mn></mrow></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>λ</mi><mn>1</mn></msub><mo>&gt;</mo><mn>0</mn></mrow></math></formula>
only), and yields smooth, compactly supported spatial basis
functions.</p>
        </li>
      </simplelist>
      <p>Note that, while the qualitative aspect of the solutions are very
different, the predictive power of these models is often very close.</p>
      <object id="uid15">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/inter_sizes_alpha1.png" type="float" width="405.6487pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Example of the regularization of a brain map with total
variation in an inverse problem. The problem here is to
predict the spatial scale of an object presented as a stimulus,
given functional neuroimaging data acquired during the presentation
of an image. Learning and test are performed across
individuals. Unlike other approaches, Total Variation regularization
yields a sparse and well-localized solution that also enjoys high
predictive accuracy.</caption>
      </object>
      <p>The performance of the predictive model can simply be evaluated as the
amount of variance in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>𝐘</mi><mi>i</mi></msub></math></formula> fitted by the model, for each <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>i</mi><mo>∈</mo><mo>{</mo><mn>1</mn><mo>,</mo><mo>.</mo><mo>.</mo><mo>,</mo><msub><mi>n</mi><mrow><mi>f</mi><mi>e</mi><mi>a</mi><mi>t</mi><mi>u</mi><mi>r</mi><mi>e</mi><mi>s</mi></mrow></msub><mo>}</mo></mrow></math></formula>.
This can be computed through cross-validation, by <i>learning</i>
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mover accent="true"><mi>β</mi><mo>^</mo></mover><mi>i</mi></msub></math></formula> on some part of the dataset, and then
estimating <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mrow><mo>∥</mo></mrow><msub><mi>𝐘</mi><mi>i</mi></msub><mo>-</mo><mi>𝐗</mi><msub><mover accent="true"><mi>β</mi><mo>^</mo></mover><mi>i</mi></msub><msup><mrow><mo>∥</mo></mrow><mn>2</mn></msup></mrow></math></formula> using the remainder of the
dataset.</p>
      <p>This framework is easily extended by considering</p>
      <simplelist>
        <li id="uid16">
          <p noindent="true"><i>Grouped penalization</i>, where the penalization explicitly
includes a prior clustering of the features, i.e. voxel-related
signals, into given groups. This amounts to enforcing structured
priors on the problem solution.</p>
        </li>
        <li id="uid17">
          <p noindent="true"><i>Combined penalizations</i>, i.e. a mixture of simple and
group-wise penalizations, that allow some variability to fit the
data in different populations of subjects, while keeping some common
constraints.</p>
        </li>
        <li id="uid18">
          <p noindent="true"><i>Logistic and hinge regression</i>, where a non-linearity is
applied to the linear model so that it yields a probability of
classification in a binary classification problem.</p>
        </li>
        <li id="uid19">
          <p noindent="true"><i>Robustness to between-subject variability</i> to avoid the
learned model overly reflecting a few outlying particular observations
of the training set. Note that noise and deviating assumptions can be
present in both <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐘</mi></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐗</mi></math></formula></p>
        </li>
        <li id="uid20">
          <p noindent="true"><i>Multi-task learning</i>: if several target variables
are thought to be related, it might be useful to constrain the
estimated parameter vector <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>β</mi></math></formula> to have a shared support across all
these variables.</p>
          <p noindent="true">For instance, when one of the variables <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>𝐘</mi><mi>i</mi></msub></math></formula> is not well fitted by
the model, the estimation of other variables <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>𝐘</mi><mi>j</mi></msub><mo>,</mo><mi>j</mi><mo>≠</mo><mi>i</mi></mrow></math></formula> may
provide constraints on the support of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>β</mi><mi>i</mi></msub></math></formula> and thus, improve the
prediction of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>𝐘</mi><mi>i</mi></msub></math></formula>.</p>
          <formula id-text="3" id="uid21" textype="equation" type="display">
            <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
              <mrow>
                <mi>𝐘</mi>
                <mo>=</mo>
                <mi>𝐗</mi>
                <mi>β</mi>
                <mo>+</mo>
                <mi>ϵ</mi>
                <mo>,</mo>
              </mrow>
            </math>
          </formula>
          <p noindent="true">then</p>
          <formula id-text="4" id="uid22" textype="equation" type="display">
            <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
              <mrow>
                <mover accent="true">
                  <mi>β</mi>
                  <mo>^</mo>
                </mover>
                <mo>=</mo>
                <msub>
                  <mtext>argmin</mtext>
                  <mrow>
                    <mi>β</mi>
                    <mo>=</mo>
                    <mrow>
                      <mo>(</mo>
                      <msub>
                        <mi>β</mi>
                        <mi>i</mi>
                      </msub>
                      <mo>)</mo>
                    </mrow>
                    <mo>,</mo>
                    <mi>i</mi>
                    <mo>=</mo>
                    <mn>1</mn>
                    <mo>.</mo>
                    <mo>.</mo>
                    <msub>
                      <mi>n</mi>
                      <mi>f</mi>
                    </msub>
                  </mrow>
                </msub>
                <munderover>
                  <mo>∑</mo>
                  <mrow>
                    <mi>i</mi>
                    <mo>=</mo>
                    <mn>1</mn>
                  </mrow>
                  <msub>
                    <mi>n</mi>
                    <mi>f</mi>
                  </msub>
                </munderover>
                <msup>
                  <mrow>
                    <mo>∥</mo>
                    <msub>
                      <mi>𝐘</mi>
                      <mi>𝐢</mi>
                    </msub>
                    <mo>-</mo>
                    <mi>𝐗</mi>
                    <msub>
                      <mi>β</mi>
                      <mi>𝐢</mi>
                    </msub>
                    <mo>∥</mo>
                  </mrow>
                  <mn>2</mn>
                </msup>
                <mo>+</mo>
                <mi>λ</mi>
                <munderover>
                  <mo>∑</mo>
                  <mrow>
                    <mi>j</mi>
                    <mo>=</mo>
                    <mn>1</mn>
                  </mrow>
                  <msub>
                    <mi>n</mi>
                    <mrow>
                      <mi>v</mi>
                      <mi>o</mi>
                      <mi>x</mi>
                      <mi>e</mi>
                      <mi>l</mi>
                      <mi>s</mi>
                    </mrow>
                  </msub>
                </munderover>
                <msqrt>
                  <mrow>
                    <msubsup>
                      <mo>∑</mo>
                      <mrow>
                        <mi>i</mi>
                        <mo>=</mo>
                        <mn>1</mn>
                      </mrow>
                      <msub>
                        <mi>n</mi>
                        <mi>f</mi>
                      </msub>
                    </msubsup>
                    <msubsup>
                      <mi>β</mi>
                      <mrow>
                        <mi>𝐢</mi>
                        <mo>,</mo>
                        <mi>𝐣</mi>
                      </mrow>
                      <mn mathvariant="bold">2</mn>
                    </msubsup>
                  </mrow>
                </msqrt>
              </mrow>
            </math>
          </formula>
        </li>
      </simplelist>
    </subsection>
    <subsection id="uid23" level="1">
      <bodyTitle>Multivariate decompositions</bodyTitle>
      <p>Multivariate decompositions provide a way to model complex
data such as brain activation images: for instance, one might be
interested in extracting an <i>atlas of brain regions</i> from a given
dataset, such as regions exhibiting similar activity during a
protocol, across multiple protocols, or even in the absence of
protocol (during resting-state).
These data can often be factorized
into spatial-temporal components, and thus can be estimated through
<i>regularized Principal Components Analysis</i> (PCA) algorithms,
which share some common steps with regularized regression.</p>
      <p noindent="true">Let <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐗</mi></math></formula> be a neuroimaging dataset written as an <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>n</mi><mrow><mi>s</mi><mi>u</mi><mi>b</mi><mi>j</mi><mi>e</mi><mi>c</mi><mi>t</mi><mi>s</mi></mrow></msub><mo>,</mo><msub><mi>n</mi><mrow><mi>v</mi><mi>o</mi><mi>x</mi><mi>e</mi><mi>l</mi><mi>s</mi></mrow></msub><mo>)</mo></mrow></math></formula> matrix, after proper centering; the model reads</p>
      <formula id-text="5" id="uid24" textype="equation" type="display">
        <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
          <mrow>
            <mi>𝐗</mi>
            <mo>=</mo>
            <mi>𝐀𝐃</mi>
            <mo>+</mo>
            <mi>ϵ</mi>
            <mo>,</mo>
          </mrow>
        </math>
      </formula>
      <p noindent="true">where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐃</mi></math></formula> represents a set of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>n</mi><mrow><mi>c</mi><mi>o</mi><mi>m</mi><mi>p</mi></mrow></msub></math></formula> spatial maps, hence a matrix
of shape <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>n</mi><mrow><mi>c</mi><mi>o</mi><mi>m</mi><mi>p</mi></mrow></msub><mo>,</mo><msub><mi>n</mi><mrow><mi>v</mi><mi>o</mi><mi>x</mi><mi>e</mi><mi>l</mi><mi>s</mi></mrow></msub><mo>)</mo></mrow></math></formula>, and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐀</mi></math></formula> the associated subject-wise
loadings.
While traditional PCA and independent components analysis are limited
to reconstructing components <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐃</mi></math></formula> within the space spanned by
the column of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐗</mi></math></formula>, it seems desirable to add some constraints
on the rows of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐃</mi></math></formula>, that represent spatial maps, such as
sparsity, and/or smoothness, as it makes the interpretation of these
maps clearer in the context of neuroimaging.
This yields the following estimation problem:</p>
      <formula id-text="6" id="uid25" textype="equation" type="display">
        <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
          <mrow>
            <msub>
              <mtext>min</mtext>
              <mrow>
                <mi>𝐃</mi>
                <mo>,</mo>
                <mi>𝐀</mi>
              </mrow>
            </msub>
            <msup>
              <mrow>
                <mo>∥</mo>
                <mi>𝐗</mi>
                <mo>-</mo>
                <mi>𝐀𝐃</mi>
                <mo>∥</mo>
              </mrow>
              <mn>2</mn>
            </msup>
            <mo>+</mo>
            <mi>Ψ</mi>
            <mrow>
              <mo>(</mo>
              <mi>𝐃</mi>
              <mo>)</mo>
            </mrow>
            <mspace width="4.pt"/>
            <mtext>s.t.</mtext>
            <mspace width="4.pt"/>
            <mrow>
              <mo>∥</mo>
              <msub>
                <mi>𝐀</mi>
                <mi>i</mi>
              </msub>
              <mo>∥</mo>
            </mrow>
            <mo>=</mo>
            <mn>1</mn>
            <mspace width="0.277778em"/>
            <mo>∀</mo>
            <mi>i</mi>
            <mo>∈</mo>
            <mrow>
              <mo>{</mo>
              <mn>1</mn>
              <mo>.</mo>
              <mo>.</mo>
              <msub>
                <mi>n</mi>
                <mrow>
                  <mi>f</mi>
                  <mi>e</mi>
                  <mi>a</mi>
                  <mi>t</mi>
                  <mi>u</mi>
                  <mi>r</mi>
                  <mi>e</mi>
                  <mi>s</mi>
                </mrow>
              </msub>
              <mo>}</mo>
            </mrow>
            <mo>,</mo>
          </mrow>
        </math>
      </formula>
      <p noindent="true">where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mrow><mo>(</mo><msub><mi>𝐀</mi><mi>i</mi></msub><mo>)</mo></mrow><mo>,</mo><mspace width="0.277778em"/><mi>i</mi><mo>∈</mo><mrow><mo>{</mo><mn>1</mn><mo>.</mo><mo>.</mo><msub><mi>n</mi><mrow><mi>f</mi><mi>e</mi><mi>a</mi><mi>t</mi><mi>u</mi><mi>r</mi><mi>e</mi><mi>s</mi></mrow></msub><mo>}</mo></mrow></mrow></math></formula> represents the columns of
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐀</mi></math></formula>. <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ψ</mi></math></formula> can be chosen such as in Eq. (<ref xlink:href="#uid11" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>) in order to
enforce smoothness and/or sparsity constraints.</p>
      <p noindent="true">The problem is not jointly convex in all the variables but each
penalization given in Eq (<ref xlink:href="#uid11" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>) yields a convex problem on
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐃</mi></math></formula> for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐀</mi></math></formula> fixed, and conversely.
This readily suggests an alternate optimization scheme, where
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐃</mi></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>𝐀</mi></math></formula> are estimated in turn, until convergence
to a local optimum of the criterion.
As in PCA, the extracted
components can be ranked according to the amount of fitted variance.
Importantly, also, estimated PCA models can be interpreted as a
probabilistic model of the data, assuming a high-dimensional Gaussian
distribution (probabilistic PCA).</p>
      <p>Utlimately, the main limitations to these algorithms is the cost due
to the memory requirements: holding datasets with large dimension and
large number of samples (as in recent neuroimaging cohorts) leads to
inefficient computation. To solve this issue, online method are
particularly attractive.
</p>
    </subsection>
    <subsection id="uid26" level="1">
      <bodyTitle>Covariance estimation</bodyTitle>
      <p>Another important estimation problem stems from the general issue of
learning the relationship between sets of variables, in particular
their covariance.
Covariance learning is essential to model the dependence of these
variables when they are used in a multivariate model, for instance to
study potential interactions between variables.
Covariance learning is necessary to model latent
interactions in high-dimensional observation spaces, e.g. when
considering multiple contrasts or functional connectivity data.</p>
      <p noindent="true">The difficulties are two-fold: on the one hand, there is a shortage of
data to learn a good covariance model from an individual subject, and
on the other hand, subject-to-subject variability poses a serious
challenge to the use of multi-subject data. While the covariance
structure may vary from population to population, or depending on the
input data (activation versus spontaneous activity), assuming some
shared structure across problems, such as their sparsity pattern, is
important in order to obtain correct estimates from noisy data. Some
of the most important models are:</p>
      <simplelist>
        <li id="uid27">
          <p noindent="true"><b>Sparse Gaussian graphical models</b>, as they express meaningful
conditional independence relationships between regions, and do
improve conditioning/avoid overfit.</p>
        </li>
        <li id="uid28">
          <p noindent="true"><b>Decomposable models</b>, as they enjoy good computational
properties and enable intuitive interpretations of the network
structure. Whether they can faithfully or not represent brain
networks is still an open question.</p>
        </li>
        <li id="uid29">
          <p noindent="true"><b>PCA-based regularization of covariance</b> which
is powerful when modes of variation are more important than
conditional independence relationships.</p>
        </li>
      </simplelist>
      <p>Adequate model selection procedures are necessary to achieve the right
level of sparsity or regularization in covariance estimation; the
natural evaluation metric here is the out-of-samples likelihood of the
associated Gaussian model.
Another essential remaining issue is to develop an adequate
statistical framework to test differences between covariance models in
different populations.
To do so, we consider different means of parametrizing covariance
distributions and how these parametrizations impact the test of
statistical differences across individuals.</p>
      <object id="uid30">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/stroke.png" type="float" width="320.25pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Example of functional connectivity analysis: The correlation
matrix describing brain functional connectivity in a post-stroke
patient (lesion volume outlined as a mesh) is compared to a group of
control subjects. Some edges of the graphical model show a
significant difference, but the statistical detection of the
difference requires a sophisticated statistical framework for the
comparison of graphical models.</caption>
      </object>
    </subsection>
  </fondements>
  <domaine id="uid31">
    <bodyTitle>Application Domains</bodyTitle>
    <subsection id="uid32" level="1">
      <bodyTitle>Cognitive neuroscience</bodyTitle>
      <subsection id="uid33" level="2">
        <bodyTitle>Macroscopic Functional cartography with functional Magnetic Resonance Imaging (fMRI)</bodyTitle>
        <p>The brain as a highly structured organ, with both functional specialization
and a complex newtork organization. While most of the knowledge
historically comes from lesion studies and animal electophysiological
recordings, the development of non-invasive imaging modalities, such
as fMRI, has made it possible to study routinely high-level cognition
in humans since the early 90's.
This has opened major questions on the interplay between mind and
brain , such as: How is the function of cortical territories constrained
by anatomy (connectivity) ? How to assess the specificity of brain regions ?
How can one characterize reliably inter-subject differences ?</p>
      </subsection>
      <subsection id="uid34" level="2">
        <bodyTitle> Analysis of brain Connectivity</bodyTitle>
        <p>Functional connectivity is defined as the interaction structure that
is underlies brain function.
Since the beginning of fMRI, it has been observed that remote regions
sustain high correlation in their spontaneous activity, i.e. in the
absence of a driving task. This means that the signals observed during
resting-state define a signature of the connectivity of brain regions.
The main interest of retsing-state fMRI is that it provides
easy-to-acquire functional markers that have recently been proved to
be very powerful for population studies.</p>
      </subsection>
      <subsection id="uid35" level="2">
        <bodyTitle>Modeling of brain processes (MEG)</bodyTitle>
        <p>While fMRI has been very useful in defining the function of regions at
the mm scale, Magneto-encephalography (MEG) provides the other piece
of the puzzle, namely temporal dynamics of brain activity, at the ms
scale. MEG is also non-invasive.
It makes it possible to keep track of precise schedule of mental
operations and their interactions. It also opens the way toward a study
of the rythmic activity of the brain.
On the other hand, the localization of brain activity with MEG entails
the solution of a hard inverse problem.
</p>
      </subsection>
    </subsection>
  </domaine>
  <logiciels id="uid36">
    <bodyTitle>New Software and Platforms</bodyTitle>
    <subsection id="uid37" level="1">
      <bodyTitle>Mayavi</bodyTitle>
      <p>
        <span class="smallcap" align="left">Functional Description</span>
      </p>
      <p>Mayavi is the most used scientific 3D visualization Python software. Mayavi can be used as a visualization tool, through interactive command line or as a library. It is distributed under Linux through Ubuntu, Debian, Fedora and Mandriva, as well as in PythonXY and EPD Python scientific distributions. Mayavi is used by several software platforms, such as PDE solvers (fipy, sfepy), molecule visualization tools and brain connectivity analysis tools (connectomeViewer).</p>
      <simplelist>
        <li id="uid38">
          <p noindent="true">Contact: Gaël Varoquaux</p>
        </li>
        <li id="uid39">
          <p noindent="true">URL: <ref xlink:href="http://mayavi.sourceforge.net/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>mayavi.<allowbreak/>sourceforge.<allowbreak/>net/</ref></p>
        </li>
      </simplelist>
    </subsection>
    <subsection id="uid40" level="1">
      <bodyTitle>Nilearn</bodyTitle>
      <p>NeuroImaging with scikit learn</p>
      <p noindent="true"><span class="smallcap" align="left">Keywords:</span> Health - Neuroimaging - Medical imaging</p>
      <p noindent="true">
        <span class="smallcap" align="left">Functional Description</span>
      </p>
      <p>NiLearn is the neuroimaging library that adapts the concepts and tools
of scikit-learn to neuroimaging problems. As a pure Python library, it
depends on scikit-learn and nibabel, the main Python library for
neuroimaging I/O. It is an open-source project, available under BSD
license. The two key components of NiLearn are i) the analysis of
functional connectivity (spatial decompositions and covariance
learning) and ii) the most common tools for multivariate pattern
analysis. A great deal of efforts has been put on the efficiency of
the procedures both in terms of memory cost and computation time.</p>
      <simplelist>
        <li id="uid41">
          <p noindent="true">Participants: Gaël Varoquaux, Bertrand Thirion, Loïc Estève, Alexandre Abraham, Michael Eickenberg, Alexandre Gramfort, Fabian Pedregosa Izquierdo, Elvis Dohmatob and Virgile Fritsch</p>
        </li>
        <li id="uid42">
          <p noindent="true">Contact: Bertrand Thirion</p>
        </li>
        <li id="uid43">
          <p noindent="true">URL: <ref xlink:href="http://nilearn.github.io/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>nilearn.<allowbreak/>github.<allowbreak/>io/</ref></p>
        </li>
      </simplelist>
    </subsection>
    <subsection id="uid44" level="1">
      <bodyTitle>PyHRF</bodyTitle>
      <p><span class="smallcap" align="left">Keywords:</span> FMRI - Statistic analysis - Neurosciences - IRM - Brain - Health - Medical imaging</p>
      <p noindent="true">
        <span class="smallcap" align="left">Functional Description</span>
      </p>
      <p>As part of fMRI data analysis, PyHRF provides a set of tools for
addressing the two main issues involved in intra-subject fMRI data
analysis : (i) the localization of cerebral regions that elicit evoked
activity and (ii) the estimation of the activation dynamics also
referenced to as the recovery of the Hemodynamic Response Function
(HRF). To tackle these two problems, PyHRF implements the Joint
Detection-Estimation framework (JDE) which recovers parcel-level HRFs
and embeds an adaptive spatio-temporal regularization scheme of
activation maps.</p>
      <simplelist>
        <li id="uid45">
          <p noindent="true">Participants: Thomas Vincent, Solveig Badillo, Lotfi Chaari, Christine Bakhous, Florence Forbes, Philippe Ciuciu, Laurent Risser, Thomas Perret and Aina Frau Pascual</p>
        </li>
        <li id="uid46">
          <p noindent="true">Partners: CEA - NeuroSpin</p>
        </li>
        <li id="uid47">
          <p noindent="true">Contact: Florence Forbes</p>
        </li>
        <li id="uid48">
          <p noindent="true">URL: <ref xlink:href="http://pyhrf.org" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>pyhrf.<allowbreak/>org</ref></p>
        </li>
      </simplelist>
    </subsection>
    <subsection id="uid49" level="1">
      <bodyTitle>Scikit-learn</bodyTitle>
      <p><span class="smallcap" align="left">Keywords:</span> Classification - Learning - Clustering - Regession - Medical imaging</p>
      <p noindent="true">
        <span class="smallcap" align="left">Scientific Description</span>
      </p>
      <p>Scikit-learn is a Python module integrating classic machine learning
algorithms in the tightly-knit scientific Python world. It aims to
provide simple and efficient solutions to learning problems,
accessible to everybody and reusable in various contexts:
machine-learning as a versatile tool for science and engineering.</p>
      <p noindent="true">
        <span class="smallcap" align="left">Functional Description</span>
      </p>
      <p>Scikit-learn can be used as a middleware for prediction tasks. For
example, many web startups adapt Scikitlearn to predict buying
behavior of users, provide product recommendations, detect trends or
abusive behavior (fraud, spam). Scikit-learn is used to extract the
structure of complex data (text, images) and classify such data with
techniques relevant to the state of the art.</p>
      <p>Easy to use, efficient and accessible to non datascience experts,
Scikit-learn is an increasingly popular machine learning library in
Python. In a data exploration step, the user can enter a few lines on
an interactive (but non-graphical) interface and immediately sees the
results of his request. Scikitlearn is a prediction engine .
Scikit-learn is developed in open source, and available under the BSD
license.</p>
      <simplelist>
        <li id="uid50">
          <p noindent="true">Participants: Olivier Grisel, Gaël Varoquaux, Bertrand Thirion, Michael Eickenberg, Loïc Estève, Alexandre Gramfort, Arthur Mensch</p>
        </li>
        <li id="uid51">
          <p noindent="true">Partners: CEA - Logilab - Nuxeo - Saint Gobain - Telecom Paris - Tinyclues</p>
        </li>
        <li id="uid52">
          <p noindent="true">Contact: Olivier Grisel</p>
        </li>
        <li id="uid53">
          <p noindent="true">URL: <ref xlink:href="http://scikit-learn.org" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>scikit-learn.<allowbreak/>org</ref></p>
        </li>
      </simplelist>
    </subsection>
  </logiciels>
  <resultats id="uid54">
    <bodyTitle>New Results</bodyTitle>
    <subsection id="uid55" level="1">
      <bodyTitle> Dictionary Learning for Massive Matrix Factorization </bodyTitle>
      <p>Sparse matrix factorization is a popular tool to obtain interpretable
data decompositions, which are also effective to perform data
completion or denoising. Its applicability to large datasets has been
addressed with online and randomized methods, that reduce the
complexity in one of the matrix dimension, but not in both of them. In
this paper, we tackle very large matrices in both dimensions. We
propose a new factoriza-tion method that scales gracefully to
terabyte-scale datasets, that could not be processed by previous
algorithms in a reasonable amount of time. We demonstrate the
efficiency of our approach on massive functional Magnetic Resonance
Imaging (fMRI) data, and on matrix completion problems for recommender
systems, where we obtain significant speed-ups compared to
state-of-the art coordinate descent methods.</p>
      <object id="uid56">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/icml.png" type="float" width="384.2974pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Brain atlases: outlines of each map obtained with dictionary
learning. Left: the reference algorithm on the full dataset.
Middle: the reference algorithm on a twentieth of the
dataset. Right: the proposed algorithm with a similar run time: half
the dataset and a compression factor of 9. Compared to a full run of
the baseline algorithm, the figure explore two possible strategies
to decrease computation time: processing less data (middle), or our
approach (right). Our approach achieves a result closer to the gold
standard in a given time budget. See <ref xlink:href="#parietal-2016-bid0" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for
more information.</caption>
      </object>
      <p>See Fig. <ref xlink:href="#uid56" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for an illustration and
<ref xlink:href="#parietal-2016-bid0" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.
</p>
    </subsection>
    <subsection id="uid57" level="1">
      <bodyTitle> Learning brain regions via large-scale online structured sparse dictionary-learning</bodyTitle>
      <p>We propose a multivariate online dictionary-learning method for
obtaining de-compositions of brain images with structured and sparse
components (aka atoms). Sparsity is to be understood in the usual
sense: the dictionary atoms are constrained to contain mostly
zeros. This is imposed via an 1-norm constraint. By "struc-tured", we
mean that the atoms are piece-wise smooth and compact, thus making up
blobs, as opposed to scattered patterns of activation. We propose to
use a Sobolev (Laplacian) penalty to impose this type of
structure. Combining the two penalties, we obtain decompositions that
properly delineate brain structures from functional images. This
non-trivially extends the online dictionary-learning work of Mairal et
al. (2010), at the price of only a factor of 2 or 3 on the overall
running time. Just like the Mairal et al. (2010) reference method, the
online nature of our proposed algorithm allows it to scale to
arbitrarily sized datasets. Experiments on brain data show that our
proposed method extracts structured and denoised dictionaries that are
more intepretable and better capture inter-subject variability in
small medium, and large-scale regimes alike, compared to
state-of-the-art models.</p>
      <object id="uid58">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/behavioral_scores_LANGUAGE.png" type="float" width="384.2974pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Predicting behavioral variables of the Human Connectome
Project dataset using subject-level brain activity maps and various
intermediate representations obtained with variants of dictionary
learning. Bold bars represent performance on test set while
faint bars in the background represent performance on train set.
See <ref xlink:href="#parietal-2016-bid1" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.</caption>
      </object>
      <p>See Fig. <ref xlink:href="#uid58" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for an illustration and
<ref xlink:href="#parietal-2016-bid1" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.
</p>
    </subsection>
    <subsection id="uid59" level="1">
      <bodyTitle> Social-sparsity brain decoders: faster spatial sparsity </bodyTitle>
      <p>Spatially-sparse predictors are good models for brain decoding: they
give accurate predictions and their weight maps are interpretable as
they focus on a small number of regions. However, the state of the
art, based on total variation or graph-net, is computationally
costly. Here we introduce sparsity in the local neighborhood of each
voxel with social-sparsity, a structured shrinkage operator. We find
that, on brain imaging classification problems, social-sparsity
performs almost as well as total-variation models and better than
graph-net, for a fraction of the computational cost. It also very
clearly outlines predictive regions. We give details of the model and
the algorithm.</p>
      <object id="uid60">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/ssparsity.png" type="float" width="384.2974pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Decoder maps for the object-classification task – Top:
weight maps for the face-versus-house task. Overall, the maps
segment the right and left parahippocampal place area (PPA), a
well-known place-specific regions, although the left PPA is weak in
TV-l1, spotty in graph-net, and absent in social sparsity. Bottom:
outlines at 0.01 of the other tasks. Beyond the PPA, several known
functional regions stand out such as primary or secondary visual
areas around the prestriate cortex as well as regions in the lateral
occipital cortex, responding to structured objects. Note that the
graphnet outlines display scattered small regions even thought the
value of the contours is chosen at 0.01, well above numerical noise.
See <ref xlink:href="#parietal-2016-bid2" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.</caption>
      </object>
      <p>See Fig. <ref xlink:href="#uid60" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for an illustration and
<ref xlink:href="#parietal-2016-bid2" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.
</p>
    </subsection>
    <subsection id="uid61" level="1">
      <bodyTitle>Deriving reproducible biomarkers from multi-site resting-state data: An Autism-based example</bodyTitle>
      <p>Resting-state functional Magnetic Resonance Imaging (R-fMRI) holds the
promise to reveal functional biomarkers of neuropsychiatric
disorders. However, extracting such biomarkers is challenging for
complex multi-faceted neuropatholo-gies, such as autism spectrum
disorders. Large multi-site datasets increase sample sizes to
compensate for this complexity, at the cost of uncontrolled
heterogeneity. This heterogeneity raises new challenges, akin to those
face in realistic diagnostic applications. Here, we demonstrate the
feasibility of inter-site classification of neuropsychiatric status,
with an application to the Autism Brain Imaging Data Exchange (ABIDE)
database, a large (N=871) multi-site autism dataset. For this purpose,
we investigate pipelines that extract the most predictive biomarkers
from the data. These R-fMRI pipelines build participant-specific
connectomes from functionally-defined brain areas. Connectomes are
then compared across participants to learn patterns of connectivity
that differentiate typical controls from individuals with autism. We
predict this neuropsychiatric status for participants from the same
acquisition sites or different, unseen, ones. Good choices of methods
for the various steps of the pipeline lead to 67% prediction accuracy
on the full ABIDE data, which is significantly better than previously
reported results. We perform extensive validation on multiple subsets
of the data defined by different inclusion criteria. These enables
detailed analysis of the factors contributing to successful
connectome-based prediction. First, prediction accuracy improves as we
include more subjects, up to the maximum amount of subjects
available. Second, the definition of functional brain areas is of
paramount importance for biomarker discovery: brain areas extracted
from large R-fMRI datasets outperform reference atlases in the
classification tasks.</p>
      <object id="uid62">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/junior.jpg" type="float" width="384.2974pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Validation of an fMRI-based pipeline for autism
prediction. Several variants are considered for each pipeline
step. See <ref xlink:href="#parietal-2016-bid3" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.</caption>
      </object>
      <p>See Fig. <ref xlink:href="#uid62" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for an illustration and
<ref xlink:href="#parietal-2016-bid3" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.
</p>
    </subsection>
    <subsection id="uid63" level="1">
      <bodyTitle>
Seeing it all: Convolutional network layers map the function of the
human visual system</bodyTitle>
      <p>Convolutional networks used for computer vision represent candidate
models for the computations performed in mammalian visual systems. We
use them as a detailed model of human brain activity during the
viewing of natural images by constructing predictive models based on
their different layers and BOLD fMRI activations. Analyzing the
predictive performance across layers yields characteristic
fingerprints for each visual brain region: early visual areas are
better described by lower level convolutional net layers and later
visual areas by higher level net layers, exhibiting a progression
across ventral and dorsal streams. Our predictive model generalizes
beyond brain responses to natural images. We illustrate this on two
experiments, namely retinotopy and face-place oppositions, by
synthesizing brain activity and performing classical brain mapping
upon it. The synthesis recovers the activations observed in the
corresponding fMRI studies, showing that this deep encoding model
captures representations of brain function that are universal across
experimental paradigms.</p>
      <object id="uid64">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/overfeat.jpg" type="float" width="384.2974pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Overview of the vision mapping experiment: Convolutional
network image representations of different layer depth explain brain
activity throughout the full ventral visual stream. This mapping
follows the known hierarchical organisation. Results from both
static images and video stimuli. A model of brain activity for the
full brain, based on the convolutional network, can synthesize brain
maps for other visual experiments. Only deep models can reproduce
observed BOLD activity. See <ref xlink:href="#parietal-2016-bid4" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more
information.</caption>
      </object>
      <p>See Fig. <ref xlink:href="#uid64" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for an illustration and
<ref xlink:href="#parietal-2016-bid4" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.
</p>
    </subsection>
    <subsection id="uid65" level="1">
      <bodyTitle> Formal Models of the Network Co-occurrence Underlying Mental Operations</bodyTitle>
      <p>Systems neuroscience has identified a set of canonical large-scale
networks in humans. These have predominantly been characterized by
resting-state analyses of the task-uncon-strained, mind-wandering
brain. Their explicit relationship to defined task performance is
largely unknown and remains challenging. The present work contributes
a multivariate statistical learning approach that can extract the
major brain networks and quantify their configuration during various
psychological tasks. The method is validated in two extensive datasets
(n = 500 and n = 81) by model-based generation of synthetic activity
maps from recombination of shared network topographies. To study a use
case, we formally revisited the poorly understood difference between
neural activity underlying idling versus goal-directed behavior. We
demonstrate that task-specific neural activity patterns can be
explained by plausible combinations of resting-state networks. The
possibility of decomposing a mental task into the relative
contributions of major brain networks, the "network co-occurrence
architecture" of a given task, opens an alternative access to the
neural substrates of human cognition.</p>
      <object id="uid66">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/pcbi.png" type="float" width="384.2974pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Task-rest correspondence: Reconstructing two similar tasks
from two different datasets based on the same resting networks. 40
sparse PCA networks were discovered from the same rest data and used
for feature engineering as a basis for classificationof 18
psychological tasks from HCP (left) and from ARCHI (right). Middle
column: Examples of resting-state networks derived from decomposing
rest data using sparse PCA. Networks B and C might be related to
semantics processing in the anterior temporal lobe, network D covers
extended parts of the parietal cortex, while networks E and F appear
to be variants of the so-called “salience” network. Left/Right
column: Examples of task-specific neural activity generated from
network co-occurrence models of the HCP/ARCHI task
batteries. Arrows: A diagnostic subanalysis indicated what rest
networks were automatically ranked top-five in distinguishing a
given task from the respective 17 other tasks. Although the
experimental tasks in the HCP and ARCHI repositories, “story versus
math” and “sentences versus computation” were the most similar
cognitive contrasts in both datasets. For these four experimental
conditions the model-derived task maps are highly
similar. Consequently, two independent classification problems in
two independent datasets with a six-fold difference in sample size
resulted in two independent explicit models that, nevertheless,
generated comparable task-specific maps. This indicated that network
co-occurrence modeling indeed captures genuine aspects of
neurobiology rather than arbitrary discriminatory aspects of the
data. See <ref xlink:href="#parietal-2016-bid5" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.</caption>
      </object>
      <p>See Fig. <ref xlink:href="#uid66" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for an illustration and
<ref xlink:href="#parietal-2016-bid5" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.
</p>
    </subsection>
    <subsection id="uid67" level="1">
      <bodyTitle>Transmodal Learning of Functional Networks for Alzheimer's Disease Prediction </bodyTitle>
      <p>Functional connectivity describes neural activity from resting-state
functional magnetic resonance imaging (rs-fMRI). This noninvasive
modality is a promising imaging biomarker of neurodegenerative
diseases, such as Alzheimer's disease (AD), where the connectome can
be an indicator to assess and to understand the pathology. However, it
only provides noisy measurements of brain activity. As a consequence,
it has shown fairly limited discrimination power on clinical
groups. So far, the reference functional marker of AD is the
fluorodeoxyglucose positron emission tomography (FDG-PET). It gives a
reliable quantification of metabolic activity, but it is costly and
invasive. Here, our goal is to analyze AD populations solely based on
rs-fMRI, as functional connectivity is correlated to metabolism. We
introduce transmodal learning: leveraging a prior from one modality to
improve results of another modality on different subjects. A metabolic
prior is learned from an independent FDG-PET dataset to improve
functional connectivity-based prediction of AD. The prior acts as a
regularization of connectivity learning and improves the estimation of
discriminative patterns from distinct rs-fMRI datasets. Our approach
is a two-stage classification strategy that combines several
seed-based connectivity maps to cover a large number of functional
networks that identify AD physiopathology. Experimental results show
that our transmodal approach increases classification accuracy
compared to pure rs-fMRI approaches, without resorting to additional
invasive acquisitions. The method successfully recovers brain regions
known to be impacted by the disease.
</p>
    </subsection>
    <subsection id="uid68" level="1">
      <bodyTitle>Assessing and tuning brain decoders: cross-validation, caveats, and guidelines </bodyTitle>
      <p>Decoding, ie prediction from brain images or signals, calls for
empirical evaluation of its predictive power. Such evaluation is
achieved via cross-validation, a method also used to tune decoders'
hyper-parameters. This paper is a review on cross-validation
procedures for decoding in neuroimaging. It includes a didactic
overview of the relevant theoretical considerations. Practical aspects
are highlighted with an extensive empirical study of the common
decoders in within-and across-subject predictions, on multiple
datasets –anatomical and functional MRI and MEG– and
simulations. Theory and experiments outline that the popular "
leave-one-out " strategy leads to unstable and biased estimates, and a
repeated random splits method should be preferred. Experiments outline
the large error bars of cross-validation in neuroimaging settings:
typical confidence intervals of 10%. Nested cross-validation can tune
decoders' parameters while avoiding circularity bias. However we find
that it can be more favorable to use sane defaults, in particular for
non-sparse decoders.</p>
      <object id="uid69">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/cv.jpg" type="float" width="384.2974pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>(Left) Illustration of the nested cross-validation
principle. (Right) Typical cross-validated accuracy result:
leave-one-out cross validation, when applied to imaging data, yields
to optimistic bias (top) when used on dependent data, and in other
cases leads to estimated with inflated variance. See
<ref xlink:href="#parietal-2016-bid6" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.</caption>
      </object>
      <p>See Fig. <ref xlink:href="#uid69" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for an illustration and
<ref xlink:href="#parietal-2016-bid6" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.
</p>
    </subsection>
    <subsection id="uid70" level="1">
      <bodyTitle>A projection algorithm for gradient waveforms design in Magnetic Resonance Imaging</bodyTitle>
      <p>Collecting the maximal amount of information in a given scanning time
is a major concern in Magnetic Resonance Imaging (MRI) to speed up
image acquisition. The hardware constraints (gradient magnitude, slew
rate, ...), physical distortions (e.g., off-resonance effects) and
sampling theorems (Shannon, compressed sensing) must be taken into
account simultaneously, which makes this problem extremely
challenging. To date, the main approach to design gradient waveform
has consisted of selecting an initial shape (e.g. spiral, radial
lines, ...) and then traversing it as fast as possible using optimal
control. In this paper, we propose an alternative solution which first
consists of defining a desired parameterization of the trajectory and
then of optimizing for minimal deviation of the sampling points within
gradient constraints. This method has various advantages. First, it
better preserves the density of the input curve which is critical in
sampling theory. Second, it allows to smooth high curvature areas
making the acquisition time shorter in some cases. Third, it can be
used both in the Shannon and CS sampling theories. Last, the optimized
trajectory is computed as the solution of an efficient iterative
algorithm based on convex programming. For piecewise linear
trajectories, as compared to optimal control reparameterization, our
approach generates a gain in scanning time of 10% in echo planar
imaging while improving image quality in terms of signal-to-noise
ratio (SNR) by more than 6 dB. We also investigate original
trajectories relying on traveling salesman problem solutions. In this
context, the sampling patterns obtained using the proposed projection
algorithm are shown to provide significantly better reconstructions
(more than 6 dB) while lasting the same scanning time.</p>
      <object id="uid71">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/reconstruction.png" type="float" width="213.5pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Reconstructed images from data collected along EPI-like
trajectories. (a)-(b): Reconstruction results from the optimally
reparameterized EPI readout. (c)-(d): Reconstructed results from
data collected using the projected EPI trajectories. See
<ref xlink:href="#parietal-2016-bid7" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.</caption>
      </object>
      <p>See Fig. <ref xlink:href="#uid71" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for an illustration and
<ref xlink:href="#parietal-2016-bid7" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.
</p>
    </subsection>
    <subsection id="uid72" level="1">
      <bodyTitle>Impact of perceptual learning on resting-state fMRI connectivity: A supervised classification study</bodyTitle>
      <p>Perceptual learning sculpts ongoing brain activity. This finding
has been observed by statistically comparing the functional
connectivity (FC) patterns computed from resting-state functional MRI
(rs-fMRI) data recorded before and after intensive training to a
visual attention task. Hence, functional connectivity serves a dynamic
role in brain function, supporting the consolidation of previous
experience. Following this line of research, we trained three groups
of individuals to a visual discrimination task during a
magneto-encephalography (MEG) experiment. The same individuals
were then scanned in rs-fMRI. Here, in a supervised classification
framework, we demonstrate that FC metrics computed on rs-fMRI data are
able to predict the type of training the participants received. On top
of that, we show that the prediction accuracies based on tangent
embedding FC measure outperform those based on our recently developed
multivariate wavelet-based Hurst exponent estimator, which
captures low frequency fluctuations in ongoing brain activity too.</p>
      <object id="uid73">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/av.png" type="float" width="384.2974pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Statistical significant functional interactions (positive
and negative values are color coded in red and blue, respectively)
within each group of individuals (V: purely visual traing, AV:
audio-visual training and AVn: unmatched audio-visual),
Bonferroni-corrected for multiple comparisons at <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>α</mi><mo>=</mo><mn>0</mn><mo>.</mo><mn>05</mn><mo>.</mo></mrow></math></formula>
See <ref xlink:href="#parietal-2016-bid8" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.</caption>
      </object>
      <p>See Fig. <ref xlink:href="#uid73" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for an illustration and
<ref xlink:href="#parietal-2016-bid8" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for more information.
</p>
    </subsection>
  </resultats>
  <contrats id="uid74">
    <bodyTitle>Bilateral Contracts and Grants with Industry</bodyTitle>
    <subsection id="uid75" level="1">
      <bodyTitle>Bilateral Grants with Industry</bodyTitle>
      <subsection id="uid76" level="2">
        <bodyTitle>The Wendelin FUI project</bodyTitle>
        <p>The Wendelin project has been granted on December 3rd, 2014. It has
been selected at the <i>Programme d’Investissements d’Avenir (PIA)</i>
that supports "cloud computing et Big Data".
It gives visibility and fosters the French technological big data
sector, and in particular the scikit-learn library, the NoSQL “NEO”
et the decentralized “SlapOS” cloud, three open-source software
supported by the Systematic <i>pôle de compétitivité</i>.</p>
        <p>Scikit-learn is a worldwide reference library for machine
learning. Gaël Varoquaux, Olivier Grisel and Alexandre Gramfort have
been major players in the design of the library and Scikit-learn has
then been supported by the growing scientific Python community.
It is currently used by major internet companies as well as dynamic
start-ups, including Google, Airbnb, Spotify, Evernote, AWeber,
TinyClues; it wins more than half of the data science "Kaggle"
competitions.
Scikit-learn makes it possible to predict future outcomes given a
training data, and thus to optimize company decisions.
Almost 1 million euros will be invested to improve the
algorithmic core of scikit-learn through the Wendelin project thanks to
the Inria, ENS and Institut Mines Télécom teams.
In particular, scikit-learn will be extended in order to ease online
prediction and to include recent stochastic gradient algorithms.</p>
        <p>NEO is the native NoSQL base of the Python language. It was initially
designed by Nexedi and is currently used and embedded in the main
software of company information systems. More than one million euros
will be invested into NEO, so that scikit-learn can process within 10
years (out-of-core) data of 1 exabyte size.</p>
        <p>Paris13 university and the Mines Télécom institute will extend the
SlapOS distributed mesh cloud to deploy Wendelin in <i>Big Data as
a Service</i> (BDaaS) mode, to achieve the interoperability between the
Grid5000 and Teralab infrastructures and to extend the cloud toward
smart sensor systems.</p>
        <p>The combination of scikit-learn, NEO and SlapOS will improve the
predictive maintenance of industrial plants with two major use cases:
connected windmills (GDF SUEZ, Woelfel) and customer satisfaction in
car sale systems (MMC Rus). In both cases it is about non-personal,
yet profitable big data.
The Wendelin project actually demonstrates that Big data can improve
infrastructure and everyday-life equipment without intrusive data
collection. For more information, please see <ref xlink:href="http://www.wendelin.io" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www.<allowbreak/>wendelin.<allowbreak/>io</ref>.</p>
        <p>The project partners are:</p>
        <simplelist>
          <li id="uid77">
            <p noindent="true">Nexedi (leader)</p>
          </li>
          <li id="uid78">
            <p noindent="true">GDF SUEZ</p>
          </li>
          <li id="uid79">
            <p noindent="true">Abilian</p>
          </li>
          <li id="uid80">
            <p noindent="true">2ndQuadrant</p>
          </li>
          <li id="uid81">
            <p noindent="true">Institut Mines Télécom</p>
          </li>
          <li id="uid82">
            <p noindent="true">Inria</p>
          </li>
          <li id="uid83">
            <p noindent="true">Université Paris 13</p>
          </li>
        </simplelist>
      </subsection>
    </subsection>
  </contrats>
  <partenariat id="uid84">
    <bodyTitle>Partnerships and Cooperations</bodyTitle>
    <subsection id="uid85" level="1">
      <bodyTitle>Regional Initiatives</bodyTitle>
      <subsection id="uid86" level="2">
        <bodyTitle>CoSmic project</bodyTitle>
        <participants>
          <person key="parietal-2014-idm29544">
            <firstname>Philippe</firstname>
            <lastname>Ciuciu</lastname>
            <moreinfo>Correspondant</moreinfo>
          </person>
          <person key="parietal-2015-idp80968">
            <firstname>Carole</firstname>
            <lastname>Lazarus</lastname>
          </person>
          <person key="galen-2016-idp162288">
            <firstname>Loubna</firstname>
            <lastname>El Gueddari</lastname>
          </person>
        </participants>
        <p>This is a collaborative project with Jean-Luc Stark, (CEA) funded by
the CEA program drf-impulsion.</p>
        <p>Compressed Sensing is a recent theory in maths that allows the perfect
recovery of signals or images from compressive acquisition
scenarios. This approach has been popularized in MRI over the last
decade as well as in astrophysics (noticeably in radio-astronomy). So
far, both of these fields have developed skills in CS separately. The
aim of the COSMIC project is to foster collaborations between CEA
experts in MRI (Inria-CEA Parietal team within NeuroSpin) and in
astrophysics (CosmoStat lab within the Astrophysics Department). These
interactions will allow us to share different expertise in order to
improve image quality, either in MRI or in radio-astronomy (thanks to
the interferometry principle). In this field, given the data delivered
by radio-telescopet he goal will consist of extracting high temporal
resolution information in order to study fast transient events.</p>
      </subsection>
      <subsection id="uid87" level="2">
        <bodyTitle>BrainAMP project</bodyTitle>
        <participants>
          <person key="parietal-2014-idm31000">
            <firstname>Bertrand</firstname>
            <lastname>Thirion</lastname>
            <moreinfo>Correspondant</moreinfo>
          </person>
          <person key="parietal-2014-idm28112">
            <firstname>Gaël</firstname>
            <lastname>Varoquaux</lastname>
          </person>
          <person key="parietal-2016-idp164848">
            <firstname>Andre</firstname>
            <lastname>Monteiro Manoel</lastname>
          </person>
        </participants>
        <p>This is a collaborative project with Lenka Zdeborová, Theoretical
Physics Institute (CEA) funded by the CEA program drf-impulsion.</p>
        <p>In many scientific fields, the data acquisition devices have benefited
of hardware improvement to increase the resolution of the observed
phenomena, leading to ever larger datasets. While the dimensionality
has increased, the number of samples available is often limited, due
to physical or financial limits. This is a problem when these data are
processed with estimators that have a large sample complexity, such as
multivariate statistical models. In that case it is very useful to
rely on structured priors, so that the results reflect the state of
knowledge on the phenomena of interest. The study of the human brain
activity through high-field MRI belongs among these problems, with up
to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mn>10</mn><mn>6</mn></msup></math></formula> features, yet a set of observations limited by cost and
participant comfort.</p>
        <p>We are missing fast estimators for multivariate models with structured
priors, that furthermore provide statistical control on the
solution. Approximate message passing methods are designed to work
optimally with low-sample-complexity, they accommodate rather generic
class of priors and come with an estimation of statistical
significance. They are therefore well suited for our purposes.</p>
        <p>We want to join forces to design a new generation of inverse problem
solvers that can take into account the complex structure of brain
images and provide guarantees in the low-sample-complexity regime. To
this end, we will first adapt AMP to the brain mapping setting, using
first standard sparsity priors (e.g. Gauss-Bernoulli) on the model. We
will then consider more complex structured priors that control the
variation of the learned image patterns in space. Crucial gains are
expected from the use of the EM algorithm for parameter setting, that
comes naturally with AMP. We will also examine the estimators provided
by AMP for statistical significance. BrainAMP will design a reference
inference toolbox released as a generic open source library. We expect
a 3- to 10-fold improvement in CPU time, that will benefit to
large-scale brain mapping investigations.</p>
      </subsection>
      <subsection id="uid88" level="2">
        <bodyTitle>iConnectom project</bodyTitle>
        <participants>
          <person key="parietal-2014-idm31000">
            <firstname>Bertrand</firstname>
            <lastname>Thirion</lastname>
            <moreinfo>Correspondant</moreinfo>
          </person>
          <person key="parietal-2014-idm28112">
            <firstname>Gaël</firstname>
            <lastname>Varoquaux</lastname>
          </person>
          <person key="parietal-2014-idp78768">
            <firstname>Elvis</firstname>
            <lastname>Dohmatob</lastname>
          </person>
        </participants>
        <p>This is a Digiteo project (2014-2017).</p>
        <p>Mapping brain functional connectivity from functional Magnetic
Resonance Imaging (MRI) data has become a very active field of
research. However, analysis tools are limited and many important
tasks, such as the empirical definition of brain networks, remain
difficult due to the lack of a good framework for the statistical
modeling of these networks. We propose to develop population models of
anatomical and functional connectivity data to improve the alignment
of subjects brain structures of interest while inferring an average
template of these structures. Based on this essential contribution,
we will design new statistical inference procedures to compare the
functional connections between conditions or populations and improve
the sensitivity of connectivity analysis performed on noisy
data. Finally, we will test and validate the methods on multiple
datasets and distribute them to the brain imaging community.</p>
      </subsection>
      <subsection id="uid89" level="2">
        <bodyTitle>MetaCog project</bodyTitle>
        <participants>
          <person key="parietal-2014-idm31000">
            <firstname>Bertrand</firstname>
            <lastname>Thirion</lastname>
            <moreinfo>Correspondant</moreinfo>
          </person>
          <person key="parietal-2014-idm28112">
            <firstname>Gaël</firstname>
            <lastname>Varoquaux</lastname>
          </person>
          <person key="parietal-2016-idp142656">
            <firstname>Jérome</firstname>
            <lastname>Dockès</lastname>
          </person>
        </participants>
        <p>This is a Digicosme project (2016-2019) and a collaboration with
Fabian Suchanek (Telecom Paritech).</p>
        <p>Understanding how cognition emerges from the billions of
neurons that constitute the human brain is a major
open problem in science that could bridge natural science –biology– to
humanities –psychology.
Psychology studies performed on humans
with functional Magnetic Resonance Imaging (fMRI) can be used to probe the
full repertoire of high-level cognitive functions.
While analyzing the resulting image data for a given experiment is a
relatively well-mastered process, the challenges in
comparing data across multiple datasets poses serious limitation to the
field. Indeed, such comparisons require
to pool together brain images acquired under different settings and
assess the effect of different <i>experimental conditions</i> that
correspond to psychological effects studied by neuroscientists.</p>
        <p>Such meta-analyses are now becoming possible thanks to the development of
public data resources –OpenfMRI <ref xlink:href="http://openfmri.org" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>openfmri.<allowbreak/>org</ref> and NeuroVault
<ref xlink:href="http://neurovault.org" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>neurovault.<allowbreak/>org</ref>.
As many others, researchers of the Parietal team understand these data
sources well and contribute to them.
However, in such open-ended context, the description of experiments
in terms of cognitive concepts is very difficult: there is no universal
definition of cognitive terms that could be
employed consistently by neuroscientists. Hence meta-analytic studies
loose power and specificity. On the other hand,
<ref xlink:href="http://brainspell.org" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>brainspell.<allowbreak/>org</ref> provide a set of curated annotation, albeit
on much less data, that can serve as a seed or a ground truth to define a
consensual ontology of cognitive concepts.
Relating these terms to brain activity poses another challenge, of
statistical nature, as brain patterns form high-dimensional data in
perspective with the scarcity and the noise of the data.</p>
        <p>The purpose of this project is to learn a semantic structure in
cognitive terms from their occurrence in brain activations. This
structure will simplify massive multi-label statistical-learning
problems that arise in brain mapping by providing compact
representations of cognitive concepts while capturing the imprecision
on the definition these concepts.</p>
      </subsection>
      <subsection id="uid90" level="2">
        <bodyTitle>CDS2</bodyTitle>
        <participants>
          <person key="parietal-2014-idm31000">
            <firstname>Bertrand</firstname>
            <lastname>Thirion</lastname>
            <moreinfo>Correspondant</moreinfo>
          </person>
          <person key="parietal-2014-idm28112">
            <firstname>Gaël</firstname>
            <lastname>Varoquaux</lastname>
          </person>
          <person key="parietal-2016-idp182224">
            <firstname>Guillaume</firstname>
            <lastname>Lemaitre</lastname>
          </person>
        </participants>
        <p>CDS2 is an "Strategic research initiatice” of the Paris Saclay
University Idex <ref xlink:href="http://datascience-paris-saclay.fr" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>datascience-paris-saclay.<allowbreak/>fr</ref>.
Although it groups together many partners of the Paris Saclay
ecosystem, Parietal has been deeply involved in the project.
It currently funds a post-doc for Guillume Lemaitre.
</p>
      </subsection>
    </subsection>
    <subsection id="uid91" level="1">
      <bodyTitle>National Initiatives</bodyTitle>
      <subsection id="uid92" level="2">
        <bodyTitle>ANR</bodyTitle>
        <subsection id="uid93" level="3">
          <bodyTitle>MultiFracs project</bodyTitle>
          <participants>
            <person key="parietal-2014-idm29544">
              <firstname>Philippe</firstname>
              <lastname>Ciuciu</lastname>
              <moreinfo>Correspondant</moreinfo>
            </person>
            <person key="tao-2014-idp81984">
              <firstname>Daria</firstname>
              <lastname>La Rocca</lastname>
            </person>
          </participants>
          <p>The scale-free concept formalizes the intuition that, in many systems,
the analysis of temporal dynamics cannot be grounded on specific and
characteristic time scales. The scale-free paradigm has permitted the
relevant analysis of numerous applications, very different in nature,
ranging from natural phenomena (hydrodynamic turbulence, geophysics,
body rhythms, brain activity,...) to human activities (Internet
traffic, population, finance, art,...).</p>
          <p>Yet, most successes of scale-free analysis were obtained in contexts
where data are univariate, homogeneous along time (a single stationary
time series), and well-characterized by simple-shape local
singularities. For such situations, scale-free dynamics translate into
global or local power laws, which significantly eases practical
analyses. Numerous recent real-world applications (macroscopic
spontaneous brain dynamics, the central application in this project,
being one paradigm example), however, naturally entail large
multivariate data (many signals), whose properties vary along time
(non-stationarity) and across components (non-homogeneity), with
potentially complex temporal dynamics, thus intricate local singular
behaviors.</p>
          <p>These three issues call into question the intuitive and founding
identification of scale-free to power laws, and thus make uneasy
multivariate scale-free and multifractal analyses, precluding the use
of univariate methodologies. This explains why the concept of
scale-free dynamics is barely used and with limited successes in such
settings and highlights the overriding need for a systematic
methodological study of multivariate scale-free and multifractal
dynamics. The Core Theme of MULTIFRACS consists in laying the
theoretical foundations of a practical robust statistical signal
processing framework for multivariate non homogeneous scale-free and
multifractal analyses, suited to varied types of rich singularities,
as well as in performing accurate analyses of scale-free dynamics in
spontaneous and task-related macroscopic brain activity, to assess
their natures, functional roles and relevance, and their relations to
behavioral performance in a timing estimation task using multimodal
functional imaging techniques.</p>
          <p>This overarching objective is organized into 4 Challenges:</p>
          <orderedlist>
            <li id="uid94">
              <p noindent="true">Multivariate scale-free and multifractal analysis,</p>
            </li>
            <li id="uid95">
              <p noindent="true">Second generation of local singularity indices,</p>
            </li>
            <li id="uid96">
              <p noindent="true">Scale-free dynamics, non-stationarity and non-homogeneity,</p>
            </li>
            <li id="uid97">
              <p noindent="true">Multivariate scale-free temporal dynamics analysis in macroscopic brain activity.</p>
            </li>
          </orderedlist>
        </subsection>
        <subsection id="uid98" level="3">
          <bodyTitle>BrainPedia project</bodyTitle>
          <participants>
            <person key="parietal-2014-idm31000">
              <firstname>Bertrand</firstname>
              <lastname>Thirion</lastname>
              <moreinfo>Correspondant</moreinfo>
            </person>
            <person key="parietal-2014-idm28112">
              <firstname>Gaël</firstname>
              <lastname>Varoquaux</lastname>
            </person>
          </participants>
          <p>BrainPedia is an ANR JCJC (2011-2015) which addresses the following
question: Neuroimaging produces huge amounts of complex data that are
used to better understand the relations between brain structure and
function. While the acquisition and analysis of this data is getting
standardized in some aspects, the neuroimaging community is still
largely missing appropriate tools to store and organize the knowledge
related to the data. Taking advantage of common coordinate systems to
represent the results of group studies, coordinate-based meta-analysis
approaches associated with repositories of neuroimaging publications
provide a crude solution to this problem, that does not yield reliable
outputs and looses most of the data-related information. In this
project, we propose to tackle the problem in a statistically rigorous
framework, thus providing usable information to drive neuroscientific
knowledge and questions.</p>
        </subsection>
        <subsection id="uid99" level="3">
          <bodyTitle>Niconnect project</bodyTitle>
          <participants>
            <person key="parietal-2014-idm31000">
              <firstname>Bertrand</firstname>
              <lastname>Thirion</lastname>
            </person>
            <person key="parietal-2014-idm28112">
              <firstname>Gaël</firstname>
              <lastname>Varoquaux</lastname>
              <moreinfo>Correspondant</moreinfo>
            </person>
            <person key="parietal-2014-idp76328">
              <firstname>Alexandre</firstname>
              <lastname>Abraham</lastname>
            </person>
            <person key="parietal-2015-idp66104">
              <firstname>Kamalaker Reddy</firstname>
              <lastname>Dadi</lastname>
            </person>
            <person key="parietal-2016-idp157376">
              <firstname>Darya</firstname>
              <lastname>Chyzhyk</lastname>
            </person>
            <person key="parietal-2014-idp68792">
              <firstname>Mehdi</firstname>
              <lastname>Rahim</lastname>
            </person>
          </participants>
          <simplelist>
            <li id="uid100">
              <p noindent="true"><b>Context:</b> The NiConnect project (2012-2016) arises from
an increasing need of medical imaging tools to diagnose efficiently
brain pathologies, such as neuro-degenerative and psychiatric
diseases or lesions related to stroke. Brain imaging provides a
non-invasive and widespread probe of various features of brain
organization, that are then used to make an accurate diagnosis,
assess brain rehabilitation, or make a prognostic on the chance of
recovery of a patient. Among different measures extracted from brain
imaging, functional connectivity is particularly attractive, as it
readily probes the integrity of brain networks, considered as
providing the most complete view on brain functional organization.</p>
            </li>
            <li id="uid101">
              <p noindent="true"><b>Challenges:</b> To turn methods research into popular tool
widely usable by non specialists, the NiConnect project puts
specific emphasis on producing high-quality open-source
software. NiConnect addresses the many data analysis tasks that
extract relevant information from resting-state fMRI
datasets. Specifically, the scientific difficulties are <i>i)</i>
conducting proper validation of the models and tools, and
<i>ii)</i> providing statistically controlled information to
neuroscientists or medical doctors. More importantly, these
procedures should be robust enough to perform analysis on limited
quality data, as acquiring data on diseased populations is
challenging and artifacts can hardly be controlled in clinical
settings.</p>
            </li>
            <li id="uid102">
              <p noindent="true"><b>Outcome of the project:</b> In the scope of computer science
and statistics, NiConnect pushes forward algorithms and
statistical models for brain functional connectivity. In particular,
we are investigating structured and multi-task graphical models to
learn high-dimensional multi-subject brain connectivity models, as
well as spatially-informed sparse decompositions for segmenting
structures from brain imaging. With regards to neuroimaging methods
development, NiConnect provides systematic comparisons and
evaluations of connectivity biomarkers and a software library
embedding best-performing state-of-the-art approaches. Finally,
with regards to medical applications, the NiConnect project
also plays a support role in on going medical studies and clinical
trials on neurodegenerative diseases.</p>
            </li>
            <li id="uid103">
              <p noindent="true">
                <b>Consortium</b>
              </p>
              <simplelist>
                <li id="uid104">
                  <p noindent="true">Parietal Inria research team: applied mathematics and computer
science to model the brain from MRI</p>
                </li>
                <li id="uid105">
                  <p noindent="true">LIF INSERM research team: medical image data analysis and modeling
for clinical applications</p>
                </li>
                <li id="uid106">
                  <p noindent="true">CATI center: medical image processing center for large scale brain
imaging studies</p>
                </li>
                <li id="uid107">
                  <p noindent="true">Henri-Mondor hospital neurosurgery and neuroradiology: clinical
teams conducting research on treatments for neurodegenerative
diseases, in particular Huntington and Parkinson diseases</p>
                </li>
                <li id="uid108">
                  <p noindent="true">Logilab: consulting in scientific computing</p>
                </li>
              </simplelist>
            </li>
          </simplelist>
        </subsection>
      </subsection>
    </subsection>
    <subsection id="uid109" level="1">
      <bodyTitle>European Initiatives</bodyTitle>
      <subsection id="uid110" level="2">
        <bodyTitle>FP7 &amp; H2020 Projects</bodyTitle>
        <subsection id="uid111" level="3">
          <bodyTitle>HBP</bodyTitle>
          <sanspuceslist>
            <li id="uid112">
              <p noindent="true">Title: The Human Brain Project</p>
            </li>
            <li id="uid113">
              <p noindent="true">Programm: FP7</p>
            </li>
            <li id="uid114">
              <p noindent="true">Duration: October 2013 - September 2016</p>
            </li>
            <li id="uid115">
              <p noindent="true">Coordinator: EPFL</p>
            </li>
            <li id="uid116">
              <p noindent="true">Partners: 100 across Europe</p>
            </li>
            <li id="uid117">
              <p noindent="true">Inria contact: Olivier Faugeras</p>
            </li>
            <li id="uid118">
              <p noindent="true">Understanding the human brain is one of the greatest challenges facing
21st century science. If we can rise to the challenge, we can gain
profound insights into what makes us human, develop new treatments for
brain diseases and build revolutionary new computing
technologies. Today, for the first time, modern ICT has brought these
goals within sight. The goal of the Human Brain Project, part of the
FET Flagship Programme, is to translate this vision into reality,
using ICT as a catalyst for a global collaborative effort to
understand the human brain and its diseases and ultimately to emulate
its computational capabilities. The Human Brain Project will last ten
years and will consist of a ramp-up phase (from month 1 to month 36)
and subsequent operational phases.
This Grant Agreement covers the ramp-up phase. During this phase the
strategic goals of the project will be to design, develop and deploy
the first versions of six ICT platforms dedicated to Neuroinformatics,
Brain Simulation, High Performance Computing, Medical Informatics,
Neuromorphic Computing and Neurorobotics, and create a user community
of research groups from within and outside the HBP, set up a European
Institute for Theoretical Neuroscience, complete a set of pilot
projects providing a first demonstration of the scientific value of
the platforms and the Institute, develop the scientific and
technological capabilities required by future versions of the
platforms, implement a policy of Responsible Innovation, and a
programme of transdisciplinary education, and develop a framework for
collaboration that links the partners under strong scientific
leadership and professional project management, providing a coherent
European approach and ensuring effective alignment of regional,
national and European research and programmes. The project work plan
is organized in the form of thirteen subprojects, each dedicated to a
specific area of activity. A significant part of the budget will be
used for competitive calls to complement the collective skills of the
Consortium with additional expertise.</p>
            </li>
          </sanspuceslist>
        </subsection>
      </subsection>
      <subsection id="uid119" level="2">
        <bodyTitle>Collaborations in European Programs, Except FP7 &amp; H2020</bodyTitle>
        <sanspuceslist>
          <li id="uid120">
            <p noindent="true">Program: Marie Curie</p>
          </li>
          <li id="uid121">
            <p noindent="true">Project acronym: Neuroimaging Power</p>
          </li>
          <li id="uid122">
            <p noindent="true">Project title: Effect size and power for neuroimaging.</p>
          </li>
          <li id="uid123">
            <p noindent="true">Duration: mois année début - mois année fin</p>
          </li>
          <li id="uid124">
            <p noindent="true">Coordinator: Inria</p>
          </li>
          <li id="uid125">
            <p noindent="true">Other partners: Univ. Stanford, USA</p>
          </li>
          <li id="uid126">
            <p noindent="true">Abstract: There is an increasing concern about
statistical power in neuroscience research. Critically, an
underpowered study has poor predictive power. Findings from
a low-power study are unlikely to be reproducible, and thus
a power analysis is a critical component of any paper. This
project aims to promote and facilitate the use of power
analyses.A key component of a power analysis is the
specification of an effect size. However, in neuroimaging,
there is no standardised way to communicate effect sizes,
which makes the choice of an appropriate effect size a
formidable task. The best way today to perform a power
analysis is by collecting a pilot data set, a very expensive
practice. To eliminate the need for pilot data, we will
develop a standardised measure of effect size taking into
account the spatial variance and the uncertainty of the
measurements. Communicating effect sizes in new publications
will facilitate the use of power analyses.To further
alleviate the need for pilot data, we will provide a library
of effect sizes for different tasks and contrasts, using
open data projects in neuroimaging. We will integrate our
effect size estimator in open repositories NeuroVault and
OpenfMRI. Consequently, these effect sizes can then serve as
a proxy for a pilot study, and as such, a huge cost in the
design of an experiment is eliminated.A new experiment will
not be identical to the open data and as such the
hypothesised parameters might not be fully accurate. To
address this issue, we present a flexible framework to
analyse data mid-way without harming the control of the type
I error rate. Such a procedure will allow re-evaluating
halfway an experiment whether it is useful to continue a
study, and how many more subjects are needed for
statistically sound inferences.To make our methods maximally
available, we will write a software suite including all
these methods in different programming platforms and we will
provide a GUI to further increase the use of power analyses.</p>
          </li>
        </sanspuceslist>
      </subsection>
    </subsection>
    <subsection id="uid127" level="1">
      <bodyTitle>International Initiatives</bodyTitle>
      <subsection id="uid128" level="2">
        <bodyTitle>
          <ref xlink:href="https://team.inria.fr/metamri" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">MetaMRI </ref>
        </bodyTitle>
        <sanspuceslist>
          <li id="uid129">
            <p noindent="true">Title: Machine learning for meta-analysis of functional neuroimaging data</p>
          </li>
          <li id="uid130">
            <p noindent="true">International Partner (Institution - Laboratory - Researcher):</p>
            <sanspuceslist>
              <li id="uid131">
                <p noindent="true">Stanford (United States)
- Department of Psychology - Russ Poldrack</p>
              </li>
            </sanspuceslist>
          </li>
          <li id="uid132">
            <p noindent="true">Start year: 2015</p>
          </li>
          <li id="uid133">
            <p noindent="true">See also: <ref xlink:href="https://team.inria.fr/metamri" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>team.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>metamri</ref></p>
          </li>
          <li id="uid134">
            <p noindent="true">Neuroimaging produces huge amounts of complex data that are used to
better understand the relations between brain structure and function.
Observing that the neuroimaging community is still largely missing
appropriate tools to store and organize the knowledge related to the
data, Parietal team and Poldrack's lab, have decided to join forces to
set up a framework for functional brain image meta-analysis, i.e. a
framework in which several datasets can be jointly analyzed in order
to accumulate information on the functional specialization of brain
regions. MetaMRI will build upon Poldrack's lab expertise in
handling, sharing and analyzing multi-protocol data and Parietal's
recent developments of machine learning libraries to develop a new
generation of meta-analytic tools.</p>
          </li>
        </sanspuceslist>
      </subsection>
    </subsection>
  </partenariat>
  <diffusion id="uid135">
    <bodyTitle>Dissemination</bodyTitle>
    <subsection id="uid136" level="1">
      <bodyTitle>Promoting Scientific Activities</bodyTitle>
      <subsection id="uid137" level="2">
        <bodyTitle>Scientific Events Organisation</bodyTitle>
        <subsection id="uid138" level="3">
          <bodyTitle>Member of the Organizing Committees</bodyTitle>
          <simplelist>
            <li id="uid139">
              <p noindent="true"><b>Bertrand Thirion</b>: Organization for Human Brain Mapping.</p>
            </li>
          </simplelist>
        </subsection>
        <subsection id="uid140" level="3">
          <bodyTitle>Reviewer</bodyTitle>
          <simplelist>
            <li id="uid141">
              <p noindent="true"><b>Philippe Ciuciu</b>: IEEE ISBI (15 papers), IEEE ICASSP (10
papers), IEEE ICIP (5 papers), NIPS (4 papers), EUSIPCO (5
papers).</p>
            </li>
            <li id="uid142">
              <p noindent="true"><b>Bertrand Thirion</b>: IPMI, MICCAI, NIPS, ISBI, PRNI, AISTATS</p>
            </li>
            <li id="uid143">
              <p noindent="true"><b>Gaël Varoquaux</b>: IEEE ICASSP, MICCAI, NIPS, IPMI, ICML</p>
            </li>
          </simplelist>
        </subsection>
      </subsection>
      <subsection id="uid144" level="2">
        <bodyTitle>Journal</bodyTitle>
        <subsection id="uid145" level="3">
          <bodyTitle>Member of the Editorial Boards</bodyTitle>
          <simplelist>
            <li id="uid146">
              <p noindent="true"><b>Bertrand Thirion</b>: Medical Image Analysis, Frontiers in brain imaging</p>
            </li>
            <li id="uid147">
              <p noindent="true"><b>Gaël Varoquaux</b>: Frontiers in NeuroInformatics, Frontiers in brain imaging
methods, NeuroImage</p>
            </li>
          </simplelist>
        </subsection>
        <subsection id="uid148" level="3">
          <bodyTitle>Reviewer - Reviewing Activities</bodyTitle>
          <simplelist>
            <li id="uid149">
              <p noindent="true"><b>Philippe Ciuciu</b>: Reviewer for Neuroimage, IEEE Signal Processing Letters, Signal Processing, IEEE Trans. Medical Imaging, Plos One, Plos Comput. Biology, Frontiers in Neuroscience.</p>
            </li>
            <li id="uid150">
              <p noindent="true"><b>Bertrand Thirion</b>: Human Brain Mapping, IEEE TMI, MedIA, NeuroImage, PNAS</p>
            </li>
            <li id="uid151">
              <p noindent="true"><b>Gaël Varoquaux</b>: NeuroImage, JSTSP, PNAS, HBM, PLOS
Comp Bio, Gigascience</p>
            </li>
            <li id="uid152">
              <p noindent="true"><b>Olivier Grisel</b>: Journal of Machine Learning
Research (software track).</p>
            </li>
          </simplelist>
        </subsection>
      </subsection>
      <subsection id="uid153" level="2">
        <bodyTitle>Invited Talks</bodyTitle>
        <subsection id="uid154" level="3">
          <bodyTitle>Bertrand Thirion</bodyTitle>
          <simplelist>
            <li id="uid155">
              <p noindent="true">February: invited talk at the <i>Imagerie du Vivant</i> National congress, entitled <i>Large-scale analyses in functional brain Imaging</i>.</p>
            </li>
            <li id="uid156">
              <p noindent="true">February: presentation at the Pasadena working group of the
Digicosme Labex.</p>
            </li>
            <li id="uid157">
              <p noindent="true">April: invited presentation at European Neuroscience institute,
Paris, entitled <i>Seeing it all: Convolutional network layers
map the function of the human visual system</i>.</p>
            </li>
            <li id="uid158">
              <p noindent="true">April: presentation Functional connectomicts, at DTU Copenhagen,
entitled <i>from large-scale estimators to empirical validation</i>.</p>
            </li>
            <li id="uid159">
              <p noindent="true">May: Talk at Atlas workshop, Grenoble, entitled <i>Learning
representations from functional brain imaging</i>.</p>
            </li>
            <li id="uid160">
              <p noindent="true">June: organizer of a table ronde at the <i>Futur en Seine</i>
event entitled <i>Computational methods for neurosciences &amp;
medical imaging.</i></p>
            </li>
            <li id="uid161">
              <p noindent="true">October: talk at MPI Psychiatry, Munich, entitled
<i>Machine learning for neuroimaging: current challenges and
solutions</i>.</p>
            </li>
            <li id="uid162">
              <p noindent="true">June: Talk at Neurostic workshop, Grenoble, entitled
<i>Learning representations from functional brain imaging</i>.</p>
            </li>
            <li id="uid163">
              <p noindent="true">October: Invited talk by the ITMO Neuroscience, Bordeaux,
entitled <i>Working with large data samples: the case of human
brain imaging</i>.</p>
            </li>
          </simplelist>
        </subsection>
        <subsection id="uid164" level="3">
          <bodyTitle>Philippe Ciuciu</bodyTitle>
          <simplelist>
            <li id="uid165">
              <p noindent="true">12/16: IEEE Lecture at University of British Columbia (Vancouver, Canada): <i>Sparkling: Novel non-Cartesian sampling schemes for accelerated 2D anatomical imaging at 7 Tesla</i>.</p>
            </li>
            <li id="uid166">
              <p noindent="true">12/16: Pacific Parkinson's research center (Vancouver, Canada):
<i>Impact of perceptual learning on resting-state brain dynamics in fMRI: A supervised classification study</i>.</p>
            </li>
            <li id="uid167">
              <p noindent="true">09/16: GdR d'Analyse Multifractale (Avignon, France): <i>Convergence of neural activity to multifractal attractors in MEG predicts learning</i>.</p>
            </li>
            <li id="uid168">
              <p noindent="true">08/16: invitation to the Special session entitled “Unraveling brain networks from functional neuroimaging data” at EUSIPCO'16 (Budapest, Hungary): <i>Impact of perceptual learning on resting-state fMRI connectivity: A supervised classification study</i>.</p>
            </li>
            <li id="uid169">
              <p noindent="true">06/16: Journées scientifiques d'Inria (Rennes, France): <i>Compressive Sampling in MRI</i>.</p>
            </li>
            <li id="uid170">
              <p noindent="true">06/16: Inria Sophia-Antipolis, équipe Athena. <i>New physically plausible compressive sampling schemes for MRI: First results at 7 Tesla</i></p>
            </li>
            <li id="uid171">
              <p noindent="true">05/16: University of Geneva (Campus BioTech, Geneva, Switzlerand): <i>Convergence to asymptotic Multifractal dynamics in the brain predicts learning</i>.</p>
            </li>
            <li id="uid172">
              <p noindent="true">02/16: Grenoble Institut of Neurosciences (Grenoble, France): <i>Physically plausible trajectories for Compressed Sensing in MRI</i>.</p>
            </li>
            <li id="uid173">
              <p noindent="true">02/16: Workshop on 7 Tesla scanner at NeuroSpin (Gif-sur-Yvette, France)
<i>Compressed sensing for high resolution MRI at 7 Tesla</i>.</p>
            </li>
            <li id="uid174">
              <p noindent="true">01/16: Cosmostat lab, IRFU/CEA. <i>On the generation of compressed sampling schemes in MRI</i>.</p>
            </li>
          </simplelist>
        </subsection>
        <subsection id="uid175" level="3">
          <bodyTitle>Loïc Estève</bodyTitle>
          <simplelist>
            <li id="uid176">
              <p noindent="true">EuroScipy 2016: scikit-learn tutorial</p>
            </li>
            <li id="uid177">
              <p noindent="true">Budapest BI 2016 : scikit-learn tutorial and talk "Recent developments in scikit-learn and joblib"</p>
            </li>
          </simplelist>
        </subsection>
        <subsection id="uid178" level="3">
          <bodyTitle>Olivier Grisel</bodyTitle>
          <simplelist>
            <li id="uid179">
              <p noindent="true">PyData Berlin and PyData Paris 2016: <i> "Predictive modeling
with Python, trends and tools</i></p>
            </li>
            <li id="uid180">
              <p noindent="true">invited talk on <i>Some recent developments in Deep Learning
researc</i> at Strata London 2016.</p>
            </li>
          </simplelist>
        </subsection>
        <subsection id="uid181" level="3">
          <bodyTitle>Gaël Varoquaux</bodyTitle>
          <simplelist>
            <li id="uid182">
              <p noindent="true">Paris Open Source summit 2016: scikit-learn, the vision and the
community</p>
            </li>
            <li id="uid183">
              <p noindent="true">EuroScipy 2016 (Erlangen): keynote: "On writing code the science"</p>
            </li>
            <li id="uid184">
              <p noindent="true">Open Data Science Conference 2017 (London): keynote: "The code of data science"</p>
            </li>
            <li id="uid185">
              <p noindent="true">EuroPython 2016 (Bilbao): keynote "Scientists meet web dev: how
Python became the language of data"</p>
            </li>
            <li id="uid186">
              <p noindent="true">PiterPy 2016 (St Petersbourg): keynote: "Python for data"</p>
            </li>
            <li id="uid187">
              <p noindent="true">Facebook AI Research: some statistical learning problems in brain imaging</p>
            </li>
            <li id="uid188">
              <p noindent="true">GDR ISIS Imagerie medicale: prediction de pathologies
psychiatriques à partir d'imagerie fonctionnelle de repos</p>
            </li>
            <li id="uid189">
              <p noindent="true">Brain network analysis workshop, MICCAI 2016 (Athenes): keynote</p>
            </li>
            <li id="uid190">
              <p noindent="true">Journée Graphes et neuroscience à Marseilles: Machine learning on
brain graphes</p>
            </li>
            <li id="uid191">
              <p noindent="true">Séminaire débat sur le Big data en Neuroscience, Lyon</p>
            </li>
            <li id="uid192">
              <p noindent="true">Seminar Max Planck Institute Leipzig: data mining for neuroimaging</p>
            </li>
            <li id="uid193">
              <p noindent="true">Seminar Telecom ParisTech: randomized methods for high-dimensional statistical learning</p>
            </li>
            <li id="uid194">
              <p noindent="true">Séminaire d'équipe Asclepios: Quelques problèmes d'apprentissage
sur des images cérébrales</p>
            </li>
          </simplelist>
        </subsection>
      </subsection>
      <subsection id="uid195" level="2">
        <bodyTitle>Leadership within the Scientific Community</bodyTitle>
        <simplelist>
          <li id="uid196">
            <p noindent="true">Gaël Varoquaux: Chair of the steering committee, IEEE PRNI</p>
          </li>
          <li id="uid197">
            <p noindent="true">Bertrand Thirion: member of the <i>Committee on Best Practices in Data Analysis and Sharing</i> for the OHBM community.</p>
          </li>
        </simplelist>
      </subsection>
      <subsection id="uid198" level="2">
        <bodyTitle>Scientific Expertise</bodyTitle>
        <simplelist>
          <li id="uid199">
            <p noindent="true">Philippe Ciuciu: ANR JC, NSERC au Canada, FWO</p>
          </li>
          <li id="uid200">
            <p noindent="true">Bertrand Thirion: ANR, NWO, NSF</p>
          </li>
          <li id="uid201">
            <p noindent="true">Gaël Varoquaux: Membre de la Commission Expertises Scientifiques,
(CE23) ANR</p>
          </li>
          <li id="uid202">
            <p noindent="true">Olivier Grisel did 3 days of consulting with the CTO of the
Therapixel startup to share expertise on the use of Deep Learning
for the predictive analysis of 3D imaging data.</p>
          </li>
        </simplelist>
      </subsection>
      <subsection id="uid203" level="2">
        <bodyTitle>Research Administration</bodyTitle>
        <subsection id="uid204" level="3">
          <bodyTitle>Philippe Ciuciu</bodyTitle>
          <simplelist>
            <li id="uid205">
              <p noindent="true">03/16: Involvement in the CEA visiting committee on High Performance Computing.</p>
            </li>
            <li id="uid206">
              <p noindent="true">05/16: Member of a Comité de sélection for hiring an Assistant Professor in Paris-Saclay University (Section 61 of CNU).</p>
            </li>
            <li id="uid207">
              <p noindent="true">06/16: Member of the Inria scientific commission in charge of ranking PhD and post-doctoral applicants as well as delegations of Assistant Professors to Inria.</p>
            </li>
          </simplelist>
        </subsection>
        <subsection id="uid208" level="3">
          <bodyTitle>Bertrand Thirion</bodyTitle>
          <simplelist>
            <li id="uid209">
              <p noindent="true">Leader of the Datasense axis of the Digicosme Labex</p>
            </li>
            <li id="uid210">
              <p noindent="true">Member of the STIC department committee Paris-Saclay University and of the bureau thereof.</p>
            </li>
            <li id="uid211">
              <p noindent="true">DSA Saclay.</p>
            </li>
          </simplelist>
        </subsection>
        <subsection id="uid212" level="3">
          <bodyTitle>Gaël Varoquaux</bodyTitle>
          <simplelist>
            <li id="uid213">
              <p noindent="true">Member of "Commité de suivi doctoral", Inria Saclay</p>
            </li>
            <li id="uid214">
              <p noindent="true">Member of "Commité cluster", Inria Saclay</p>
            </li>
            <li id="uid215">
              <p noindent="true">Member of "Commission de Développement Technologique", Inria Saclay</p>
            </li>
            <li id="uid216">
              <p noindent="true">Member of the directorate of the Paris-Saclay CDS (Center for Data Science)</p>
            </li>
          </simplelist>
        </subsection>
      </subsection>
    </subsection>
    <subsection id="uid217" level="1">
      <bodyTitle>Teaching - Supervision - Juries</bodyTitle>
      <subsection id="uid218" level="2">
        <bodyTitle>Teaching</bodyTitle>
        <subsection id="uid219" level="3">
          <bodyTitle>Bertrand Thirion</bodyTitle>
          <sanspuceslist>
            <li id="uid220">
              <p noindent="true">Master : Brain Computer interface and Functional Neuroimaging, 12 heures équivalent TD, niveau M2, ENS Cachan</p>
            </li>
          </sanspuceslist>
        </subsection>
        <subsection id="uid221" level="3">
          <bodyTitle>Philippe Ciuciu</bodyTitle>
          <sanspuceslist>
            <li id="uid222">
              <p noindent="true">Master 2 : “Functional MRI: From data acquisition to analysis”, 3h, Univ. Paris V René Descartes &amp; Télécom-Paristech, Master of Biomedical Engineering</p>
            </li>
            <li id="uid223">
              <p noindent="true">Master 2 : “FMRI data analysis”, 3h, Univ. Paris-Saclay, Master of medical Physics</p>
            </li>
          </sanspuceslist>
        </subsection>
        <subsection id="uid224" level="3">
          <bodyTitle>Gaël Varoquaux</bodyTitle>
          <sanspuceslist>
            <li id="uid225">
              <p noindent="true">Master 2 : “Brain functional connectivity analysis”, 7h, Univ. Paris V René Descartes &amp; Télécom-Paristech, Master of Biomedical Engineering</p>
            </li>
            <li id="uid226">
              <p noindent="true">Master 2 : “Machine learning with scikit-learn”, 2h, ENSAE</p>
            </li>
            <li id="uid227">
              <p noindent="true">Master 2 : “Advanced Machine learning with scikit-learn”, 3h,
Centrale Paris, MSc in data sciences &amp; business analytics</p>
            </li>
            <li id="uid228">
              <p noindent="true">Ecole d'été multidisciplinaire analyse de données, Rennes, 1h</p>
            </li>
            <li id="uid229">
              <p noindent="true">OHBM 2016: course on machine learning for cognitive
neuroimaging 30mn</p>
            </li>
            <li id="uid230">
              <p noindent="true">PRNI 2016: nilearn for machine learning on brain images, 8h</p>
            </li>
            <li id="uid231">
              <p noindent="true">Max Planck Institute Leipzig: nilearn for machine learning on
brain images, 8h</p>
            </li>
          </sanspuceslist>
        </subsection>
      </subsection>
      <subsection id="uid232" level="2">
        <bodyTitle>Supervision</bodyTitle>
        <subsection id="uid233" level="3">
          <bodyTitle>Bertrand Thirion</bodyTitle>
          <sanspuceslist>
            <li id="uid234">
              <p noindent="true">PhD in progress: Elvis Dohmatob,</p>
            </li>
            <li id="uid235">
              <p noindent="true">PhD in progress: Arthur Mensch,</p>
            </li>
            <li id="uid236">
              <p noindent="true">PhD in progress: Andrés Hoyos Idrobo</p>
            </li>
          </sanspuceslist>
        </subsection>
        <subsection id="uid237" level="3">
          <bodyTitle>Philippe Ciuciu</bodyTitle>
          <sanspuceslist>
            <li id="uid238">
              <p noindent="true">PhD defended: Aina Frau-Pascual, “Statistical models for the
analysis of BOLD and ASL Magnetic Resonance modalities to study
brain function and disease”, University of Grenoble-Alpes (doctoral
school: Mathématiques, Sciences et Technologies de l’Information,
Informatique), defense: 19/12/2016, Advisors: Florence Forbes (Dir),
Philippe Ciuciu (Co-Dir)</p>
            </li>
            <li id="uid239">
              <p noindent="true">PhD in progress: Carole Lazarus, “Physically plausible
compressed sensing for high resolution MRI at 7 Tesla in Humans”
starting date: October 2015 (Univ. Paris-Saclay, doctoral school:
EOBE). Advisors: Philippe Ciuciu (Dir), Alexandre Vignaud (Co-Dir)</p>
            </li>
            <li id="uid240">
              <p noindent="true">PhD in progress: Loubna El Gueddari, “Parallel proximal
algorithms for compressed sensing MRI reconstruction. Applications
in ultra-high magnetic field imaging”, starting date: October
2016 (Univ. Paris-Saclay, doctoral school: EOBE). Advisors: Philippe
Ciuciu (Dir) and Jean-Christophe Pesquet (Co-Dir, Prof. at
Centrale-Supélec)</p>
            </li>
          </sanspuceslist>
        </subsection>
        <subsection id="uid241" level="3">
          <bodyTitle>Gael Varoquaux</bodyTitle>
          <sanspuceslist>
            <li id="uid242">
              <p noindent="true">PhD defended: Alexandre Abraham</p>
            </li>
            <li id="uid243">
              <p noindent="true">PhD in progress: Elvis Dohmatob,</p>
            </li>
            <li id="uid244">
              <p noindent="true">PhD in progress: Arthur Mensch,</p>
            </li>
            <li id="uid245">
              <p noindent="true">PhD in progress: Andrés Hoyos Idrobo</p>
            </li>
          </sanspuceslist>
        </subsection>
      </subsection>
      <subsection id="uid246" level="2">
        <bodyTitle>Juries</bodyTitle>
        <subsection id="uid247" level="3">
          <bodyTitle>Bertrand Thirion</bodyTitle>
          <simplelist>
            <li id="uid248">
              <p noindent="true">04/29: Reviewer of Niklas Kasenburg PhD Thesis ,
Univ. Copenhagen, Denmark.</p>
            </li>
            <li id="uid249">
              <p noindent="true">01/12: Examiner of Simona Schiavi PhD Thesis, Univ. Paris Saclay.</p>
            </li>
            <li id="uid250">
              <p noindent="true">14/12: Reviewer of Olivier Marre habilitation, Paris.</p>
            </li>
            <li id="uid251">
              <p noindent="true">15/12: Reviewer of Maite Termenon PhD thesis, Univ. Grenoble.</p>
            </li>
          </simplelist>
        </subsection>
        <subsection id="uid252" level="3">
          <bodyTitle>Philippe Ciuciu</bodyTitle>
          <simplelist>
            <li id="uid253">
              <p noindent="true">04/16: Reviewer of Aiping Liu's PhD thesis (ECCS Dpt, Univ. British Columbia, Vancouvern Canada) entitled <i>“Brain Connectivity Network Modeling using fMRI signals”</i></p>
            </li>
            <li id="uid254">
              <p noindent="true">05/16: Reviewer of Andrea Laruelo-Fernandez's PhD thesis (INP Toulouse-IRIT- ENSEEIHT) entitled <i>“Integration of magnetic resonance spectroscopic imaging into the radiotherapy treatment planning”</i></p>
            </li>
            <li id="uid255">
              <p noindent="true">09/16: Examinor of Mohanad Albughdadi's PhD thesis (INP Toulouse-IRIT- ENSEEIHT) entitled <i>“ Bayesian joint detection-estimation in functional MRI with automatic parcellation and functional constraints”</i></p>
            </li>
            <li id="uid256">
              <p noindent="true">10/16: Reviewer of Sébastien Combrexelle's PhD thesis (INP Toulouse-IRIT- ENSEEIHT) entitled <i>“Multifractal analysis for multivariate data with application to remote sensing”</i>.</p>
            </li>
            <li id="uid257">
              <p noindent="true">10/16: Co-director of Aina Frau-Pascual's PhD thesis (see above).</p>
            </li>
          </simplelist>
        </subsection>
        <subsection id="uid258" level="3">
          <bodyTitle>Gaël Varoquaux</bodyTitle>
          <simplelist>
            <li id="uid259">
              <p noindent="true">06/16: Examiner of Alberto García Durán, PhD Thesis, UTC Compiegne.</p>
            </li>
          </simplelist>
        </subsection>
      </subsection>
    </subsection>
    <subsection id="uid260" level="1">
      <bodyTitle>Popularization</bodyTitle>
      <subsection id="uid261" level="2">
        <bodyTitle>Gaël Varoquaux</bodyTitle>
        <simplelist>
          <li id="uid262">
            <p noindent="true">Unithé ou Café, Inria Saclay Ile de France</p>
          </li>
          <li id="uid263">
            <p noindent="true">Atelier IHEST Les mots du numérique - 17 novembre</p>
          </li>
        </simplelist>
      </subsection>
      <subsection id="uid264" level="2">
        <bodyTitle>Loïc Estève</bodyTitle>
        <p>Software Carpentry workshops:</p>
        <simplelist>
          <li id="uid265">
            <p noindent="true">git course at UNIC in Gif-sur-Yvette March 29-30</p>
          </li>
          <li id="uid266">
            <p noindent="true">helper at "Scientific Programming with Python and Software Engineering
Best Practices" workshop, April 28-29 at Télécom Paris</p>
          </li>
          <li id="uid267">
            <p noindent="true">git course at Proto 204, May 24-25</p>
          </li>
        </simplelist>
        <p>Mentor at Startup Weekend Artificial Intelligence, November 4-6.</p>
      </subsection>
      <subsection id="uid268" level="2">
        <bodyTitle>Olivier Grisel</bodyTitle>
        <p>"La tête au carré" radio show on France Inter in January 2016 to share
his expertise and opinion on the use and impacts of Big Data and
predictive algorithms
<footnote id="uid269" id-text="1"><ref xlink:href="https://www.franceinter.fr/emissions/la-tete-au-carre/la-tete-au-carre-05-janvier-2016" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>www.<allowbreak/>franceinter.<allowbreak/>fr/<allowbreak/>emissions/<allowbreak/>la-tete-au-carre/<allowbreak/>la-tete-au-carre-05-janvier-2016</ref></footnote>.</p>
      </subsection>
    </subsection>
  </diffusion>
  <biblio id="bibliography" html="bibliography" numero="10" titre="Bibliography">
    
    <biblStruct id="parietal-2016-bid3" type="article" rend="year" n="cite:abraham:hal-01398867">
      <identifiant type="doi" value="10.1016/j.neuroimage.2016.10.045"/>
      <identifiant type="hal" value="hal-01398867"/>
      <analytic>
        <title level="a">Deriving reproducible biomarkers from multi-site resting-state data: An Autism-based example</title>
        <author>
          <persName key="parietal-2014-idp76328">
            <foreName>Alexandre</foreName>
            <surname>Abraham</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>Michael</foreName>
            <surname>Milham</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Adriana</foreName>
            <surname>Di Martino</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>R. Cameron</foreName>
            <surname>Craddock</surname>
            <initial>R. C.</initial>
          </persName>
          <persName key="galen-2015-idm26280">
            <foreName>Dimitris</foreName>
            <surname>Samaras</surname>
            <initial>D.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid01488">
        <idno type="issn">1053-8119</idno>
        <title level="j">NeuroImage</title>
        <imprint>
          <dateStruct>
            <month>November</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01398867" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01398867</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid38" type="article" rend="year" n="cite:albughdadi:hal-01426385">
      <identifiant type="doi" value="10.1016/j.sigpro.2017.01.005"/>
      <identifiant type="hal" value="hal-01426385"/>
      <analytic>
        <title level="a">A Bayesian Non-Parametric Hidden Markov Random Model for Hemodynamic Brain Parcellation</title>
        <author>
          <persName key="mistis-2015-idp81520">
            <foreName>Mohanad</foreName>
            <surname>Albughdadi</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Lotfi</foreName>
            <surname>Chaari</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Jean-Yves</foreName>
            <surname>Tourneret</surname>
            <initial>J.-Y.</initial>
          </persName>
          <persName key="mistis-2014-idm27448">
            <foreName>Florence</foreName>
            <surname>Forbes</surname>
            <initial>F.</initial>
          </persName>
          <persName key="parietal-2014-idm29544">
            <foreName>P</foreName>
            <surname>Ciuciu</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid01772">
        <idno type="issn">0923-5965</idno>
        <title level="j">Signal Processing</title>
        <imprint>
          <dateStruct>
            <year>2017</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01426385" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01426385</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid34" type="article" rend="year" n="cite:borghesani:hal-01372551">
      <identifiant type="doi" value="10.1016/j.neuroimage.2016.08.068"/>
      <identifiant type="hal" value="hal-01372551"/>
      <analytic>
        <title level="a">Word meaning in the ventral visual path: a perceptual to conceptual gradient of semantic coding</title>
        <author>
          <persName>
            <foreName>Valentina</foreName>
            <surname>Borghesani</surname>
            <initial>V.</initial>
          </persName>
          <persName key="sierra-2014-idp97752">
            <foreName>Fabian</foreName>
            <surname>Pedregosa</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Marco</foreName>
            <surname>Buiatti</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Alexis</foreName>
            <surname>Amadon</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>Evelyn</foreName>
            <surname>Eger</surname>
            <initial>E.</initial>
          </persName>
          <persName>
            <foreName>Manuela</foreName>
            <surname>Piazza</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid01488">
        <idno type="issn">1053-8119</idno>
        <title level="j">NeuroImage</title>
        <imprint>
          <dateStruct>
            <month>September</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="http://hal.upmc.fr/hal-01372551" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>upmc.<allowbreak/>fr/<allowbreak/>hal-01372551</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid23" type="article" rend="year" n="cite:boyer:hal-01373758">
      <identifiant type="hal" value="hal-01373758"/>
      <analytic>
        <title level="a">On the generation of sampling schemes for Magnetic Resonance Imaging</title>
        <author>
          <persName>
            <foreName>Claire</foreName>
            <surname>Boyer</surname>
            <initial>C.</initial>
          </persName>
          <persName key="parietal-2014-idp77544">
            <foreName>Nicolas</foreName>
            <surname>Chauffert</surname>
            <initial>N.</initial>
          </persName>
          <persName key="parietal-2014-idm29544">
            <foreName>Philippe</foreName>
            <surname>Ciuciu</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>Jonas</foreName>
            <surname>Kahn</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Pierre</foreName>
            <surname>Weiss</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid01734">
        <idno type="issn">1936-4954</idno>
        <title level="j">SIAM Journal on Imaging Sciences</title>
        <imprint>
          <biblScope type="volume">9</biblScope>
          <biblScope type="number">4</biblScope>
          <dateStruct>
            <month>December</month>
            <year>2016</year>
          </dateStruct>
          <biblScope type="pages">2039-20972</biblScope>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01373758" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01373758</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid37" type="article" rend="year" n="cite:bzdok:hal-01350512">
      <identifiant type="doi" value="10.1016/j.neubiorev.2016.02.024"/>
      <identifiant type="hal" value="hal-01350512"/>
      <analytic>
        <title level="a">Left inferior parietal lobe engagement in social cognition and language</title>
        <author>
          <persName key="parietal-2014-idp71288">
            <foreName>Danilo</foreName>
            <surname>Bzdok</surname>
            <initial>D.</initial>
          </persName>
          <persName>
            <foreName>Gesa</foreName>
            <surname>Hartwigsen</surname>
            <initial>G.</initial>
          </persName>
          <persName>
            <foreName>Andrew</foreName>
            <surname>Reid</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>Angela R.</foreName>
            <surname>Laird</surname>
            <initial>A. R.</initial>
          </persName>
          <persName>
            <foreName>Peter T.</foreName>
            <surname>Fox</surname>
            <initial>P. T.</initial>
          </persName>
          <persName>
            <foreName>Simon</foreName>
            <surname>Eickhoff</surname>
            <initial>S.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid03166">
        <idno type="issn">0149-7634</idno>
        <title level="j">Neuroscience and Biobehavioral Reviews</title>
        <imprint>
          <dateStruct>
            <month>April</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01350512" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01350512</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid5" type="article" rend="year" n="cite:bzdok:hal-01338307">
      <identifiant type="doi" value="10.1371/journal.pcbi.1004994"/>
      <identifiant type="hal" value="hal-01338307"/>
      <analytic>
        <title level="a">Formal Models of the Network Co-occurrence Underlying Mental Operations</title>
        <author>
          <persName key="parietal-2014-idp71288">
            <foreName>Danilo</foreName>
            <surname>Bzdok</surname>
            <initial>D.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName key="parietal-2014-idp66328">
            <foreName>Olivier</foreName>
            <surname>Grisel</surname>
            <initial>O.</initial>
          </persName>
          <persName key="parietal-2014-idp79984">
            <foreName>Michael</foreName>
            <surname>Eickenberg</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Cyril</foreName>
            <surname>Poupon</surname>
            <initial>C.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid01552">
        <idno type="issn">1553-734X</idno>
        <title level="j">PLoS Computational Biology</title>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01338307" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01338307</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid11" type="article" rend="year" n="cite:bzdok:hal-01338313">
      <identifiant type="hal" value="hal-01338313"/>
      <analytic>
        <title level="a">Neuroimaging Research: From Null-Hypothesis Falsification to Out-of-sample Generalization</title>
        <author>
          <persName key="parietal-2014-idp71288">
            <foreName>Danilo</foreName>
            <surname>Bzdok</surname>
            <initial>D.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid03165">
        <idno type="issn">0013-1644</idno>
        <title level="j">Educational and Psychological Measurement</title>
        <imprint>
          <dateStruct>
            <month>August</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01338313" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01338313</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid41" type="article" rend="year" n="cite:chauffert:hal-01432720">
      <identifiant type="doi" value="10.1007/s00365-016-9346-2"/>
      <identifiant type="hal" value="hal-01432720"/>
      <analytic>
        <title level="a">A Projection Method on Measures Sets</title>
        <author>
          <persName key="parietal-2014-idp77544">
            <foreName>Nicolas</foreName>
            <surname>Chauffert</surname>
            <initial>N.</initial>
          </persName>
          <persName key="parietal-2014-idm29544">
            <foreName>Philippe</foreName>
            <surname>Ciuciu</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>Jonas</foreName>
            <surname>Kahn</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Pierre</foreName>
            <surname>Weiss</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid00439">
        <idno type="issn">0176-4276</idno>
        <title level="j">Constructive Approximation</title>
        <imprint>
          <biblScope type="volume">45</biblScope>
          <biblScope type="number">1</biblScope>
          <dateStruct>
            <month>February</month>
            <year>2017</year>
          </dateStruct>
          <biblScope type="pages">83 - 111</biblScope>
          <ref xlink:href="https://hal.inria.fr/hal-01432720" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01432720</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid7" type="article" rend="year" n="cite:chauffert:hal-01317939">
      <identifiant type="doi" value="10.1109/TMI.2016.2544251"/>
      <identifiant type="hal" value="hal-01317939"/>
      <analytic>
        <title level="a">A projection algorithm for gradient waveforms design in Magnetic Resonance Imaging</title>
        <author>
          <persName key="parietal-2014-idp77544">
            <foreName>Nicolas</foreName>
            <surname>Chauffert</surname>
            <initial>N.</initial>
          </persName>
          <persName>
            <foreName>Pierre</foreName>
            <surname>Weiss</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>Jonas</foreName>
            <surname>Kahn</surname>
            <initial>J.</initial>
          </persName>
          <persName key="parietal-2014-idm29544">
            <foreName>Philippe</foreName>
            <surname>Ciuciu</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid00738">
        <idno type="issn">0278-0062</idno>
        <title level="j">IEEE Transactions on Medical Imaging</title>
        <imprint>
          <dateStruct>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01317939" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01317939</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid4" type="article" rend="year" n="cite:eickenberg:hal-01389809">
      <identifiant type="doi" value="10.1016/j.neuroimage.2016.10.001"/>
      <identifiant type="hal" value="hal-01389809"/>
      <analytic>
        <title level="a">Seeing it all: Convolutional network layers map the function of the human visual system</title>
        <author>
          <persName key="parietal-2014-idp79984">
            <foreName>Michael</foreName>
            <surname>Eickenberg</surname>
            <initial>M.</initial>
          </persName>
          <persName key="parietal-2014-idp83648">
            <foreName>Alexandre</foreName>
            <surname>Gramfort</surname>
            <initial>A.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid01488">
        <idno type="issn">1053-8119</idno>
        <title level="j">NeuroImage</title>
        <imprint>
          <dateStruct>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01389809" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01389809</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid42" type="article" rend="year" n="cite:eickhoff:hal-01184563">
      <identifiant type="doi" value="10.1002/hbm.22933"/>
      <identifiant type="hal" value="hal-01184563"/>
      <analytic>
        <title level="a">Connectivity-Based Parcellation: Critique and Implications</title>
        <author>
          <persName>
            <foreName>Simon</foreName>
            <surname>Eickhoff</surname>
            <initial>S.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName key="parietal-2014-idp71288">
            <foreName>Danilo</foreName>
            <surname>Bzdok</surname>
            <initial>D.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid00661">
        <idno type="issn">1065-9471</idno>
        <title level="j">Human Brain Mapping</title>
        <imprint>
          <dateStruct>
            <month>January</month>
            <year>2016</year>
          </dateStruct>
          <biblScope type="pages">22</biblScope>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01184563" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01184563</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid13" type="article" rend="year" n="cite:gorgolewski:inserm-01345616">
      <identifiant type="doi" value="10.1038/sdata.2016.44"/>
      <analytic>
        <title level="a">The brain imaging data structure, a format for organizing and describing outputs of neuroimaging experiments</title>
        <author>
          <persName>
            <foreName>Krzysztof J.</foreName>
            <surname>Gorgolewski</surname>
            <initial>K. J.</initial>
          </persName>
          <persName>
            <foreName>Tibor</foreName>
            <surname>Auer</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>Vince D.</foreName>
            <surname>Calhoun</surname>
            <initial>V. D.</initial>
          </persName>
          <persName>
            <foreName>Cameron R.</foreName>
            <surname>Craddock</surname>
            <initial>C. R.</initial>
          </persName>
          <persName>
            <foreName>Samir</foreName>
            <surname>Das</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Eugene P.</foreName>
            <surname>Duff</surname>
            <initial>E. P.</initial>
          </persName>
          <persName>
            <foreName>Guillaume</foreName>
            <surname>Flandin</surname>
            <initial>G.</initial>
          </persName>
          <persName>
            <foreName>Satrajit S.</foreName>
            <surname>Ghosh</surname>
            <initial>S. S.</initial>
          </persName>
          <persName>
            <foreName>Tristan</foreName>
            <surname>Glatard</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>Yaroslav O.</foreName>
            <surname>Halchenko</surname>
            <initial>Y. O.</initial>
          </persName>
          <persName>
            <foreName>Daniel A.</foreName>
            <surname>Handwerker</surname>
            <initial>D. A.</initial>
          </persName>
          <persName>
            <foreName>Michael</foreName>
            <surname>Hanke</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>David</foreName>
            <surname>Keator</surname>
            <initial>D.</initial>
          </persName>
          <persName key="perception-2014-idp71688">
            <foreName>Xiangrui</foreName>
            <surname>Li</surname>
            <initial>X.</initial>
          </persName>
          <persName>
            <foreName>Zachary</foreName>
            <surname>Michael</surname>
            <initial>Z.</initial>
          </persName>
          <persName>
            <foreName>Camille</foreName>
            <surname>Maumet</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Nolan B.</foreName>
            <surname>Nichols</surname>
            <initial>N. B.</initial>
          </persName>
          <persName>
            <foreName>Thomas E.</foreName>
            <surname>Nichols</surname>
            <initial>T. E.</initial>
          </persName>
          <persName>
            <foreName>John</foreName>
            <surname>Pellman</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Jean-Baptiste</foreName>
            <surname>Poline</surname>
            <initial>J.-B.</initial>
          </persName>
          <persName>
            <foreName>Ariel</foreName>
            <surname>Rokem</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>Gunnar</foreName>
            <surname>Schaefer</surname>
            <initial>G.</initial>
          </persName>
          <persName>
            <foreName>Vanessa</foreName>
            <surname>Sochat</surname>
            <initial>V.</initial>
          </persName>
          <persName>
            <foreName>William</foreName>
            <surname>Triplett</surname>
            <initial>W.</initial>
          </persName>
          <persName>
            <foreName>Jessica A.</foreName>
            <surname>Turner</surname>
            <initial>J. A.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName>
            <foreName>Russell A.</foreName>
            <surname>Poldrack</surname>
            <initial>R. A.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid03167">
        <idno type="issn">2052-4463</idno>
        <title level="j">Scientific Data </title>
        <imprint>
          <biblScope type="volume">3</biblScope>
          <dateStruct>
            <month>June</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="http://www.hal.inserm.fr/inserm-01345616" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www.<allowbreak/>hal.<allowbreak/>inserm.<allowbreak/>fr/<allowbreak/>inserm-01345616</ref>
        </imprint>
      </monogr>
      <note type="bnote">160044</note>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid33" type="article" rend="year" n="cite:hoyosidrobo:hal-01366651">
      <identifiant type="hal" value="hal-01366651"/>
      <analytic>
        <title level="a">Recursive nearest agglomeration (ReNA): fast clustering for approximation of structured signals</title>
        <author>
          <persName>
            <foreName>Andrés</foreName>
            <surname>Hoyos-Idrobo</surname>
            <initial>A.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName>
            <foreName>Jonas</foreName>
            <surname>Kahn</surname>
            <initial>J.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid00747">
        <idno type="issn">0162-8828</idno>
        <title level="j">IEEE Transactions on Pattern Analysis and Machine Intelligence</title>
        <imprint>
          <dateStruct>
            <month>August</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01366651" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01366651</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid35" type="article" rend="year" n="cite:liem:hal-01403005">
      <identifiant type="doi" value="10.1016/j.neuroimage.2016.11.005"/>
      <identifiant type="hal" value="hal-01403005"/>
      <analytic>
        <title level="a">Predicting brain-age from multimodal imaging data captures cognitive impairment</title>
        <author>
          <persName>
            <foreName>Franziskus</foreName>
            <surname>Liem</surname>
            <initial>F.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName>
            <foreName>Jana</foreName>
            <surname>Kynast</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Frauke</foreName>
            <surname>Beyer</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Shahrzad Kharabian</foreName>
            <surname>Masouleh</surname>
            <initial>S. K.</initial>
          </persName>
          <persName>
            <foreName>Julia M.</foreName>
            <surname>Huntenburg</surname>
            <initial>J. M.</initial>
          </persName>
          <persName>
            <foreName>Leonie</foreName>
            <surname>Lampe</surname>
            <initial>L.</initial>
          </persName>
          <persName key="parietal-2014-idp68792">
            <foreName>Mehdi</foreName>
            <surname>Rahim</surname>
            <initial>M.</initial>
          </persName>
          <persName key="parietal-2014-idp76328">
            <foreName>Alexandre</foreName>
            <surname>Abraham</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>R. Cameron</foreName>
            <surname>Craddock</surname>
            <initial>R. C.</initial>
          </persName>
          <persName>
            <foreName>Steffi</foreName>
            <surname>Riedel-Heller</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Tobias</foreName>
            <surname>Luck</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>Markus</foreName>
            <surname>Loeffler</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Matthias L.</foreName>
            <surname>Schroeter</surname>
            <initial>M. L.</initial>
          </persName>
          <persName>
            <foreName>Anja Veronica</foreName>
            <surname>Witte</surname>
            <initial>A. V.</initial>
          </persName>
          <persName>
            <foreName>Daniel S.</foreName>
            <surname>Margulies</surname>
            <initial>D. S.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid01488">
        <idno type="issn">1053-8119</idno>
        <title level="j">NeuroImage</title>
        <imprint>
          <dateStruct>
            <month>November</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01403005" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01403005</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid36" type="article" rend="year" n="cite:rahim:hal-01353728">
      <identifiant type="doi" value="10.1109/JSTSP.2016.2600400"/>
      <identifiant type="hal" value="hal-01353728"/>
      <analytic>
        <title level="a">Transmodal Learning of Functional Networks for Alzheimer's Disease Prediction</title>
        <author>
          <persName key="parietal-2014-idp68792">
            <foreName>Mehdi</foreName>
            <surname>Rahim</surname>
            <initial>M.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
          <persName>
            <foreName>Claude</foreName>
            <surname>Comtat</surname>
            <initial>C.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid00690">
        <idno type="issn">1932-4553</idno>
        <title level="j">IEEE Journal of Selected Topics in Signal Processing</title>
        <imprint>
          <biblScope type="volume">10</biblScope>
          <biblScope type="number">7</biblScope>
          <dateStruct>
            <month>October</month>
            <year>2016</year>
          </dateStruct>
          <biblScope type="pages">1204 - 1213</biblScope>
          <ref xlink:href="https://hal.inria.fr/hal-01353728" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01353728</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid32" type="incollection" rend="year" n="cite:thirion:hal-01419347">
      <identifiant type="hal" value="hal-01419347"/>
      <analytic>
        <title level="a">Functional Neuroimaging Group Studies</title>
        <author>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no">
        <editor role="editor">
          <persName>
            <foreName>Hernando</foreName>
            <surname>Ombao</surname>
            <initial>H.</initial>
          </persName>
          <persName>
            <foreName>Martin</foreName>
            <surname>Lindquist</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Wesley</foreName>
            <surname>Thompson</surname>
            <initial>W.</initial>
          </persName>
          <persName>
            <foreName>John</foreName>
            <surname>Aston</surname>
            <initial>J.</initial>
          </persName>
        </editor>
        <title level="m">Handbook of Neuroimaging Data Analysis</title>
        <title level="s">Handbook of Modern Statistical methods</title>
        <imprint>
          <publisher>
            <orgName>Chapman &amp; Hall / CRC</orgName>
          </publisher>
          <dateStruct>
            <month>November</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01419347" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01419347</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid6" type="article" rend="year" n="cite:varoquaux:hal-01332785">
      <identifiant type="doi" value="10.1016/j.neuroimage.2016.10.038"/>
      <identifiant type="hal" value="hal-01332785"/>
      <analytic>
        <title level="a">Assessing and tuning brain decoders: cross-validation, caveats, and guidelines</title>
        <author>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName>
            <foreName>Pradeep A</foreName>
            <surname>Reddy Raamana</surname>
            <initial>P. A.</initial>
          </persName>
          <persName>
            <foreName>Denis A</foreName>
            <surname>Engemann</surname>
            <initial>D. A.</initial>
          </persName>
          <persName>
            <foreName>Andrés A</foreName>
            <surname>Hoyos-Idrobo</surname>
            <initial>A. A.</initial>
          </persName>
          <persName key="parietal-2014-idp88600">
            <foreName>Yannick A</foreName>
            <surname>Schwartz</surname>
            <initial>Y. A.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand A</foreName>
            <surname>Thirion</surname>
            <initial>B. A.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid01488">
        <idno type="issn">1053-8119</idno>
        <title level="j">NeuroImage</title>
        <imprint>
          <dateStruct>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01332785" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01332785</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid17" type="inproceedings" rend="year" n="cite:albughdadi:hal-01261982">
      <identifiant type="hal" value="hal-01261982"/>
      <analytic>
        <title level="a">Multi-subject joint parcellation detection estimation in functional MRI</title>
        <author>
          <persName key="mistis-2015-idp81520">
            <foreName>Mohanad</foreName>
            <surname>Albughdadi</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Lotfi</foreName>
            <surname>Chaari</surname>
            <initial>L.</initial>
          </persName>
          <persName key="mistis-2014-idm27448">
            <foreName>Florence</foreName>
            <surname>Forbes</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Jean-Yves</foreName>
            <surname>Tourneret</surname>
            <initial>J.-Y.</initial>
          </persName>
          <persName key="parietal-2014-idm29544">
            <foreName>Philippe</foreName>
            <surname>Ciuciu</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="yes" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">13th IEEE International Symposium on Biomedical Imaging</title>
        <loc>Prague, Czech Republic</loc>
        <imprint>
          <dateStruct>
            <month>April</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01261982" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01261982</ref>
        </imprint>
        <meeting id="cid88475">
          <title>IEEE International Symposium on Biomedical Imaging : From Nano to Macro</title>
          <num>13</num>
          <abbr type="sigle">ISBI</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid21" type="inproceedings" rend="year" n="cite:bekhti:hal-01313567">
      <identifiant type="doi" value="10.1109/PRNI.2016.7552337"/>
      <identifiant type="hal" value="hal-01313567"/>
      <analytic>
        <title level="a">M/EEG source localization with multi-scale time-frequency dictionaries</title>
        <author>
          <persName>
            <foreName>Yousra</foreName>
            <surname>Bekhti</surname>
            <initial>Y.</initial>
          </persName>
          <persName>
            <foreName>Daniel</foreName>
            <surname>Strohmeier</surname>
            <initial>D.</initial>
          </persName>
          <persName>
            <foreName>Mainak</foreName>
            <surname>Jas</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Roland</foreName>
            <surname>Badeau</surname>
            <initial>R.</initial>
          </persName>
          <persName key="parietal-2014-idp83648">
            <foreName>Alexandre</foreName>
            <surname>Gramfort</surname>
            <initial>A.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="no" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">6th International Workshop on Pattern Recognition in Neuroimaging (PRNI)</title>
        <loc>Trento, Italy</loc>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01313567" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01313567</ref>
        </imprint>
        <meeting id="cid538352">
          <title>IEEE International Workshop on Pattern Recognition in NeuroImaging</title>
          <num>6</num>
          <abbr type="sigle">PRNI</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid26" type="inproceedings" rend="year" n="cite:belilovsky:hal-01248844">
      <identifiant type="hal" value="hal-01248844"/>
      <analytic>
        <title level="a">Testing for Differences in Gaussian Graphical Models: Applications to Brain Connectivity</title>
        <author>
          <persName key="galen-2014-idp71392">
            <foreName>Eugene</foreName>
            <surname>Belilovsky</surname>
            <initial>E.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName key="galen-2014-idp61768">
            <foreName>Matthew B.</foreName>
            <surname>Blaschko</surname>
            <initial>M. B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="yes" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">Neural Information Processing Systems (NIPS) 2016</title>
        <loc>Barcelona, Spain</loc>
        <imprint>
          <dateStruct>
            <month>December</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01248844" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01248844</ref>
        </imprint>
        <meeting id="cid29560">
          <title>Annual Conference on Neural Information Processing Systems</title>
          <num>30</num>
          <abbr type="sigle">NIPS</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid20" type="inproceedings" rend="year" n="cite:dadi:hal-01319131">
      <identifiant type="hal" value="hal-01319131"/>
      <analytic>
        <title level="a">Comparing functional connectivity based predictive models across datasets</title>
        <author>
          <persName key="parietal-2015-idp66104">
            <foreName>Kamalaker</foreName>
            <surname>Dadi</surname>
            <initial>K.</initial>
          </persName>
          <persName key="parietal-2014-idp76328">
            <foreName>Alexandre</foreName>
            <surname>Abraham</surname>
            <initial>A.</initial>
          </persName>
          <persName key="parietal-2014-idp68792">
            <foreName>Mehdi</foreName>
            <surname>Rahim</surname>
            <initial>M.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="no" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">PRNI 2016: 6th International Workshop on Pattern Recognition in Neuroimaging</title>
        <loc>Trento, Italy</loc>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01319131" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01319131</ref>
        </imprint>
        <meeting id="cid538352">
          <title>IEEE International Workshop on Pattern Recognition in NeuroImaging</title>
          <num>6</num>
          <abbr type="sigle">PRNI</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid30" type="inproceedings" rend="year" n="cite:dohmatob:hal-01384460">
      <identifiant type="hal" value="hal-01384460"/>
      <analytic>
        <title level="a">A simple algorithm for computing Nash-equilibria in incomplete information games</title>
        <author>
          <persName key="parietal-2014-idp78768">
            <foreName>Elvis</foreName>
            <surname>Dohmatob</surname>
            <initial>E.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="yes" x-invited-conference="yes" x-editorial-board="yes">
        <title level="m">OPT2016 – NIPS workshop on optimization for machine learning</title>
        <loc>Barcelona, Spain</loc>
        <imprint>
          <dateStruct>
            <month>December</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01384460" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01384460</ref>
        </imprint>
        <meeting id="cid354996">
          <title>NIPS Workshop on Optimization for Machine Learning</title>
          <num>2016</num>
          <abbr type="sigle">OPT</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid12" type="inproceedings" rend="year" n="cite:dohmatob:hal-01265372">
      <identifiant type="hal" value="hal-01265372"/>
      <analytic>
        <title level="a">Local Q-Linear Convergence and Finite-time Active Set Identification of ADMM on a Class of Penalized Regression Problems</title>
        <author>
          <persName key="parietal-2014-idp78768">
            <foreName>Elvis</foreName>
            <surname>Dohmatob</surname>
            <initial>E.</initial>
          </persName>
          <persName key="parietal-2014-idp79984">
            <foreName>Michael</foreName>
            <surname>Eickenberg</surname>
            <initial>M.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="no" x-invited-conference="yes" x-editorial-board="yes">
        <title level="m">ICASSP, International Conference on Acoustics, Speach, and Signal Processing</title>
        <loc>China</loc>
        <imprint>
          <dateStruct>
            <month>March</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01265372" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01265372</ref>
        </imprint>
        <meeting id="cid80145">
          <title>IEEE International Conference on Acoustics, Speech and Signal Processing</title>
          <num>41</num>
          <abbr type="sigle">ICASSP</abbr>
        </meeting>
      </monogr>
      <note type="bnote">
        <ref xlink:href="http://icassp2016.org/default.asp" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>icassp2016.<allowbreak/>org/<allowbreak/>default.<allowbreak/>asp</ref>
      </note>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid1" type="inproceedings" rend="year" n="cite:dohmatob:hal-01369134">
      <identifiant type="hal" value="hal-01369134"/>
      <analytic>
        <title level="a">Learning brain regions via large-scale online structured sparse dictionary-learning</title>
        <author>
          <persName key="parietal-2014-idp78768">
            <foreName>Elvis</foreName>
            <surname>Dohmatob</surname>
            <initial>E.</initial>
          </persName>
          <persName key="parietal-2015-idp82360">
            <foreName>Arthur</foreName>
            <surname>Mensch</surname>
            <initial>A.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="no" x-invited-conference="yes" x-editorial-board="yes">
        <title level="m">Neural Information Processing Systems (NIPS)</title>
        <loc>Barcelona, Spain</loc>
        <imprint>
          <dateStruct>
            <month>December</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01369134" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01369134</ref>
        </imprint>
        <meeting id="cid29560">
          <title>Annual Conference on Neural Information Processing Systems</title>
          <num>23</num>
          <abbr type="sigle">NIPS</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid14" type="inproceedings" rend="year" n="cite:hoyosidrobo:hal-01313814">
      <identifiant type="hal" value="hal-01313814"/>
      <analytic>
        <title level="a">Fast brain decoding with random sampling and random projections</title>
        <author>
          <persName>
            <foreName>Andrés</foreName>
            <surname>Hoyos-Idrobo</surname>
            <initial>A.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="no" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">PRNI 2016: the 6th International Workshop on Pattern Recognition in Neuroimaging</title>
        <loc>Trento, Italy</loc>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01313814" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01313814</ref>
        </imprint>
        <meeting id="cid538352">
          <title>IEEE International Workshop on Pattern Recognition in NeuroImaging</title>
          <num>6</num>
          <abbr type="sigle">PRNI</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid29" type="inproceedings" rend="year" n="cite:laroche:hal-01353252">
      <identifiant type="hal" value="hal-01353252"/>
      <analytic>
        <title level="a">Genre specific dictionaries for harmonic/percussive source separation</title>
        <author>
          <persName key="aromath-2016-idp142944">
            <foreName>Clément</foreName>
            <surname>Laroche</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Hélène</foreName>
            <surname>Papadopoulos</surname>
            <initial>H.</initial>
          </persName>
          <persName key="parietal-2014-idm26872">
            <foreName>Matthieu</foreName>
            <surname>Kowalski</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Gaël</foreName>
            <surname>Richard</surname>
            <initial>G.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="no" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">ISMIR The 17th International Society for Music Information Retrieval Conference</title>
        <loc>New York, United States</loc>
        <imprint>
          <dateStruct>
            <month>August</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01353252" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01353252</ref>
        </imprint>
        <meeting id="cid95673">
          <title>International Society for Music Information Retrieval Conference</title>
          <num>17</num>
          <abbr type="sigle">ISMIR</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid40" type="inproceedings" rend="year" n="cite:laroche:hal-01438851">
      <identifiant type="hal" value="hal-01438851"/>
      <analytic>
        <title level="a">Drum extraction in single channel audio signals using multi-layer non negative matrix factor deconvolution</title>
        <author>
          <persName key="aromath-2016-idp142944">
            <foreName>Clément</foreName>
            <surname>Laroche</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Hélène</foreName>
            <surname>Papadopoulos</surname>
            <initial>H.</initial>
          </persName>
          <persName key="parietal-2014-idm26872">
            <foreName>Matthieu</foreName>
            <surname>Kowalski</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Gaël</foreName>
            <surname>Richard</surname>
            <initial>G.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="no" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">ICASSP</title>
        <loc>Nouvelle Orleans, United States</loc>
        <imprint>
          <dateStruct>
            <month>March</month>
            <year>2017</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01438851" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01438851</ref>
        </imprint>
        <meeting id="cid80145">
          <title>IEEE International Conference on Acoustics, Speech and Signal Processing</title>
          <num>2011</num>
          <abbr type="sigle">ICASSP</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid0" type="inproceedings" rend="year" n="cite:mensch:hal-01308934">
      <identifiant type="hal" value="hal-01308934"/>
      <analytic>
        <title level="a">Dictionary Learning for Massive Matrix Factorization</title>
        <author>
          <persName key="parietal-2015-idp82360">
            <foreName>Arthur</foreName>
            <surname>Mensch</surname>
            <initial>A.</initial>
          </persName>
          <persName key="lear-2014-idp65680">
            <foreName>Julien</foreName>
            <surname>Mairal</surname>
            <initial>J.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="yes" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">International Conference on Machine Learning</title>
        <loc>New York, United States</loc>
        <title level="s">Proceedings of the 33rd Internation Conference on Machine Learning</title>
        <imprint>
          <biblScope type="volume">48</biblScope>
          <dateStruct>
            <month>June</month>
            <year>2016</year>
          </dateStruct>
          <biblScope type="pages">1737–1746</biblScope>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01308934" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01308934</ref>
        </imprint>
        <meeting id="cid32516">
          <title>International Conference on Machine Learning</title>
          <num>27</num>
          <abbr type="sigle">ICML</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid24" type="inproceedings" rend="year" n="cite:mensch:hal-01405058">
      <identifiant type="hal" value="hal-01405058"/>
      <analytic>
        <title level="a">Subsampled online matrix factorization with convergence guarantees</title>
        <author>
          <persName key="parietal-2015-idp82360">
            <foreName>Arthur</foreName>
            <surname>Mensch</surname>
            <initial>A.</initial>
          </persName>
          <persName key="lear-2014-idp65680">
            <foreName>Julien</foreName>
            <surname>Mairal</surname>
            <initial>J.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="no" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">NIPS Workshop on Optimization for Machine Learning</title>
        <loc>Barcelone, Spain</loc>
        <imprint>
          <dateStruct>
            <month>December</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01405058" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01405058</ref>
        </imprint>
        <meeting id="cid354996">
          <title>NIPS Workshop on Optimization for Machine Learning</title>
          <num>2016</num>
          <abbr type="sigle">OPT</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid10" type="inproceedings" rend="year" n="cite:mensch:hal-01271033">
      <identifiant type="doi" value="10.1109/ISBI.2016.7493501"/>
      <identifiant type="hal" value="hal-01271033"/>
      <analytic>
        <title level="a">Compressed Online Dictionary Learning for Fast Resting-State fMRI Decomposition</title>
        <author>
          <persName key="parietal-2015-idp82360">
            <foreName>Arthur</foreName>
            <surname>Mensch</surname>
            <initial>A.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="no" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">International Symposium on Biomedical Imaging (ISBI 2016) "From Nano to Macro"</title>
        <loc>Prague, Czech Republic</loc>
        <title level="s">13th International Symposium on Biomedical Imaging (ISBI)</title>
        <imprint>
          <publisher>
            <orgName>IEEE</orgName>
          </publisher>
          <publisher>
            <orgName type="organisation">IEEE</orgName>
          </publisher>
          <dateStruct>
            <month>April</month>
            <year>2016</year>
          </dateStruct>
          <biblScope type="pages">1282-1285</biblScope>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01271033" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01271033</ref>
        </imprint>
        <meeting id="cid88475">
          <title>IEEE International Symposium on Biomedical Imaging : From Nano to Macro</title>
          <num>13</num>
          <abbr type="sigle">ISBI</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid19" type="inproceedings" rend="year" n="cite:pelle:hal-01261976">
      <identifiant type="hal" value="hal-01261976"/>
      <analytic>
        <title level="a">Multivariate Hurst Exponent Estimation in FMRI. Application to Brain Decoding of Perceptual Learning</title>
        <author>
          <persName key="parietal-2015-idp94568">
            <foreName>Hubert</foreName>
            <surname>Pellé</surname>
            <initial>H.</initial>
          </persName>
          <persName key="parietal-2014-idm29544">
            <foreName>Philippe</foreName>
            <surname>Ciuciu</surname>
            <initial>P.</initial>
          </persName>
          <persName key="parietal-2014-idp68792">
            <foreName>Mehdi</foreName>
            <surname>Rahim</surname>
            <initial>M.</initial>
          </persName>
          <persName key="parietal-2014-idp78768">
            <foreName>Elvis</foreName>
            <surname>Dohmatob</surname>
            <initial>E.</initial>
          </persName>
          <persName>
            <foreName>Patrice</foreName>
            <surname>Abry</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>Virginie</foreName>
            <surname>Van Wassenhove</surname>
            <initial>V.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="yes" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">13th IEEE International Symposium on Biomedical Imaging</title>
        <loc>Prague, Czech Republic</loc>
        <imprint>
          <dateStruct>
            <month>April</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01261976" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01261976</ref>
        </imprint>
        <meeting id="cid88475">
          <title>IEEE International Symposium on Biomedical Imaging : From Nano to Macro</title>
          <num>13</num>
          <abbr type="sigle">ISBI</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid8" type="inproceedings" rend="year" n="cite:rahim:hal-01355478">
      <identifiant type="hal" value="hal-01355478"/>
      <analytic>
        <title level="a">Impact of perceptual learning on resting-state fMRI connectivity: A supervised classification study</title>
        <author>
          <persName key="parietal-2014-idp68792">
            <foreName>Mehdi</foreName>
            <surname>Rahim</surname>
            <initial>M.</initial>
          </persName>
          <persName key="parietal-2014-idm29544">
            <foreName>Philippe</foreName>
            <surname>Ciuciu</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>Salma</foreName>
            <surname>Bougacha</surname>
            <initial>S.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="yes" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">Eusipco 2016</title>
        <loc>Budapest, Hungary</loc>
        <imprint>
          <dateStruct>
            <month>August</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01355478" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01355478</ref>
        </imprint>
        <meeting id="cid70310">
          <title>European Signal Processing Conference</title>
          <num>24</num>
          <abbr type="sigle">EUSIPCO</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid2" type="inproceedings" rend="year" n="cite:varoquaux:hal-01334551">
      <identifiant type="hal" value="hal-01334551"/>
      <analytic>
        <title level="a">Social-sparsity brain decoders: faster spatial sparsity</title>
        <author>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName key="parietal-2014-idm26872">
            <foreName>Matthieu</foreName>
            <surname>Kowalski</surname>
            <initial>M.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="no" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">Pattern Recognition in NeuroImaging</title>
        <loc>Trento, Italy</loc>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01334551" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01334551</ref>
        </imprint>
        <meeting id="cid538352">
          <title>IEEE International Workshop on Pattern Recognition in NeuroImaging</title>
          <num>2012</num>
          <abbr type="sigle">PRNI</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid22" type="unpublished" rend="year" n="cite:albughdadi:hal-01275622">
      <identifiant type="hal" value="hal-01275622"/>
      <monogr>
        <title level="m">Hemodynamic Brain Parcellation Using A Non-Parametric Bayesian Approach</title>
        <author>
          <persName key="mistis-2015-idp81520">
            <foreName>Mohanad</foreName>
            <surname>Albughdadi</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Lotfi</foreName>
            <surname>Chaari</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Jean-Yves</foreName>
            <surname>Tourneret</surname>
            <initial>J.-Y.</initial>
          </persName>
          <persName key="mistis-2014-idm27448">
            <foreName>Florence</foreName>
            <surname>Forbes</surname>
            <initial>F.</initial>
          </persName>
          <persName key="parietal-2014-idm29544">
            <foreName>Philippe</foreName>
            <surname>Ciuciu</surname>
            <initial>P.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>February</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01275622" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01275622</ref>
        </imprint>
      </monogr>
      <note type="bnote">working paper or preprint</note>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid31" type="unpublished" rend="year" n="cite:belilovsky:hal-01306491">
      <identifiant type="hal" value="hal-01306491"/>
      <monogr>
        <title level="m">Learning to Discover Graphical Model Structures</title>
        <author>
          <persName key="galen-2014-idp71392">
            <foreName>Eugene</foreName>
            <surname>Belilovsky</surname>
            <initial>E.</initial>
          </persName>
          <persName key="parietal-2014-idp73776">
            <foreName>Kyle</foreName>
            <surname>Kastner</surname>
            <initial>K.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gaël</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
          <persName key="galen-2014-idp61768">
            <foreName>Matthew</foreName>
            <surname>Blaschko</surname>
            <initial>M.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01306491" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01306491</ref>
        </imprint>
      </monogr>
      <note type="bnote">working paper or preprint</note>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid9" type="unpublished" rend="year" n="cite:bzdok:hal-01356923">
      <identifiant type="hal" value="hal-01356923"/>
      <monogr>
        <title level="m">The Future of Data Analysis in the Neurosciences</title>
        <author>
          <persName key="parietal-2014-idp71288">
            <foreName>Danilo</foreName>
            <surname>Bzdok</surname>
            <initial>D.</initial>
          </persName>
          <persName>
            <foreName>B.T. Thomas</foreName>
            <surname>Yeo</surname>
            <initial>B. T.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>August</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01356923" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01356923</ref>
        </imprint>
      </monogr>
      <note type="bnote">working paper or preprint</note>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid18" type="unpublished" rend="year" n="cite:chaari:hal-01255465">
      <identifiant type="hal" value="hal-01255465"/>
      <monogr>
        <title level="m">Subject-level Joint Parcellation-Detection-Estimation in fMRI</title>
        <author>
          <persName>
            <foreName>Lotfi</foreName>
            <surname>Chaari</surname>
            <initial>L.</initial>
          </persName>
          <persName key="cqfd-2014-idp69448">
            <foreName>Solveig</foreName>
            <surname>Badillo</surname>
            <initial>S.</initial>
          </persName>
          <persName key="mistis-2014-idp69960">
            <foreName>Thomas</foreName>
            <surname>Vincent</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>Ghislaine</foreName>
            <surname>Dehaene-Lambertz</surname>
            <initial>G.</initial>
          </persName>
          <persName key="mistis-2014-idm27448">
            <foreName>Florence</foreName>
            <surname>Forbes</surname>
            <initial>F.</initial>
          </persName>
          <persName key="parietal-2014-idm29544">
            <foreName>Philippe</foreName>
            <surname>Ciuciu</surname>
            <initial>P.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>January</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01255465" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01255465</ref>
        </imprint>
      </monogr>
      <note type="bnote">working paper or preprint</note>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid27" type="unpublished" rend="year" n="cite:feng:hal-01297471">
      <identifiant type="hal" value="hal-01297471"/>
      <monogr>
        <title level="m">A Unified Approach for Over and Under-Determined Blind Source Separation Based on Both Sparsity and Decorrelation</title>
        <author>
          <persName>
            <foreName>Fangchen</foreName>
            <surname>Feng</surname>
            <initial>F.</initial>
          </persName>
          <persName key="parietal-2014-idm26872">
            <foreName>Matthieu</foreName>
            <surname>Kowalski</surname>
            <initial>M.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>April</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01297471" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01297471</ref>
        </imprint>
      </monogr>
      <note type="bnote">working paper or preprint</note>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid25" type="unpublished" rend="year" n="cite:hadjselem:cea-01324021">
      <identifiant type="hal" value="cea-01324021"/>
      <monogr>
        <title level="m">Supplementary materials: Iterative Smoothing Proximal Gradient for Regression with Structured Sparsity</title>
        <author>
          <persName>
            <foreName>Fouad</foreName>
            <surname>Hadj-Selem</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Tommy</foreName>
            <surname>Löfstedt</surname>
            <initial>T.</initial>
          </persName>
          <persName key="parietal-2014-idp78768">
            <foreName>Elvis</foreName>
            <surname>Dohmatob</surname>
            <initial>E.</initial>
          </persName>
          <persName>
            <foreName>Vincent</foreName>
            <surname>Frouin</surname>
            <initial>V.</initial>
          </persName>
          <persName key="aramis-2014-idp115368">
            <foreName>Mathieu</foreName>
            <surname>Dubois</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Vincent</foreName>
            <surname>Guillemot</surname>
            <initial>V.</initial>
          </persName>
          <persName>
            <foreName>Edouard</foreName>
            <surname>Duchesnay</surname>
            <initial>E.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal-cea.archives-ouvertes.fr/cea-01324021" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal-cea.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>cea-01324021</ref>
        </imprint>
      </monogr>
      <note type="bnote">working paper or preprint</note>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid28" type="unpublished" rend="year" n="cite:kowalski:hal-01199615">
      <identifiant type="hal" value="hal-01199615"/>
      <monogr>
        <title level="m">Convex Optimization approach to signals with fast varying instantaneous frequency</title>
        <author>
          <persName key="parietal-2014-idm26872">
            <foreName>Matthieu</foreName>
            <surname>Kowalski</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Adrien</foreName>
            <surname>Meynard</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>Hau-tieng</foreName>
            <surname>Wu</surname>
            <initial>H.-t.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>April</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01199615" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01199615</ref>
        </imprint>
      </monogr>
      <note type="bnote">working paper or preprint</note>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid16" type="misc" rend="year" n="cite:lazarus:hal-01296496">
      <identifiant type="hal" value="hal-01296496"/>
      <monogr x-scientific-popularization="no" x-editorial-board="no" x-international-audience="yes" x-proceedings="no" x-invited-conference="yes">
        <title level="m">Physically plausible K-space trajectories for Compressed Sensing in MRI: From simulations to real acquisitions</title>
        <author>
          <persName key="parietal-2015-idp80968">
            <foreName>C</foreName>
            <surname>Lazarus</surname>
            <initial>C.</initial>
          </persName>
          <persName key="parietal-2014-idp77544">
            <foreName>N</foreName>
            <surname>Chauffert</surname>
            <initial>N.</initial>
          </persName>
          <persName>
            <foreName>J</foreName>
            <surname>Kahn</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Pierre</foreName>
            <surname>Weiss</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>A</foreName>
            <surname>Vignaud</surname>
            <initial>A.</initial>
          </persName>
          <persName key="parietal-2014-idm29544">
            <foreName>P</foreName>
            <surname>Ciuciu</surname>
            <initial>P.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>March</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01296496" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01296496</ref>
        </imprint>
      </monogr>
      <note type="howpublished">CEA Visiting committee on High Performance Computing</note>
      <note type="bnote">Poster</note>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid39" type="unpublished" rend="year" n="cite:mensch:hal-01431618">
      <identifiant type="hal" value="hal-01431618"/>
      <monogr>
        <title level="m">Stochastic Subsampling for Factorizing Huge Matrices</title>
        <author>
          <persName key="parietal-2015-idp82360">
            <foreName>Arthur</foreName>
            <surname>Mensch</surname>
            <initial>A.</initial>
          </persName>
          <persName key="lear-2014-idp65680">
            <foreName>Julien</foreName>
            <surname>Mairal</surname>
            <initial>J.</initial>
          </persName>
          <persName key="parietal-2014-idm31000">
            <foreName>Bertrand</foreName>
            <surname>Thirion</surname>
            <initial>B.</initial>
          </persName>
          <persName key="parietal-2014-idm28112">
            <foreName>Gael</foreName>
            <surname>Varoquaux</surname>
            <initial>G.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>January</month>
            <year>2017</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01431618" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01431618</ref>
        </imprint>
      </monogr>
      <note type="bnote">working paper or preprint</note>
    </biblStruct>
    
    <biblStruct id="parietal-2016-bid15" type="unpublished" rend="year" n="cite:rahim:hal-01297845">
      <identifiant type="hal" value="hal-01297845"/>
      <monogr>
        <title level="m">Functional connectivity outperforms scale-free brain dynamics as fMRI predictive feature of perceptual learning underwent in MEG</title>
        <author>
          <persName key="parietal-2014-idp68792">
            <foreName>Mehdi</foreName>
            <surname>Rahim</surname>
            <initial>M.</initial>
          </persName>
          <persName key="parietal-2014-idm29544">
            <foreName>Philippe</foreName>
            <surname>Ciuciu</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>Salma</foreName>
            <surname>Bougacha</surname>
            <initial>S.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>February</month>
            <year>2016</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01297845" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01297845</ref>
        </imprint>
      </monogr>
      <note type="bnote">working paper or preprint</note>
    </biblStruct>
  </biblio>
</raweb>
