DCT-like Transform for Image Compression Requires 14 Additions Only
This work addresses computational efficiency for image compression applications, but it is incremental as it builds on existing DCT approximations.
The authors tackled the problem of high computational cost in image compression by introducing an 8-point orthogonal approximate DCT that requires only 14 additions, with no multiplications or bit-shifts, and it outperforms signed DCT and state-of-the-art methods in several scenarios.
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.