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

Lecture

Fourier Transform: Compression and Analysis

In course

MATH-250: Advanced numerical analysis I

Construction and analysis of numerical methods for the solution of problems from linear algebra, integration, approximation, and differentiation. ...

Description

This lecture covers the Fourier transform, focusing on compression techniques and spectral analysis. It discusses the compression of images using different ratios and the analysis of periodic signals through Fourier series.

Instructors (3)

Daniel Kressner

Annalisa Buffa

Simone Deparis

Official source

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis

Related concepts (32)

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.

Fourier analysis

In mathematics, Fourier analysis (ˈfʊrieɪ,_-iər) is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Joseph Fourier, who showed that representing a function as a sum of trigonometric functions greatly simplifies the study of heat transfer. The subject of Fourier analysis encompasses a vast spectrum of mathematics.

Data compression

In information theory, data compression, source coding, or bit-rate reduction is the process of encoding information using fewer bits than the original representation. Any particular compression is either lossy or lossless. Lossless compression reduces bits by identifying and eliminating statistical redundancy. No information is lost in lossless compression. Lossy compression reduces bits by removing unnecessary or less important information.

Fourier series

A Fourier series (ˈfʊrieɪ,_-iər) is an expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric series, but not all trigonometric series are Fourier series. By expressing a function as a sum of sines and cosines, many problems involving the function become easier to analyze because trigonometric functions are well understood. For example, Fourier series were first used by Joseph Fourier to find solutions to the heat equation.

Discrete Fourier transform

In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies.

Related lectures (36)

Fourier Series and Analysis

Covers Fourier series, analysis, the heat equation, Gibbs phenomenon, and Fourier transform properties.

Signal processing and vector spaces

Emphasizes the significance of vector spaces in signal processing, offering a unified framework for various signal types and system design.

Fourier Transforms: Dirac Delta, Fourier Integral, and Transform

Explores the Dirac delta, Fourier integral, and Fourier transform applications in solving PDE problems.

DFT Example: MP3 Compression

Explores how MP3 compression shapes noise to improve sound quality.

Fourier Analysis: Fourier Series and Transform