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

Lecture

Neurophysiological Data Analysis

Description

This lecture covers the analysis of neurophysiological data, focusing on Vm recordings. Topics include identifying action potentials, computing firing rates, measuring AP threshold and duration, analyzing subthreshold activity, and performing spectral analysis using Fast-Fourier Transform. The lecture also delves into event-triggered Vm and firing rate analysis, as well as MATLAB demonstrations for practical implementation.

Official source

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis

Theoretical computer science

Programming language theory: High-level programming languages

Related concepts (32)

Fast Fourier transform

A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies. This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical.

Non-uniform discrete Fourier transform

In applied mathematics, the nonuniform discrete Fourier transform (NUDFT or NDFT) of a signal is a type of Fourier transform, related to a discrete Fourier transform or discrete-time Fourier transform, but in which the input signal is not sampled at equally spaced points or frequencies (or both). It is a generalization of the shifted DFT. It has important applications in signal processing, magnetic resonance imaging, and the numerical solution of partial differential equations.

Discrete-time Fourier transform

In mathematics, the discrete-time Fourier transform (DTFT), also called the finite Fourier transform, is a form of Fourier analysis that is applicable to a sequence of values. The DTFT is often used to analyze samples of a continuous function. The term discrete-time refers to the fact that the transform operates on discrete data, often samples whose interval has units of time. From uniformly spaced samples it produces a function of frequency that is a periodic summation of the continuous Fourier transform of the original continuous function.

Postsynaptic potential

Postsynaptic potentials are changes in the membrane potential of the postsynaptic terminal of a chemical synapse. Postsynaptic potentials are graded potentials, and should not be confused with action potentials although their function is to initiate or inhibit action potentials. They are caused by the presynaptic neuron releasing neurotransmitters from the terminal bouton at the end of an axon into the synaptic cleft. The neurotransmitters bind to receptors on the postsynaptic terminal, which may be a neuron or a muscle cell in the case of a neuromuscular junction.

Fourier transform

In physics and mathematics, the Fourier transform (FT) is a transform that converts a function into a form that describes the frequencies present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made the Fourier transform is sometimes called the frequency domain representation of the original function.

Related lectures (58)

Neurophysiological Data Analysis

Covers neurophysiological data analysis, including data structure organization and action potential detection.

Neurophysiological Data Analysis

Covers neurophysiological data analysis, including AP detection, firing rate computation, and spectral analysis, with a focus on predicting cell classes.

Numerical Methods for Boundary Value Problems

Covers numerical methods for solving boundary value problems using finite difference, FFT, and finite element methods.

Numerical Methods: Boundary Value Problems

Covers numerical methods for solving boundary value problems using Crank-Nicolson and FFT.

MATLAB Essentials: Functions and Variables

Covers essential MATLAB functions, variables, loops, and debugging tools.

Related concepts (32)

Fast Fourier transform

Non-uniform discrete Fourier transform

Discrete-time Fourier transform

Postsynaptic potential

Fourier transform