A fast 8×8 transform for image compression
In this paper, we propose an efficient 8×8 transform matrix for image compression by appropriately introducing some zeros in the 8×8 signed DCT matrix. We show that the proposed transform is orthogonal, which is a highly desirable property. In order to make this novel transform more attractive for recent real-time applications, we develop an efficient algorithm for its fast computation. By using this algorithm, the proposed transform requires only 18 additions to transform an 8-point sequence. Compared to the existing 8×8 approximated DCT matrices, it is shown that savings of 25% in the number of arithmetic operations can easily be achieved using the proposed transform operator without noticeable degradations in the reconstructed images. We also present simulation results using some standard test images to show the efficiency of the proposed transform in image compression.