Data-independent Low-complexity KLT Approximations for Image and Video Coding
arXiv:2111.14237 · doi:10.1016/j.image.2021.116585
Abstract
The Karhunen-Loève transform (KLT) is often used for data decorrelation and dimensionality reduction. The KLT is able to optimally retain the signal energy in only few transform components, being mathematically suitable for image and video compression. However, in practice, because of its high computational cost and dependence on the input signal, its application in real-time scenarios is precluded. This work proposes low-computational cost approximations for the KLT. We focus on the blocklengths because they are widely employed in image and video coding standards such as JPEG and high efficiency video coding (HEVC). Extensive computational experiments demonstrate the suitability of the proposed low-complexity transforms for image and video compression.
18 pages, 15 figures, 4 tables
References in corpus (5)
- DCT-like Transform for Image Compression Requires 14 Additions Only
- An Integer Approximation Method for Discrete Sinusoidal Transforms
- A Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel 16-point Approximate DCT for Image Compression Applications
- A Multiparametric Class of Low-complexity Transforms for Image and Video Coding
- DCT Approximations Based on Chen's Factorization