Low-complexity Multidimensional DCT Approximations

Abstract

In this paper, we introduce low-complexity multidimensional discrete cosine transform (DCT) approximations. Three dimensional DCT (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\times 8\times 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.

arXiv comment28 pages, 5 figures, 5 tables

References in corpus (7)

• A DCT Approximation for Image Compression
• Improved 8-point Approximate DCT for Image and Video Compression Requiring Only 14 Additions
• DCT-like Transform for Image Compression Requires 14 Additions Only
• Low-complexity 8-point DCT Approximations Based on Integer Functions
• An Integer Approximation Method for Discrete Sinusoidal Transforms
• A Multiplierless Pruned DCT-like Transformation for Image and Video Compression that Requires 10 Additions Only
• Energy-efficient 8-point DCT Approximations: Theory and Hardware Architectures

Cited by in corpus (6)

• Efficient and Self-Recursive Delay Vandermonde Algorithm for Multi-Beam Antenna Arrays
• A Multiparametric Class of Low-complexity Transforms for Image and Video Coding
• Low-complexity Three-dimensional Discrete Hartley Transform Approximations for Medical Image Compression
• Fast Data-independent KLT Approximations Based on Integer Functions
• Correlation-based Initialization Algorithm for Tensor-based HSI Compression Methods
• Low-complexity Architecture for AR(1) Inference