Low-complexity approximation of 8-point discrete cosine transform for image compression

• Autorzy: Puchała D. , Stokfiszewski K.
• Języki publikacji: EN

Abstrakty

EN

In this paper the authors propose a new low-complexity approximation of 8-point discrete cosine transform (DCT) that requires 18 additions and two bit-shift operations. It is shown that the proposed transform outperforms significantly the known transform of the same computational complexity when applied to a JPEG compression stream in practical cases of encoding and decoding of still images. As such, the proposed transform can be effectively used in any practical applications where significant limitations exist regarding the computational capabilities coding and / or decoding devices, i.e. mobile devices or industrial imaging devices.

Słowa kluczowe

EN

discrete cosine transform; fast algorithms; image compression; JPEG standard

PL

dyskretna transformata cosinusowa; szybki algorytm; kompresja obrazu; JPEG

• Wydawca: Wydawnictwo Politechniki Łódzkiej
• Czasopismo: Journal of Applied Computer Science
• Rocznik: 2012
• Tom: Vol. 20, nr 2
• Strony: 107--117
• Opis fizyczny: Bibliogr. 10 poz.

Twórcy

autor

Puchała D.

autor

Stokfiszewski K.

• Lodz University of Technology, Institute of Information Technology, Wólczańska 215, 90-924 Łódź,

Bibliografia

• [1] Rao, D. R. and Yip, P., Discrete Cosine Transform, San Diego, CA: Academic, 1990.
• [2] Bouguezel, S., Ahmad, M. O., and Swamy, M. N. S., Low-complexity 8x8 transform for image compression, Electronics Letters, Vol. 44, No. 21, 2008.
• [3] Haweel, T. I., A new square wave transform based on the DCT, Signal Processing, Vol. 81, No. 11, 2001, pp. 2309–2319.
• [4] de Queiroz, R. L., DCT approximation for low bit rate coding using a conditional transform, In: IEEE International Conference on Image Processing, Vol. 1, 2002, pp. 237–240.
• [5] Lengwehasatit, K. and Ortega, A., Scalable variable complexity approximate forward DCT, IEEE Trans. Circuits Syst. Video Technol., Vol. 14, No. 11, 2004, pp. 1236–1248.
• [6] Arai, Y., Agui, T., and Nakajima, M., A Fast DCT-SQ Scheme for Images, IEICE Transactions, Vol. 71, No. 11, 1988, pp. 1095–1097.
• [7] Duhamel, P. and H’Mida, H., New 2 n DCT Algorithms suitable for VLSI Implementation, In: IEEE International Conference on Acoustics, Speech and Signal Processing, April, 1987, pp. 1805–1808.
• [8] Heidemann, M. T. and Burrus, C. S., Multiply / Add Tradeo s in Length 2 n FFT Algorithms, In: IEEE International Conference on Acoustics, Speech, and Signal Processing, March, 1985, pp. 780–783.
• [9] Loeffer, C., Ligtenberg, A., and Moyschytz, G. S., Practical Fast 1-D DCT Algorithms with 11 Multiplications, In: IEEE International Conference on Acoustics, Speech, and Signal Processing, May, Vol. 2, 1989, pp. 988–991.
• [10] Digital compression and coding of continuous-tone still images, Tech. Rep. T.81, International Telecommunication Union, 1992.