Lecture

Graph Theory in Neural Signal Processing

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

NX-421: Neural signals and signal processing

Understanding, processing, and analysis of signals and images obtained from the central and peripheral nervous system ...

Description

This lecture covers topics in neural signal processing, including Partial Least-Squares Correlation (PLSC), Independent Component Analysis (ICA), Central Limit Theorem, and the relevance of multivariate methods. It explores the impact of permutations, symmetry of ICA, and the distinction between PCA and ICA. The instructor discusses the application of graph theory in modeling brain networks, graph measures, connectomics, and graph partitioning. The lecture delves into the analysis of multi-voxel patterns in fMRI data, linear classification, loss functions, and cross-validation techniques.

Instructors (2)

Dimitri Nestor Alice Van De Ville

Expertise Brain and spinal cord imaging, signal and image processing, network science, dynamic systems Teaching & PhD PhD Students Alexandre Cionca, Chun Hei Michael Chan, Flavia Petruso, Bassam El Rawas, Nikolaos Molochidis, Christophe Pascal Jérémie Chênes, Fabrice Jean Guibert, Alessio Siviglia, Ekansh Sareen, Beatrice Lugli Past EPFL PhD Students Djano Kandaswamy, Fikret Isik Karahanoglu, Nora Leonardi, Zafer Dogan, Jeffrey Adam Kasten, Naghmeh Ghazaleh, Rotem Roza Kopel, Daniela Maria Zöller, Thomas

Silvestro Micera

Short biographical sketch Silvestro Micera received the University degree (Laurea) in Electrical Engineering from the University of Pisa, in 1996, and the Ph.D. degree in Biomedical Engineering from the Scuola Superiore Sant'Anna, in 2000. From 2000 to 2009, he has been an Assistant Professor of BioRobotics at the Scuola Superiore Sant'Anna where he is now the Head of the Neural Engineering group. In 2007 he was a Visiting Scientist at the Massachusetts Institute of Technology, Cambridge, USA with a Fulbri

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related concepts (32)

Neural circuit

A neural circuit (also known as a biological neural network BNNs) is a population of neurons interconnected by synapses to carry out a specific function when activated. Multiple neural circuits interconnect with one another to form large scale brain networks. Neural circuits have inspired the design of artificial neural networks, though there are significant differences. Early treatments of neural networks can be found in Herbert Spencer's Principles of Psychology, 3rd edition (1872), Theodor Meynert's Psychiatry (1884), William James' Principles of Psychology (1890), and Sigmund Freud's Project for a Scientific Psychology (composed 1895).

Neural oscillation

Neural oscillations, or brainwaves, are rhythmic or repetitive patterns of neural activity in the central nervous system. Neural tissue can generate oscillatory activity in many ways, driven either by mechanisms within individual neurons or by interactions between neurons. In individual neurons, oscillations can appear either as oscillations in membrane potential or as rhythmic patterns of action potentials, which then produce oscillatory activation of post-synaptic neurons.

Connectivity (graph theory)

In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v.

Path (graph theory)

In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts.

Connectome

A connectome (kəˈnɛktoʊm) is a comprehensive map of neural connections in the brain, and may be thought of as its "wiring diagram". An organism's nervous system is made up of neurons which communicate through synapses. A connectome is constructed by tracing the neuron in a nervous system and mapping where neurons are connected through synapses. The significance of the connectome stems from the realization that the structure and function of the human brain are intricately linked, through multiple levels and modes of brain connectivity.

Related lectures (64)

Neural Signals and Connectomes

Explores neural signals, connectomes, graph theory, and multi-voxel pattern analysis in fMRI trials.

Assembly: Mechanism Theory

Covers the problem statement of assembly, precision requirements, common couplings, stability, and spatial vectors.

Graph Models and Brain Connectomics

Explores graph theory in brain connectomics, MRI applications, network analysis relevance, and individual fingerprinting.

Facebook Social Graph: Structure and Small-World Phenomenon

Examines the Facebook social graph structure, small-world phenomenon, four degrees of separation, and user homophily.

Fundamentals of Brain Connectomics