Digital Image Correlation & Digital Volume Correlation Library

[WACV 2023] Keys to Better Image Inpainting: Structure and Texture Go Hand in Hand

An unsupervised deep learning-based approach for 4D-CT lung Deformable Image Registration

FFT is an efficient algorithm for computing the discrete Fourier transform (DFT) of a sequence, enabling the frequency analysis of signals in linear time. It plays a crucial role in various applications, including image processing, audio compression, and cryptography.

FFT (Fast Fourier Transform) is a mathematical algorithm used to transform a time-domain signal into its frequency-domain representation, which is useful for analyzing and processing signals in various fields such as audio and image processing.

This is the official repository of LabDeck's FFT(Fast Fourier Transform) examples. It includes both PDF and MDD files. Please note that while GitHub is unable to open and showcase MDD files, you can download and run them without any problems.