Given by Czeslaw Jedrzejek, Tomasz Major at Rome Lab Quarterly Review for CIV on June 28 96. Foils prepared 23 February 97
Outside Index
Summary of Material
This covers both basic Theory and NPAC projects with examples |
Wavelet compression activity: goals |
Compression of still images: |
improving quality for fixed bitrate |
decreasing encoding time (currently encoding still image takes 2 seconds on SGI Challenge; similar problem exists for DCT like H.263 based systems - currently no real-time encoding exists in software) |
parallelizing: decomposition, quantization and arithmetic coding (important in view of emergence of multiprocessor PentiumPro systems) |
Compression of video: |
we verified that motion estimation in wavelet space does not work |
plan: hybrid video method |
Web and other functionalities: |
progressive still image plug-in (implemented) |
in progress - zoom, local window, chroma key |
plans: transparency, pre- and post-processing, access key file protection, error recovery |
Outside Index Summary of Material
Wavelet compression activity: goals
|
Available advanced commercial wavelet software for still images (only executables)
|
Existing academic and research software
|
Existing but unavailable software (some also for wavelet video)
|
Our software
|
Transformation of the image:
|
Quantization of transform coefficients:
|
Regular lossless coding:
|
Investigation of various video compression technologies: H.263, H263+, L and MPEG-4 |
Wavelet compression of binary terrain data for VRML applications
|
Available implementation
|
Our focus: decoding, wavelet player
|
LHn indicates subband subjected to low-pass (L) |
or high-pass (H) filtering at the nth scale |
Useful for hybrid schemes |
Transform and inverse transform have to be normalized in both directions such that if the transform coefficients are scaled by 1/s the inverse transform has to be scaled by s. This leaves the freedom for selection of s through all scales . Quality (PSNR- the highest the better) can be affected, since relative band magnitudes are then differently quantized. The same effect for DCT has not been exploited. |
For Lenna: |
We search for automatic selection criterion (and even for band specific s). |
Hor Ver PSNR Hor Ver PSNR Hor Ver PSNR Hor Ver PSNR Hor Ver PSNR |
0.50 0.67 27.7 0.50 0.80 27.9 0.50 1.00 28.1 0.50 1.25 27.2 0.50 1.5 27.0 |
0.57 0.67 - 0.57 0.80 30.1 0.57 1.00 29.7 0.57 1.25 29.1 0.57 1.5 28.7 |
0.60 0.67 - 0.67 0.80 30.3 0.67 1.00 30.5 0.67 1.25 30.2 0.67 1.5 30.4 |
0.80 0.67 30.4 0.80 0.80 30.4 0.80 1.00 31.2 0.80 1.25 30.6 0.80 1.5 30.7 |
1.00 0.67 30.6 1.00 0.80 30.2 1.00 1.00 30.5 1.00 1.25 30.7 1.00 1.5 30.3 |
1.25 0.67 29.9 1.25 0.80 29.9 1.25 1.00 29.7 1.25 1.25 30.1 1.25 1.5 29.7 |
1.50 0.67 29.7 1.50 0.80 29.1 1.50 1.00 29.2 1.50 1.25 29.7 1.50 1.5 28.8 |
1.75 0.67 28.6 1.75 0.80 28.6 1.75 1.00 28.8 1.75 1.25 28.4 1.75 1.5 28.6 |
2.00 0.67 28.3 2.00 0.80 28.7 2.00 1.00 28.1 2.00 1.25 28.4 2.00 1.5 28.3 |
Zerotree pass |
Band 1 2 3 4 5 6 7 8 9 |
LL5 194 105 60 24 6 2 0 0 0 |
HL5 62 135 131 122 86 51 27 6 0 |
LH5 62 151 189 192 169 105 56 21 7 |
HH5 62 151 191 204 174 137 96 54 27 |
HL4 0 64 260 423 555 50 432 340 215 |
LH4 0 0 28 159 301 9 569 519 394 |
HH4 0 0 20 112 295 500 477 490 426 |
HL3 0 0 0 68 404 422 167 1976 1963 |
LH3 0 0 0 4 92 117 859 1413 1777 |
HH3 0 0 0 0 36 383 632 1121 1526 |
HL2 0 0 0 0 0 184 1047 2609 4605 |
LH2 0 0 0 0 0 140 260 1076 2384 |
HH2 0 0 0 0 0 4 80 604 1727 |
HL1 0 0 0 0 0 0 0 0 0 |
LH1 0 0 0 0 0 0 0 0 0 |
HH1 0 0 0 0 0 0 0 0 0 |
Need for more efficient coding of upper right zeros. Statistics of zerotrees in differential image may differ. |
An image is divided into fixed size blocks. |
The basic assumption is that all the pixels in a block have the same displacement. |
For each block in frame t, a search is done to try to find its equivalent in frame t-1 and to find the displacement vector of this block. |
The scheme works for any key frame compression method. |
The frames are decomposed in a pyramidal representation. |
The basis assumption is the existence of a high correlation of the movement of the objects in the different levels of this decomposition. |
General principle: doing a normal estimation in the first band, and then refining with the found vectors in the higher subbands. |
An Example: MRME - Zhang and Zafar [92]:
|
Representation of a wavelet-decomposed frame |
DWT: Discrete Wavelet Transform |
EZW: Embedded Zerotree Wavelet |
TRANS: Channel |
ARITH: Arithmetic Coder |
The binary square in |
image sequence: |
Frame #1: This square |
Frame #2: The square |
shifted 1 pel in x and y |
directions |
Edge motion causes the change of sign of wavelet coefficients in higher subbands. The process cannot be approximated by motion in wavelet space. |
The MRME algorithm doesn't work. This is one of the reasons the wavelet transform lost in the first rounds of the MPEG-4 video compression standard although it is better than DCT for still image compression (the other two reasons: relatively immature technology and difficulty of encoding objects) |
New solution (hybrid scheme):
|