Embed Size (px)
Citation preview
Low Complexity Scalable DCT Image Compression
IEEE International Conference on Image Processing 2000
Philips Research Laboratories, Eindhoven, NetherlandsRene 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
1+1
10-1
0-1
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
0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign
significant coefficient table
Bit Plane 1 Coding
0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
1
position 1 2 3 4 5 6 7 8 … 63
sign
significant coefficient table
Bit Plane 1 Coding
0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
1000
position 1 2 3 4 5 6 7 8 … 63
sign
significant coefficient table
RMAX
Bit Plane 1 Coding
0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
1000011
position 1 2 3 4 5 6 7 8 … 63
sign
significant coefficient table
CMAX
Bit Plane 1 Coding
0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
10000110
position 1 2 3 4 5 6 7 8 … 63
sign
significant coefficient table
Bit Plane 1 Coding
0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
100001100
position 1 2 3 4 5 6 7 8 … 63
sign
significant coefficient table
Bit Plane 1 Coding
0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
10000110011
position 1 2 3 4 5 6 7 8 … 63
sign 1
significant coefficient table
Bit Plane 2 Coding
0 1 0 0 0 0 0 0
1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 1
significant coefficient table
Bit Plane 2 Coding
0 1 0 0 0 0 0 0
1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 1
significant coefficient table
0
Bit Plane 2 Coding
0 1 0 0 0 0 0 0
1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 1
significant coefficient table
01
Bit Plane 2 Coding
0 1 0 0 0 0 0 0
1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 1
significant coefficient table
01001001
Bit Plane 2 Coding
0 1 0 0 0 0 0 0
1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 0 1
significant coefficient table
0100100110
Bit Plane 2 Coding
0 1 0 0 0 0 0 0
1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 0 1 1
significant coefficient table
010010011011
Bit Plane 2 Coding
0 1 0 0 0 0 0 0
1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 0 1 1
significant coefficient table
0100100110110
Bit Plane 3 Coding
0 1 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 0 1 1
significant coefficient table
Bit Plane 3 Coding
0 1 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 0 1 1
significant coefficient table
1
Bit Plane 3 Coding
0 1 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 0 1 1
significant coefficient table
11
Bit Plane 3 Coding
0 1 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 0 1 1
significant coefficient table
110
Bit Plane 3 Coding
0 1 0 1 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
position 1 2 3 4 5 6 7 8 … 63
sign 0 1 1
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)
![International Journal of Pure and Applied Mathematics ... · Figure 2 . Image fusion processing using DCT [11] The meaning of the two -dimensional DCT for an info image A and yield](https://img.pdfslide.net/doc/110x75/5b5a52937f8b9a01748bb6a2/international-journal-of-pure-and-applied-mathematics-figure-2-image-fusion.jpg)
