Lecture

Image Processing II: DFT, DCT, and Wavelet Transforms

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-512: Image processing II

Study of advanced image processing; mathematical imaging. Development of image-processing software and prototyping in Jupyter Notebooks; application to real-world examples in industrial vision and biomedical imaging. ...

Description

This lecture covers the application of the Karhunen Loève transform (KLT) in face recognition using eigenfaces, the discrete Fourier transform (DFT) and circulant matrices, and the optimality of DFT for stationary processes. It also delves into classical 2D transforms like the discrete cosine transform (DCT) and other separable transforms. The lecture further explores the implementation of separable transforms, the basis functions of DCT, and other transforms like the sine transform and Hadamard transform. Additionally, it discusses wavelet transforms, multirate operations, perfect reconstruction filterbanks, and the history of wavelets. The presentation concludes with signal processing developments from the 'DCT era' to the emergence of perfect-reconstruction filterbanks in the early 1980s.

Instructors (4)

Michael Stefan Daniel Liebling

Teaching & PhD Past EPFL PhD Students as codirector Christian Jaques, Olivia Mariani, Adrian Shajkofci, François Thierry M Marelli Courses Fundamentals of machine learning EE-311 This course provides a general overview of machine learning, covering the main algorithms, theoretical formalisms, and experimental protocols.

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,

Daniel Sage

Expertise PublicationsPublications Coordinates Biomedical Imaging GroupAddressEPFL STI-IMT-LIB, BM 4.135, Station 17, CH-1015 Lausanne, SwitzerlandTel.+41 21 693 51 89Fax.+41 21 693 68 10Emaildaniel.sage@epfl.chWeb pagehttp://bigwww.epfl.ch/sage/OfficeBM 4.135 Teaching & PhD Past EPFL PhD Students as codirector Daniel Andreas Schmitter, Anaïs Badoual, Laurène Donati Courses Bioimage informatics BIO-410 The course provides a comprehensive overview of methods, algorithms, and computer tools us

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

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis

Related concepts (32)

Wavelet transform

In mathematics, a wavelet series is a representation of a square-integrable (real- or complex-valued) function by a certain orthonormal series generated by a wavelet. This article provides a formal, mathematical definition of an orthonormal wavelet and of the integral wavelet transform. A function is called an orthonormal wavelet if it can be used to define a Hilbert basis, that is a complete orthonormal system, for the Hilbert space of square integrable functions.

Discrete wavelet transform

In numerical analysis and functional analysis, a discrete wavelet transform (DWT) is any wavelet transform for which the wavelets are discretely sampled. As with other wavelet transforms, a key advantage it has over Fourier transforms is temporal resolution: it captures both frequency and location information (location in time). Haar wavelet The first DWT was invented by Hungarian mathematician Alfréd Haar. For an input represented by a list of numbers, the Haar wavelet transform may be considered to pair up input values, storing the difference and passing the sum.

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.

Wavelet

A wavelet is a wave-like oscillation with an amplitude that begins at zero, increases or decreases, and then returns to zero one or more times. Wavelets are termed a "brief oscillation". A taxonomy of wavelets has been established, based on the number and direction of its pulses. Wavelets are imbued with specific properties that make them useful for signal processing. For example, a wavelet could be created to have a frequency of Middle C and a short duration of roughly one tenth of a second.

Discrete Fourier transform over a ring

In mathematics, the discrete Fourier transform over a ring generalizes the discrete Fourier transform (DFT), of a function whose values are commonly complex numbers, over an arbitrary ring. Let R be any ring, let be an integer, and let be a principal nth root of unity, defined by: The discrete Fourier transform maps an n-tuple of elements of R to another n-tuple of elements of R according to the following formula: By convention, the tuple is said to be in the time domain and the index j is called time.

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.

Image Processing I

Introduces the basics of image processing, covering point and spatial operators, histogram processing, and transform-domain operations.

Signal Processing Fundamentals

Explores signal processing fundamentals, including discrete time signals, spectral factorization, and stochastic processes.

Introduction to the z-Transform

Covers the z-Transform, LTI systems, and signal processing applications.

Fourier Series and Transforms: Introduction and Properties