Lecture

Image Processing I

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

MICRO-511: Image processing I

Introduction to the basic techniques of image processing. Introduction to the development of image-processing software and to prototyping using Jupyter notebooks. Application to real-world examples in industrial vision and biomedical imaging. ...

Description

This lecture introduces the characterization of continuous images, multidimensional Fourier transform, and the modeling of optical systems. It covers the Hilbert-space formulation, LSI systems, and the space of finite-energy images.

Instructors (2)

Michaël Unser

Expertise Image Processing, Medical Imaging, Biological Imaging, Wavelets, Splines, Multiresolution Michael Unser is Full Professor with EPFL’s school of Engineering and the academic director of EPFL's Center for Imaging, Lausanne, Switzerland. His primary areas of investigation are signal processing, biomedical imaging and applied functional analysis. He is internationally recognized for his research contributions to sampling theory, wavelets, the use of splines for image processing, stochastic processes,

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

Official source

Related concepts (15)

Multidimensional transform

In mathematical analysis and applications, multidimensional transforms are used to analyze the frequency content of signals in a domain of two or more dimensions. One of the more popular multidimensional transforms is the Fourier transform, which converts a signal from a time/space domain representation to a frequency domain representation. The discrete-domain multidimensional Fourier transform (FT) can be computed as follows: where F stands for the multidimensional Fourier transform, m stands for multidimensional dimension.

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.

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.

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.

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.

Related lectures (64)

Image Processing I: Ordered Dithering and Fourier Transform

Explores ordered dithering and Fourier transform in image processing.

Fourier Transform: Analysis IV

Covers the Fourier transform in Analysis IV, discussing Fourier series and solutions for various problems.

The fast Fourier transform

Explores the history and efficiency of the fast Fourier transform algorithm, demonstrating its practical applications and computational advantages.

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.

Image Processing II: DFT, DCT, and Wavelet Transforms