A DCT Approximation for Image Compression

Abstract

An orthogonal approximation for the 8-point discrete cosine transform (DCT) is introduced. The proposed transformation matrix contains only zeros and ones; multiplications and bit-shift operations are absent. Close spectral behavior relative to the DCT was adopted as design criterion. The proposed algorithm is superior to the signed discrete cosine transform. It could also outperform state-of-the-art algorithms in low and high image compression scenarios, exhibiting at the same time a comparable computational complexity.

10 pages, 6 figures

References in corpus (2)

• An Integer Approximation Method for Discrete Sinusoidal Transforms
• The Arithmetic Cosine Transform: Exact and Approximate Algorithms

Cited by in corpus (31)

• 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
• Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform
• A Row-parallel 8$\times$8 2-D DCT Architecture Using Algebraic Integer Based Exact Computation
• A Class of DCT Approximations Based on the Feig-Winograd Algorithm
• A Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel 16-point Approximate DCT for Image Compression Applications
• A Discrete Tchebichef Transform Approximation for Image and Video Coding
• Low-complexity 8-point DCT Approximation Based on Angle Similarity for Image and Video Coding
• An Orthogonal 16-point Approximate DCT for Image and Video Compression
• Multiplierless Approximate 4-point DCT VLSI Architectures for Transform Block Coding
• A Multiplierless Pruned DCT-like Transformation for Image and Video Compression that Requires 10 Additions Only
• Low-complexity Multidimensional DCT Approximations
• Multiplierless 16-point DCT Approximation for Low-complexity Image and Video Coding
• A Class of Low-complexity DCT-like Transforms for Image and Video Coding
• Energy-efficient 8-point DCT Approximations: Theory and Hardware Architectures
• Low-complexity Pruned 8-point DCT Approximations for Image Encoding
• Low-Complexity Loeffler DCT Approximations for Image and Video Coding
• A Multiparametric Class of Low-complexity Transforms for Image and Video Coding
• Low-complexity Scaling Methods for DCT-II Approximations
• DCT Approximations Based on Chen's Factorization
• Low-complexity Rounded KLT Approximation for Image Compression
• Low-complexity Three-dimensional Discrete Hartley Transform Approximations for Medical Image Compression
• Image compression overview
• An autoencoder for compressing angle-resolved photoemission spectroscopy data
• Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity
• Data-independent Low-complexity KLT Approximations for Image and Video Coding
• Fast Data-independent KLT Approximations Based on Integer Functions
• Multiplierless DFT Approximation Based on the Prime Factor Algorithm
• Low-complexity Architecture for AR(1) Inference
• Fast algorithm for quantum polar decomposition, pretty-good measurements, and the Procrustes problem