Given by Roman Markowski and Geoffrey Fox at HPDC95 Pentagon City on August 1,1995. Foils prepared July 28,1995
Abstract * Foil Index for this file
See also color IMAGE
This set of foils describes image and video compression schemes concentrating on Wavelets which seem most powerful although JPEG and MPEG using related but less efficient Fourier technology will be used much more widely initially |
JPEG, JBIG, Fractal for images and MPEG, H.261 schemes for video clips are briefly reviewed |
Wavelets are described in detail |
This table of Contents Abstract
Roman Markowski |
NPAC |
Syracuse University |
111 College Place |
Syracuse |
NY 13244-4100 |
This set of foils describes image and video compression schemes concentrating on Wavelets which seem most powerful although JPEG and MPEG using related but less efficient Fourier technology will be used much more widely initially |
JPEG, JBIG, Fractal for images and MPEG, H.261 schemes for video clips are briefly reviewed |
Wavelets are described in detail |
image 2000x2000x24 bpp = 12MB |
one second of NTSC-quality video requires 23 MB |
compression - eliminating of redundant or less critical information
|
decreases the time and cost of transmission and the requirements for storage |
lossless - removes the redundancy in the signal; ratio 3:1; the heights of every pixel are perfectly reproduced |
lossy - selectively discards "less important" information; ratio 100:1 |
controversy: the critical feature of any lossy compression is what is important and what is not. |
evaluation of several image compression technologies
|
compression ratio is |
PSNR = Peak-signal-to-noise ratio (in dB) |
RMSE is Root Mean Standard Error |
current international standard for image compression |
lossy algorithm: the threshold of visible difference 20:1; ratio can be varied |
designed for compression of full-color (24 bit) or gray-scale digitized images of "natural" scenes (continuous tone) |
exploits the known limitations of the human eye (10,000 colors simultaneously) |
DCT (Discrete Cosine Transformation) -- converts the spatial image representation (8x8 blocks) into frequency map |
Huffman coding -- input is sliced into fixed units while the corresponding output comes in chunks of variable size |
source available (Independent JPEG Group) |
Losslessly compresses binary images (one bit/pixel) |
Effective for bi-level images (black and white) |
Extended to gray scales with upto 8 bits per pixel with good results upto 6 bits per pixel |
Based on IBM's Q-coder - patented technology (no source) |
lossy algorithm |
patented technology by Barnsley ("Fractals Everywhere", 1988) |
in the forward direction fractal mathematics is good for generating natural looking images (trees, clouds, mountains) |
in reverse direction can be used to compress images |
compression extremely slow (many hours) |
decompression fast |
theoretically very high ratio - 1000:1 |
based on Iterated Function Theory (J.Hutchinson, 1981) and Partitioned Iterated Function Theory |
for compression ratio up to 40:1 JPEG is better; quality worse than wavelets or JPEG |
details are generated when zooming in the advanced form of interpolation |
new technology -- rediscovered by I. Daubechies in 1987 |
signal analysis - weighted sum of basis functions |
infinitely many possible sets of wavelets (= small waves) |
coefficients contain information about the signal |
basis functions
|
Heisenberg inequality - resolution in time and in frequency cannot both be made arbitrarily small |
FFT vs DWT -
|
Both fast, linear operations; invertible and orthogonal |
rotation in function space
|
wavelet - localized in space and frequency;
|
decorrelates the pixel values of the image and concentrates the image info into a relatively small number of coefficients |
can be implemented as a pair of Quadrature Mirror Filters (QMF) which splits a signal's bandwidth in half
|
Transform can be written for one of log2N steps as a matrix operation given on following foil. As we will see each step deals with half of data from previous step and resolution examined doubles at each step |
In this way we look at ALL resolutions i.e. all length scales |
Each smoothing is constructed in this particular wavelet formulation as an average over 4 points |
The matrix is orthogonal if: |
The matrix will zero first two moments on sets of four points if: |
This is basic matrix for 1D Wavelet transform where points are smoothed in groups of four |
The solution of these 4 equations is: |
The Smoothing Filter H is the average: |
The detail is contained in operator G: |
First step produces N/2 smooth and N/2 detail values.
|
This recursively leads to pyramid algorithm |
We have reviewed 1D Wavelet Transform |
There are Three steps in 2D Image Case
|
Best methods use direct 2D methods starting with 2 by 2 or similar pixel blocks. However one can compose in several ways 1D transforms. It is NOT best to first transform in x and then transform in y. Rather ... |
A nice method uses two separate but INTERMIXED 1D transforms
|
Recursively transform the average signal (depending on required ratio) |
We have matrix of coefficients (average signal and detail signals of each scale); no compression has been accomplished yet; in fact there has been an increase in amount of storage required |
compression is achieved by quantizing and encoding wavelet coefficients |
coefficients that corresponds to smooth parts of data become small and can be set to 0 without creating significant distortion in the reconstructed image |
codec = encoder/decoder |
losslessly compressing and decompressing the sparse matrix of quantized coefficients |
wide variety of schemes (Huffman, arithmetic) |
compromise between: memory, execution speed, available bandwidth, reconstructed image quality |
example: Shapiro's Zero Tree encoding |
Massachusetts General Hospital: no clinically significant image degradation was identified in radiology images up to 30:1 |
wavelet-based compression technology is superior to all other compression technologies (keeps details, high compression ratio) |
from a signal processing standpoint, one may view the image as a signal that has high-frequency (high-spatial detail) and low-frequency (smooth) components.The algorithm filters the signal and then iterates the process. |
150:1, 100:1, 50:1, 1:1 |
Which is the most beautiful of them all? |
MPEG - Motion Picture Experts Group; lossy algorithm;
|
H.261 - similar but not compatible with MPEG; videocodec for audiovisual services at px64 Kbps (p=1..30);
|
CellB - lossy algorithm, intra-frame compression; very efficient to decode in software;
|
Indeo - Intel lossy compression;
|
InSoft DVE 1- intraframe algorithm; InSoft's proprietary; very efficient to decode quickly in software; VideoPix or RasterOP cards |
Motion JPEG - higher quality than CellB;
|
Other: HDCC, H.221, H.242, QuickTime, Cinepak, TrueMotion-S |
Wavelet-based compression |
standard for compression (synchronized) audio and video |
4 parts: video encoding, audio encoding, "systems" (synchronization) and compliance testing |
defines 352x240 pixels (30 fps in USA, 25fps in Europe) |
MPEG-1- designed for bandwidth up to 1.5 Mbps |
MPEG-2 - higher quality; designed for bandwidth 4-10 Mbps |
MPEG-3 - does not longer exist; MPEG-4 - very low bitrate coding |
DCT (Discrete Cosine Transform ) done on 8x8 blocks |
lossy algorithm with compression in space (DCT) and time (frame to frame) |
3 types of frames
|
CCITT standard |
VideoCodec for Audiovisual Services at px64 Kbps (p=1..30) |
describes videosource coder, video multiplex coder and the transmission coder |
designed for ISDN |
defines two picture formats:
|
exploiting the temporal redundancies present in an image sequence (as done by MPEG) |
techniques: hierarchical motion compression, 3D subband coding |
very time consuming - 256x256x8bpp image on 66MHz 80486 - 0.25 sec inverse wavelet transform of a single full frame (4 frames per second) |
it is necessary to perform the complete inverse transform for each frame (in a slowly varying image sequence) |
16 frames per second if just transform changes in image -- fewer nonzero pixels and so faster |
wavelet@math.scarolina.edu |
http://www.mathsoft.com/wavelets.html |
"Numerical recipes", WH Press, SA Teukolsky, WT Veterling, BP Flannery |
"Ten Lectures on Wavelets", Ingrid Daubechies, 1992 |