Related Experiment Video
Updated: Mar 6, 2026

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases
Published on: July 28, 2013
Low-Complexity Multidimensional DCT Approximations for High-Order Tensor Data Decorrelation
Abstract:
In this paper, we introduce low-complexity multidimensional discrete cosine transform (DCT) approximations. 3D DCT approximations are formalized in terms of high-order tensor theory. The formulation is extended to higher dimensions with arbitrary lengths. Several multiplierless 8×8 ×8 approximate methods are proposed and the computational complexity is discussed for the general multidimensional case. The proposed methods complexity cost was assessed, presenting considerably lower arithmetic operations when compared with the exact 3D DCT. The proposed approximations were embedded into 3D DCT-based video coding scheme and a modified quantization step was introduced. The simulation results showed that the approximate 3D DCT coding methods offer almost identical output visual quality when compared with exact 3D DCT scheme. The proposed 3D approximations were also employed as a tool for visual tracking. The approximate 3D DCT-based proposed system performs similarly to the original exact 3D DCT-based method. In general, the suggested methods showed competitive performance at a considerably lower computational cost.
Related Concept Videos
Discrete-time Fourier transform
One of the notable...
Direction Cosines of a Vector
Properties of DTFT I
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
Discrete Fourier Transform
Discrete-Time Fourier Series
For a discrete-time periodic signal x[n]...
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,...

