Fast DCT-based spatial domain interpolation of blocks in images
Related Experiment Video
Updated: Jul 7, 2026

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy
Published on: June 15, 2022
Abstract:
An efficient method is presented to restore a block in an image, using a reduced set of border pixels. The basic assumption is that, if the set of pixels consisting of the missing block and its border pixels is transformed by the DCT, the high frequency coefficients obtained can be set to zero. A system of linear equations results, whose solution yields approximations for the values of the lost pixels. In this interpolation scheme, only eight border pixels are used in the computation of any missing pixel. Simulation results show that the approach generally outperforms alternative methods at a smaller computational cost.
More Related Videos
Related Concept Videos
Reconstruction of Signal using Interpolation
Discrete Fourier Transform
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
Downsampling
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
