Invertible integer DCT algorithms

Abstract Integer DCTs have important applications in lossless coding. In this paper, an integer DCT of radix-2 length n is understood to be a nonlinear, (left-)invertible mapping which acts on Z n and approximates the classical discrete cosine transform (DCT) of length n. In image compression, the DCT of type II (DCT-II) is of special interest. In this paper we present a new approach to invertible integer DCT-II and integer DCT-IV. Our method is based on a factorization of the cosine matrices of types II and IV into products of sparse, orthogonal matrices. Up to some permutations, each matrix factor is a block-diagonal matrix with blocks being orthogonal matrices of order 2. Hence one has to construct only integer transforms of length 2. We factorize an orthogonal matrix of order 2 into three lifting matrices and work with lifting steps and rounding-off. This allows the construction of new integer DCT algorithms. We give uniform bounds for the worst case difference between the results of exact DCT and the corresponding integer DCT. Finally, we present some numerical experiments for the integer DCT-II of length 8 and for the 2-dimensional integer DCT-II of size 8×8.

[1]  T. Tran,et al.  The binDCT: fast multiplierless approximation of the DCT , 2000, IEEE Signal Processing Letters.

[2]  G.S. Moschytz,et al.  Practical fast 1-D DCT algorithms with 11 multiplications , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[3]  Manfred Tasche,et al.  Integer DCT—II by Lifting Steps , 2003 .

[4]  Wai-Kuen Cham,et al.  Integer sinusoidal transforms for image processing , 1991 .

[5]  Li Zhi Cheng,et al.  Integer discrete cosine transform and its fast algorithm , 2001 .

[6]  Kaoru Sezaki,et al.  Reversible discrete cosine transform , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[7]  I. Daubechies,et al.  Wavelet Transforms That Map Integers to Integers , 1998 .

[8]  Yonghong Zeng,et al.  Integer DCTs and fast algorithms , 2001, IEEE Trans. Signal Process..

[9]  Truong Q. Nguyen,et al.  Multiplierless approximation of transforms using lifting scheme and coordinate descent with adder constraint , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[10]  Gregory K. Wallace,et al.  The JPEG still picture compression standard , 1991, CACM.

[11]  Michael W. Marcellin,et al.  An overview of JPEG-2000 , 2000, Proceedings DCC 2000. Data Compression Conference.

[12]  Wilfried Philips,et al.  The lossless DCT for combined lossy/lossless image coding , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[13]  Konstantinos Konstantinides,et al.  Image and Video Compression Standards: Algorithms and Architectures , 1997 .

[14]  Gilbert Strang,et al.  The Discrete Cosine Transform , 1999, SIAM Rev..

[15]  B. Chandrasekaran,et al.  Real-time disturbance control , 1991, CACM.

[16]  P. Yip,et al.  Discrete Cosine Transform: Algorithms, Advantages, Applications , 1990 .

[17]  Kaoru Sezaki,et al.  2D lossless discrete cosine transform , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[18]  Trac D. Tran,et al.  Fast multiplierless approximations of the DCT with the lifting scheme , 2001, IEEE Trans. Signal Process..

[19]  I. Daubechies,et al.  Factoring wavelet transforms into lifting steps , 1998 .