Low Complexity Scalable DCT Image Compression IEEE International Conference on Image Processing 2000 Philips Research Laboratories, Eindhoven, Netherlands Rene J. van der Vleuten, Richard P.Kleihorst, Christian Hentschel

Outline  Common Bit Plane Coding Technique  New Bit Plane Coding Technique  Algorithm Description by Example  Experimental Result  Complexity Analysis  Conclusion

Common Bit Plane Coding Technique

New Bit Plane Coding Technique Significant Coefficient: 1 in any higher bit planes (encoded) Insignificant Coefficient: 0 in all higher bit planes Newly Significant Coefficient: 1 in the current bit plane

Algorithm Description by Example The 64 coefficients of 8 * 8 image block after discrete cosine transform: 20, 3, 0, -5, 0, 0, 0, 0, -2, 0, 0, 0, ……, 0 (DC coefficients from all blocks are collected and put into the bit string before AC coefficients.)

Bit Plane 1 Coding position …63 sign significant coefficient table

Bit Plane 1 Coding position …63 sign significant coefficient table

Bit Plane 1 Coding position …63 sign significant coefficient table RMAX 

Bit Plane 1 Coding position …63 sign significant coefficient table CMAX 

Bit Plane 1 Coding position …63 sign significant coefficient table

Bit Plane 1 Coding position …63 sign significant coefficient table

Bit Plane 1 Coding position …63 sign1 significant coefficient table

Bit Plane 2 Coding position …63 sign1 significant coefficient table

Bit Plane 2 Coding position …63 sign1 significant coefficient table 0

Bit Plane 2 Coding position …63 sign1 significant coefficient table 0101

Bit Plane 2 Coding position …63 sign1 significant coefficient table

Bit Plane 2 Coding position …63 sign01 significant coefficient table

Bit Plane 2 Coding position …63 sign011 significant coefficient table

Bit Plane 2 Coding position …63 sign011 significant coefficient table

Bit Plane 3 Coding position …63 sign011 significant coefficient table

Bit Plane 3 Coding position …63 sign011 significant coefficient table 1

Bit Plane 3 Coding position …63 sign011 significant coefficient table 11

Bit Plane 3 Coding position …63 sign011 significant coefficient table 110

Bit Plane 3 Coding position …63 sign011 significant coefficient table 1100

Experimental Result

Complexity Analysis

Conclusion  Scalable Image Compression –Bit-rate or Quality Scalability –Real-time Adaptation to Wire or Wireless Channels  Adaptive Signal-dependent Rectangular Zone –DCT block often has a bias for either the horizontal or vertical direction. –It produces more efficient than signal-independent zig- zag scan.  Lower Complexity with Good Performance: –No Quantization –No Entropy Coding (Huffman or Arithmetic Coding)