DCT-like Transform for Image Compression Requires 14 Additions Only

A low-complexity 8-point orthogonal approximate discrete cosine transform (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.

[1]  Tarek I. Haweel,et al.  A new square wave transform based on the DCT , 2001, Signal Process..

[2]  Vladimir Britanak,et al.  CHAPTER 1 – Discrete Cosine and Sine Transforms , 2006 .

[3]  Vladimir Britanak,et al.  CHAPTER 5 – Integer Discrete Cosine/Sine Transforms , 2006 .

[4]  M.N.S. Swamy,et al.  A fast 8×8 transform for image compression , 2009 .

[5]  A NikaraJari,et al.  Discrete cosine and sine transforms , 2006 .

[6]  Jean-Marie Moureaux,et al.  Fast zonal DCT for energy conservation in wireless image sensor networks , 2012 .

[7]  M.N.S. Swamy,et al.  Low-complexity 8×8 transform for image compression , 2008 .

[8]  Fábio M. Bayer,et al.  A DCT Approximation for Image Compression , 2011, IEEE Signal Processing Letters.

[9]  Antonio Ortega,et al.  Scalable variable complexity approximate forward DCT , 2004, IEEE Transactions on Circuits and Systems for Video Technology.

[10]  M. Omair Ahmad,et al.  A low-complexity parametric transform for image compression , 2011, 2011 IEEE International Symposium of Circuits and Systems (ISCAS).

[11]  Saad Bouguezel,et al.  An efficient fast integer DCT transform for images compression with 16 additions only , 2011, International Workshop on Systems, Signal Processing and their Applications, WOSSPA.