2008 International Conference on Signals, Circuits and Systems

A Multiplication-free Transform for Image Compression

Saad Bouguezel
Department of Electronics, Faculty of Engineering University of Setif Setif, Algeria bouguezel_saad@yahoo.com
Abstract In this paper, we propose an efficient 88 multiplication-free transform operator for image compression by appropriately introducing some zeros in the 88 signed DCT matrix. We also develop fast algorithms for the computation of the proposed transform as well as for its inverse. Compared to the existing 88 approximated DCT matrices, it is shown that savings of 12.5% in the number of additions can easily be achieved using the proposed transform operator without noticeable degradations in the reconstructed images. We also present simulations on some standard test images to show the efficiency of the proposed transform in image compression. Keywordsmultiplication-free transform, 88 DCT, signed DCT, image compression.

M. Omair Ahmad and M.N.S. Swamy

Department of Electrical and Computer Engineering Concordia University Montreal, Canada omair@ece.concordia.ca, swamy@ece.concordia.ca corresponding Hadamard matrix operator in image compression. In DCT-based image compression techniques including the above mentioned ones, images are usually divided into 88 blocks. Therefore, a new matrix operator of order 88 having lower computational complexity and acceptable energy compaction capability is desired. II. PROPOSED 88 TRANSFORM OPERATOR

The 88 SDCT matrix introduced in [5] is given by

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

I.

INTRODUCTION

The Karhunen-Loeve Transform (KLT) is statistically optimal in the sense of energy compaction, whereas the discrete cosine transform (DCT) is suboptimal. However, the KLT is data dependent and, therefore, its computational complexity is significantly higher than that of the DCT. Due to this fact, the DCT is considered as the best alternative to the KLT and it has been used in many image and video compression systems [1]-[4]. However, recent applications such as multimedia, mobile communications and internet require very fast compression techniques, which cannot be fully achieved by the existing fast algorithms of the floating point DCT. For this reason, there has been in recent years a huge interest in finding approximation and integer versions of the floating point DCT [5]-[10]. Specifically, the approach introduced in [5] is interesting and simple. It consists of approximating the DCT by applying a signum function operator to the forward DCT matrix in order to obtain the so-called signed DCT (SDCT) matrix with entries are only 1, 0 or -1, and yet, maintaining a good decorrelation and power compaction properties of the DCT. It is worth mentioning that the inverse 88 SDCT matrix operator is also a multiplication-free matrix. It has been shown in [5] that the 88 SDCT matrix operator outperforms the

(1)

It is clear from (1) that the 88 SDCT matrix requires only additions. The proposed matrix operator is obtained by appropriately setting some of the entries of the 88 SDCT matrix given by (1) to zero. Then, it is given by
1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 0 1 0 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

(2)

It is easy to verify that its inverse is also a multiplication-free matrix and is given by

978-1-4244-2628-7/08/$25.00 2008 IEEE

-1-

2008 International Conference on Signals, Circuits and Systems

1 1 1 2 1 1 1 1 0 8 1 0 1 1 1 2 1 1

1 2 1 1 1 0 0 1 2 1 0 1 1 0 1 2 1 1 1 4 1 4 1 0 1 4 1 4 1 0 0 1 2 1 1 1 1 0 1 2 1 0 1 2 1 1 1 0

(3)

1 0 0 0 1 0 0 0

0 1 0 0

1 0 0 0

0 0 0 1

0 0 1 0 0 0

0 1 0 0 0

0 0 1 0 0

0 1 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0

0 1 0 0

1 0 0 1 0 0

0 0 0 0 0 0 0 1

(7)

It is seen from (1) and (2) that 56 and 48 additions are required to transform a sequence of length 8 by a direct use of the SDCT and the proposed transform matrices, respectively. The inverse transformation requires 40 additions and 16 shifts using the inverse SDCT matrix given in [5], and 44 additions and 16 shifts using the proposed inverse matrix given by (3). The fast computation algorithms for the 88 SDCT and its inverse are not given in [5]. The author in [5] mentioned that the forward SDCT can be computed using any fast DCT algorithm. So, the fast computation of the forward 88 SDCT matrix requires 24 additions. However, no algorithm has been suggested in [5] for a fast computation of the inverse 88 SDCT matrix. In order to reduce the number of additions in the computation of the proposed forward matrix, we decompose the matrix given by (2) as (4) where
1 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 1 0 1 0 1 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0

0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 1

(8)

It is now clear from (4)-(8) that the fast computation of the proposed forward matrix requires only 21 additions. A decomposition of the inverse matrix given by (3) can be obtained as (9) where
1 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 1 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 1 0 0 1 0 0 0 0 1 0 1 0 0 0 0

(10)

(5)

0 0 1 1 0 0 0 0 0 0

(6)

0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 4 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 1 1 0

(11)

1 0 0 1

0 0 0 1 1 0 0 0 0 0 0 1 0 0 1 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 0

(12)

-2-

2008 International Conference on Signals, Circuits and Systems

1 0 0 0 0 0 0 1

0 1 0 0 0 0 0 0

0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0

IV.

CONCLUSION

(13)

(14)

It is seen from (9)-(14) that the fast computation of the inverse of the proposed transform requires only 21 additions and 3 shifts. It should be noted that the diagonal matrix D requires only one shift and can be performed in the dequantization step, as assumed in many papers [8], [9]. Table I shows the number of operations required by the forward in [8], scaled DCT matrix [9], approximated DCT matrix proposed transform matrix and SDCT matrix in [5]. It is clear from this table that savings of 12.5% in the number of additions can be obtained using the proposed transform matrix compared to the transforms in [5] and [8]. The same savings are achieved by the proposed transform over the transform in [8] in the case of the inverse transformation. III. APPLICATION TO IMAGE COMPRESSION

It has been shown in this paper that the PSNR of the reconstructed images can be significantly increased by appropriately setting some entries of the signed DCT matrix to zero. The resulting new forward and inverse transform matrices are still multiplication-free operators. It has also been shown by developing fast algorithms for the computation of the proposed forward and inverse transform matrices that savings of 12.5% in the number of additions can be achieved compared to the approximated and signed DCT transforms. These savings have been achieved without noticeable degradations in the reconstructed images compared to the approximated DCT. The simulations that have been carried out in this work show clearly the efficiency of the proposed transform in image compression. REFERENCES
[1]

[2]

[3]

[4]

In order to show the efficiency of the proposed 88 transform matrix in image compression, we consider the experiment used in [5]. That is, we carry out a simulation of the JPEG technique by employing the DCT [9], the approximated DCT reported in [8], the proposed transform and the SDCT reported in [5]. The block size used to scan the image is 88. Only 10 out of the 64-transform coefficients in each block have been employed to reconstruct the image. All other coefficients have been set to zero. The original and reconstructed images using different transforms are illustrated in Fig. 1 for 256256 Cameraman image. Due to a lack of space, we have not included the reconstructed images for 512512 Lena, 512512 Mandrill and 512512 Bridge. The corresponding percentage error energy norms (PEEN) are given in Table 2. The definition of PEEN is given in [5]. Fig. 2 shows the PSNR obtained using different transforms in function of the number of transform coefficients employed to reconstruct the image. It is clear from this figure that the PSNR obtained by the proposed transform is significantly higher than that obtained by the SDCT of [5] and slightly less than that of [8]. The advantage of the proposed transform is that it achieves savings of 12.5% in the number of arithmetic operations compared to the transforms in [5] and [8]. This would make the proposed transform a good candidate for image compression.

[5]

[6]

[7]

[8]

[9]

[10]

K. R. Rao and J. J. Hwang, Techniques and Standards for Image, Video and Audio Coding. Englewood Cliffs, NJ: Prentice-Hall, 1996. T. Chang, C. Kung, and C. Jen, A simple processor core design for DCT/IDCT, IEEE Trans. Circuits Syst. for Video Technology, vol. 10, pp. 439447, April 2000. M. Lin, L. Dung, and P.Weng, An ultra low power image compressor for capsule endoscope, BioMed.Eng. Online, vol. 5, no. 14, Feb. 2006, 10.1186/1475-925X-514. A. Puri, X. Chen, and A. Luthra, Video coding using the H.264/MPEG-4 AVC compression standard, Signal Processing: Image Commun., vol. 19, pp. 793849, Oct. 2004. Tarek I. Haweel, A new square wave transform based on the DCT, Signal Processing, vol. 81, pp. 2309-2319, 2001. V. Dimitrov, K. Wahid and G. Jullien, Multiplicationfree 88 2D DCT architecture using algebraic integer encoding, Electronics Letters, vol. 40, pp. 1310-1311, Sep. 2004. Zhihua He and Maja Bystrom, A fast algorithm for conversion from DCT blocks to integer cosine transform blocks, in Proc. IEEE Int. Conf. Image Processing ICIP06, Oct. 2006, pp. 3081-3084. Krisda Lengwehasatit, and Antonio Ortega, Scalable Variable Complexity Approximate Forward DCT, IEEE Trans. Circuits Syst. for Video Technology, vol. 14, pp. 1236-1248, Nov. 2004. Khan A. Wahid, Vassil S. Dimitrov, and Graham A. Jullien, On the Error-Free Realization of a Scaled DCT Algorithm and Its VLSI Implementation, IEEE Trans. Circuits Syst. II, vol. 54, pp. 700-704, August 2007. Cixun Zhang, Lu Yu, Jian Lou, Wai-Kuen Cham, and Jie Dong, The Technique of Prescaled Integer Transform: Concept, Design and Applications, IEEE Trans. Circuits Syst. for Video Technology, vol. 18, pp. 84-97, Jan. 2008.

-3-

2008 International Conference on Signals, Circuits and Systems

46 45 44 43 42 41 40 39

Table 1: Number of operations required by different 88 transform matrices

Additions Shifts Multiplications Scaled DCT, [9] 29 0 5 , [8] 24 2 0 Proposed transform 21 3 0 SDCT, [5] 24 0 0
PSNR

(I) (III)

(II)

(IV)

Table 2: Percentage error energy norm (PEEN) using different 88 transform matrices
Test image Cameraman Lena Mandrill Bridge DCT, [9] 10.1913 4.7670 13.4897 10.5567 , [8] 10.7638 5.4353 11.0597 13.7244 Proposed transform 11.3885 5.8357 11.7886 14.2184 SDCT, [5] 13.6166 7.7177 13.8399 16.2584

38 37

5 10 Number of transform coefficients

15

(a)
48

46

44

(I) (III)

(II)

42 PSNR

40

(IV)

38

36

34 0

5 10 Number of transform coefficients

15

(b)
36.5

(a)

(b)

36 35.5 35 34.5 PSNR 34 33.5 33 32.5 32 31.5

(II) (I) (III) (IV)

5 10 Number of transform coefficients

15

(c) (c) (d)

40 39 38 37 PSNR 36 35 34 33 32

(I) (III)

(II)

(IV)

5 10 Number of transform coefficients

15

(e) Fig. 1. Compression of 256256 Cameraman image, (a) original image, (b), (c), (d) and (e) reconstructed images using DCT [9], approximated DCT [8], proposed transform and SDCT [5], respectively.

(d) Fig. 2. PSNR of the reconstructed images, (a) Cameraman, (b) Lena, (c) Mandrill and (d) Bridge. The curves I, II, III and IV are obtained using DCT [9], approximated DCT [8], proposed transform and SDCT [5], respectively.

-4-