Invertible integer DCT applied on progressive until lossless image compression

This paper completes the construction of FFT (fast Fourier transform) that map integers to integers by using lifting scheme and butterfly-style construction. Through building integer FFT which keeps conjugate symmetry for real signal, and expressing DCT by FFT, invertible integer DCT can be easily gotten, which makes lossless image compression possible. At last, we combine integer DCT with EZW zerotree and STQM arithmetic coding together. Experimental results show this method is quite efficient for progressive until lossless image compression.

[1]  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).

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

[3]  Yan Yu.  UNIVERSAL HIGH PERFORMANCE ARITHMETIC ENCODER , 1999 .

[4]  Douglas L. Jones,et al.  Real-valued fast Fourier transform algorithms , 1987, IEEE Trans. Acoust. Speech Signal Process..

[5]  Jonathan Hong,et al.  Discrete Fourier, Hartley, and cosine transforms in signal processing , 1994, Signal Process..

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