# A DCT Approximation for Image Compression

arXiv: https://arxiv.org/abs/1402.6034 · HTML: https://mlsanity.com/paper/1402.6034/

## Key facts

- Cited by 9 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Feb 2014.

## Built on by (most cited first, 9 of 9)

- [A Dual Stealthy Backdoor: From Both Spatial and Frequency Perspectives](https://mlsanity.com/paper/2307.10184/) (2023)
- [Low-complexity Rounded KLT Approximation for Image Compression](https://mlsanity.com/paper/2111.14239/) (2021)
- [Fast 2DGS: Efficient Image Representation with Deep Gaussian Prior](https://mlsanity.com/paper/2512.12774/) (2025)
- [DCT Approximations Based on Chen's Factorization](https://mlsanity.com/paper/2207.11638/) (2022)
- [Low-complexity Multidimensional DCT Approximations](https://mlsanity.com/paper/2306.11724/) (2023)
- [Low-Complexity Loeffler DCT Approximations for Image and Video Coding](https://mlsanity.com/paper/2207.14463/) (2022)
- [Fast Data-independent KLT Approximations Based on Integer Functions](https://mlsanity.com/paper/2410.09227/) (2024)
- [Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity](https://mlsanity.com/paper/2410.15244/) (2024)
- [Locality-Aware Density Control for Efficient Gaussian-based Image Representation](https://mlsanity.com/paper/2607.17896/) (2026)

## Abstract (arXiv)

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.