A Class of Low-Complexity DCT-Like Transforms for Image and Video Coding

The discrete cosine transform (DCT) is a relevant tool in signal processing applications, mainly known for its good decorrelation properties. Current image and video coding standards-such as JPEG and HEVC-adopt the DCT as a fundamental building block for compression. Recent works have introduced low...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems for video technology Vol. 32; no. 7; pp. 4364 - 4375
Main Authors: da Silveira, Thiago L. T., Canterle, Diego Ramos, Coelho, Diego F. G., Coutinho, Vitor A., Bayer, Fabio M., Cintra, Renato J.
Format: Journal Article
Language:English
Published: New York IEEE 01.07.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Approximation
Arithmetic
Coding standards
Complexity
Complexity theory
DCT approximation
Discrete cosine transform
Discrete cosine transforms
Encoding
Hardware
image and video coding
Image coding
Image compression
low-complexity transforms
Multiple criterion
Optimization
Power consumption
Signal processing
Transforms
Video coding
Video compression
ISSN:1051-8215, 1558-2205
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The discrete cosine transform (DCT) is a relevant tool in signal processing applications, mainly known for its good decorrelation properties. Current image and video coding standards-such as JPEG and HEVC-adopt the DCT as a fundamental building block for compression. Recent works have introduced low-complexity approximations for the DCT, which become paramount in applications demanding real-time computation and low-power consumption. The design of DCT approximations involves a trade-off between computational complexity and performance. This paper introduces a new multiparametric transform class encompassing the round-off DCT (RDCT) and the modified RDCT (MRDCT), two relevant multiplierless 8-point approximate DCTs. The associated fast algorithm is provided. Four novel orthogonal low-complexity 8-point DCT approximations are obtained by solving a multicriteria optimization problem. The optimal 8-point transforms are scaled to lengths 16 and 32 while keeping the arithmetic complexity low. The proposed methods are assessed by proximity and coding measures with respect to the exact DCT. Image and video coding experiments and hardware realization are performed. The novel transforms perform close to or outperform the current state-of-the-art DCT approximations.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1051-8215
1558-2205
DOI:10.1109/TCSVT.2021.3134054