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

Lecture

Image Filtering Introduction

In course

BIO-695: Image Processing for Life Science

Registration details will be announced via email. It takes place yearly from Sept./October to December & intends to teach image processing with a strong emphasis of applications in life sciences. The idea is to enable the participants to solve image-proces ...

Description

This lecture introduces the fundamental principles of image filtering, explaining its versatility and applications in bio-medical image analysis. The instructor will cover the differences between filtering and point operations, as well as demonstrate how filters are integrated into image analysis workflows, starting with spatial filtering and moving on to Fourier filtering.

In MOOC

Image Processing and Analysis for Life Scientists

Instructors (4)

Arne Seitz

04/1996-06/2000 Scientific co-worker at Philipps-University of Marburg, Dep. of Physical Chemistry 07/2000-10/2002 Post Doc at Max-Planck Unit for Structural Molecular Biology in Hamburg 11/2002-11/2005 Post Doc at European Molecular Biolohy Laboratory (EMBL), Cell Biology and Cell Biophysics Programme 11/2005-03/2009 Staff Scientist at Advanced Light Microscopy Facility, EMBL 04/2009- Head of Bioimaging and Optics platforme (BIOP), Ecole Polytechnique Fédérale de Lausanne (EPFL)

Romain Guiet

Olivier Burri

Nicolas René Chiaruttini

Official source

Related concepts (17)

Analogue filter

Analogue filters are a basic building block of signal processing much used in electronics. Amongst their many applications are the separation of an audio signal before application to bass, mid-range, and tweeter loudspeakers; the combining and later separation of multiple telephone conversations onto a single channel; the selection of a chosen radio station in a radio receiver and rejection of others.

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.

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-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.

Related lectures (51)

Fast Fourier Transform (FFT): Lecture 4

Covers the Fast Fourier Transform (FFT) algorithm, interpolation, filters, image processing, and experimental techniques in TEM and STM.

Fast Fourier Transform (FFT): Basics and Applications

Covers the Fast Fourier Transform (FFT) algorithm and its applications in computational physics, including image processing, experimental techniques, filters, and analysis of microscopy images.

Fourier Series and Analysis

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

Image Filtering: Summary MOOC: Image Processing and Analysis for Life Scientists

Covers the fundamental principles of image filtering in biomedical analysis.

Discrete Signals & Fourier Transform