Performance Analysis of DCT, Hadamard, and PCA in Block-Based Image Compression
Not on the map. Why?
Abstract (arXiv)
Block based image compression relies on transform coding to concentrate signal energy into a small number of coefficients. While classical codecs use fixed transforms such as the Discrete Cosine Transform (DCT), data driven methods such as Principal Component Analysis (PCA) are theoretically optimal for decorrelation. This paper presents an experimental comparison of DCT, Hadamard, and PCA across multiple block sizes and compression rates. Using rate distortion and energy compaction analysis, we show that PCA outperforms fixed transforms only when block dimensionality is sufficiently large, while DCT remains near optimal for standard block sizes such as 8×8 and at low bit rates. These results explain the robustness of DCT in practical codecs and highlight the limitations of block wise learned transforms.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 8 references that are in the map. First posted on arXiv 9 Jan 2026.
Builds on
0 of 8 references.
No references here yet.
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2021A Machine Learning Approach to Optimal Inverse Discrete Cosine Transform (IDCT) Design ↗
- 2022Lightweight Image Codec via Multi-Grid Multi-Block-Size Vector Quantization (MGBVQ)
- 2021Principal Bit Analysis: Autoencoding with Schur-Concave Loss
- 2022Multi-rate adaptive transform coding for video compression
- 2024Traditional Transformation Theory Guided Model for Learned Image Compression
- 2023Low-complexity Multidimensional DCT Approximations
- 2024Approximate DCT and Quantization Techniques for Energy-Constrained Image Sensors ↗
- 2025Interleaved Block-based Learned Image Compression with Feature Enhancement and Quantization Error Compensation