Lecture

Image Processing I: Sampling Theory and Aliasing Problems

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 covers the fundamentals of image processing, focusing on sampling theory, acquisition systems, and quantization. Topics include 1D and 2D sampling, aliasing problems, ideal sampling, Fourier domain analysis, and reconstruction processes. The instructor explains the importance of perfect recovery in multidimensional sampling.

Instructors (2)

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

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,

Official source

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis

Related concepts (32)

Frequency domain

In mathematics, physics, electronics, control systems engineering, and statistics, the frequency domain refers to the analysis of mathematical functions or signals with respect to frequency, rather than time. Put simply, a time-domain graph shows how a signal changes over time, whereas a frequency-domain graph shows how the signal is distributed within different frequency bands over a range of frequencies. A frequency-domain representation consists of both the magnitude and the phase of a set of sinusoids (or other basis waveforms) at the frequency components of the signal.

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 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 (64)

Frequency Estimation (Theory)

Covers the theory of numerical methods for frequency estimation on deterministic signals, including Fourier series and transform, Discrete Fourier transform, and the Sampling theorem.

Signals, Instruments, and Systems

Explores signals, instruments, and systems, covering ADC, Fourier Transform, sampling, signal reconstruction, aliasing, and anti-alias filters.

Sampling: DT-time processing of CT signals

Covers the importance of sampling in signal processing, including the sampling theorem and signal reconstruction.

Sampling Theorem and Control Systems

Explores the Sampling Theorem, digital control, signal reconstruction, and anti-aliasing filters.

The Sampling Theorem