Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Neurobiological Signals: Processing and Classification

In course

COM-500: Statistical signal and data processing through applications

Building up on the basic concepts of sampling, filtering and Fourier transforms, we address stochastic modeling, spectral analysis, estimation and prediction, classification, and adaptive filtering, with an application oriented approach and hands-on numeri ...

Description

This lecture covers the processing and classification of neurobiological signals, focusing on modeling neurobiological spikes using Poisson processes and Markov chains, de-noising discrete valued signals, and characterizing data through principal component analysis. It also delves into experimental setups for studying the stimulus-response relation in insects, such as cockroaches and grasshoppers. The instructor explores the challenges of decoding brain functions and the importance of understanding the brain's response to different stimuli. Additionally, the lecture discusses data classification techniques like hidden Markov chains and mixture models, providing insights into the practical application of these concepts through Matlab practice.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Andrea Ridolfi

I am a professor of Signal Processing and Communication Technologies at Bern University of Applied Sciences. Since 2004 I hold a lecturer position at EPFL, teaching “Mathematical Principles of Signal Processing” (Doctoral School, 2004 – 2011), “Statistical Signal and Data Processing through Applications” (Master Program, (2004 – ongoing), and Signal Processing and Machine Learning for Digital Humanities (Master, 2017 – 2019, co-taught with Mathieu Salzmann). Previously, I have been working as Project Manager and R&D Engineer at EPFL (2011-2014), coordinating the LCAV activities within the NSF – Nanotera project Opensense, and as Project Manager and R&D Engineer with the biomedical signal processing group at CSEM (2006-2011).

Official source

Related concepts (32)

Markov chain

A Markov chain or Markov process is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, this may be thought of as, "What happens next depends only on the state of affairs now." A countably infinite sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC).

Markov property

In probability theory and statistics, the term Markov property refers to the memoryless property of a stochastic process, which means that its future evolution is independent of its history. It is named after the Russian mathematician Andrey Markov. The term strong Markov property is similar to the Markov property, except that the meaning of "present" is defined in terms of a random variable known as a stopping time. The term Markov assumption is used to describe a model where the Markov property is assumed to hold, such as a hidden Markov model.

Markov model

In probability theory, a Markov model is a stochastic model used to model pseudo-randomly changing systems. It is assumed that future states depend only on the current state, not on the events that occurred before it (that is, it assumes the Markov property). Generally, this assumption enables reasoning and computation with the model that would otherwise be intractable. For this reason, in the fields of predictive modelling and probabilistic forecasting, it is desirable for a given model to exhibit the Markov property.

Hidden Markov model

A hidden Markov model (HMM) is a statistical Markov model in which the system being modeled is assumed to be a Markov process — call it — with unobservable ("hidden") states. As part of the definition, HMM requires that there be an observable process whose outcomes are "influenced" by the outcomes of in a known way.

Principal component analysis

Principal component analysis (PCA) is a popular technique for analyzing large datasets containing a high number of dimensions/features per observation, increasing the interpretability of data while preserving the maximum amount of information, and enabling the visualization of multidimensional data. Formally, PCA is a statistical technique for reducing the dimensionality of a dataset. This is accomplished by linearly transforming the data into a new coordinate system where (most of) the variation in the data can be described with fewer dimensions than the initial data.

Related lectures (37)

Continuous Time Markov Chains

Introduces continuous time Markov chains on a finite state space with exponential waiting times and jump probabilities.

Hidden Markov Models: Primer

Introduces Hidden Markov Models, explaining the basic problems and algorithms like Forward-Backward, Viterbi, and Baum-Welch, with a focus on Expectation-Maximization.

Hidden Markov Models (HMM): Theory

Covers Hidden Markov Models (HMM) for modeling time series data and decoding using the Viterbi Algorithm.

MCMC Examples and Error Estimation

Covers Markov Chain Monte Carlo examples and error estimation methods.

Markov Chains and Applications