DCT approximations based on Chen's factorization

doi:10.1016/j.image.2017.06.014

DCT approximations based on Chen's factorization

2017-10-01

6

OA

AI

C

Claudio Javier Tablada

T

Thiago L. T. da Silveira

DOI：10.1016/j.image.2017.06.014

原文链接

查看原文

摘要

En 中文

In this paper, two 8-point multiplication-free DCT approximations based on the Chen's factorization are proposed and their fast algorithms are also derived. Both transformations are assessed in terms of computational cost, error energy, and coding gain. Experiments with a JPEG-like image compression scheme are performed and results are compared with competing methods. The proposed low-complexity transforms are scaled according to Jridi-Alfalou-Meher algorithm to effect 16- and 32-point approximations. The new sets of transformations are embedded into an HEVC reference software to provide a fully HEVC-compliant video coding scheme. We show that approximate transforms can outperform traditional transforms and state-of-the-art methods at a very low complexity cost. (C) 2017 Elsevier B.V. All rights reserved.

Keyword:

Approximate DCT

Chen's factorization

Fast algorithms

Image and video compression

Low-complexity transforms

DCT approximations based on Chen's factorization

摘要

AI总结

期刊

机构