A DCT Approximation for Image Compression
This work addresses image compression efficiency for applications requiring low computational cost, but it is incremental as it builds on existing DCT methods.
The paper tackles the problem of image compression by introducing an orthogonal approximation for the 8-point DCT that uses only zeros and ones, eliminating multiplications and bit-shifts, and it shows superiority over the signed DCT and potential outperformance of state-of-the-art algorithms in low and high compression scenarios with comparable computational complexity.
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.