DCT-like Transform for Image Compression Requires 14 Additions Only
arXiv:1702.00817 · doi:10.1049/el.2012.1148
Abstract
A low-complexity 8-point orthogonal approximate DCT is introduced. The proposed transform requires no multiplications or bit-shift operations. The derived fast algorithm requires only 14 additions, less than any existing DCT approximation. Moreover, in several image compression scenarios, the proposed transform could outperform the well-known signed DCT, as well as state-of-the-art algorithms.
6 pages, 3 figures, 1 table
References in corpus (1)
Cited by in corpus (25)
- Improved 8-point Approximate DCT for Image and Video Compression Requiring Only 14 Additions
- Low-complexity 8-point DCT Approximations Based on Integer Functions
- Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform
- Low-complexity Approximate Convolutional Neural Networks
- A Class of DCT Approximations Based on the Feig-Winograd Algorithm
- 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
- Multiplierless 16-point DCT Approximation for Low-complexity Image and Video Coding
- Low-complexity Multidimensional DCT Approximations
- Energy-efficient 8-point DCT Approximations: Theory and Hardware Architectures
- A Class of Low-complexity DCT-like Transforms for Image and Video Coding
- 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
- 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
- Multiplierless DFT Approximation Based on the Prime Factor Algorithm
- Fast Data-independent KLT Approximations Based on Integer Functions