Low-complexity 8-point DCT Approximations Based on Integer Functions
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a collection of approximations for the 8-point discrete cosine transform (DCT) based on integer functions. Approximations could be systematically obtained and several existing approximations were identified as particular cases. Obtained approximations were compared with the DCT and assessed in the context of JPEG-like image compression.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Sep 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 2.
6 papers.
- 2021Low-complexity Rounded KLT Approximation for Image Compressioncited by 2
- 2022Low-complexity Approximate Convolutional Neural Networkscited by 1
- 2023Low-complexity Multidimensional DCT Approximationscited by 1
- 2022Low-Complexity Loeffler DCT Approximations for Image and Video Codingcited by 0
- 2024Fast Data-independent KLT Approximations Based on Integer Functionscited by 0
- 2024Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similaritycited by 0
- 2024Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity20 Oct 2024
- 2024Fast Data-independent KLT Approximations Based on Integer Functions11 Oct 2024
- 2023Low-complexity Multidimensional DCT Approximations20 Jun 2023
- 2022Low-complexity Approximate Convolutional Neural Networks29 Jul 2022
- 2022Low-Complexity Loeffler DCT Approximations for Image and Video Coding29 Jul 2022
- 2021Low-complexity Rounded KLT Approximation for Image Compression28 Nov 2021