1. Image Compression
Image compression is now essential for many applications such as image transmission across the Internet. The information contained in the images must be compressed by extracting only the visible elements, which are then encoded. The fundamental goal of data compression is to reduce the bit rate for transmission or storage while maintaining acceptable fidelity or image quality. Compression is achieved according to the steps detailed below. It is important to note that these three steps are generic to any transform compression technique.
1) Transformation: Transforming the data, projecting it on a basis of functions. This step
2) Quantization strategy: Mapping many input values into a smaller set of output values. This is a lossy step.
3) Error-free encoding: Encoding the quantized transform coefficients.
There are many choices in all of these three steps, which will impact the quality as well as
the actual achieved compression ratio. We also point out that the last two steps have a very
strong correlation with the transformation chosen in step 1. In other words, the actual transform
selected in the first step plays the key roll in the overall success of the image compression.
2. Wavelet Based Transformation
The objective of any transform is to decorrelate the image pixels by projecting the original image on a basis of linear functions, and then we can use the coefficients of the transform as the means to store the image. The more carefully we choose the basis, the fewer coefficients we need to represent the image and this fact provides the possibility for image compression. Currently, there are two kinds of transformations which are frequently used. One is traditional Fourier analysis based method, such as discrete cosine transform (DCT), which is used in JPEG. The other one is a form of the wavelet transform. This is a relatively new approach which has just become popular in the recent past. The method we use is an adaptation of the wavelet approach.
The very name wavelet comes from the requirement that the basis function (the mother wavelet) should integrate to zero, “waving” above and below the x-axis. The diminutive connotation of wavelet suggests the function has to be well-localized. Other requirements, such as requiring the wavelets to be orthornormal or symmetric, are technical and are needed to insure quick and easy calculation of the direct and inverse wavelet transform.
There are many kinds of wavelets. One can choose between smooth wavelets, compactly supported wavelets, wavelets with simple mathematical expressions, wavelets with simple associated filters, etc. Like the sine and cosines functions in the Fourier analysis, wavelets are used as basis functions in representing other functions.
There are some important differences between Fourier analysis and wavelets. Fourier basis functions are localized in frequency but not in time. Small frequency changes in the Fourier transform will produce changes everywhere in the time domain. Wavelets are local both in frequency/scale (via dilation) and in time (via translations). This localization is an advantage in many cases. For example, since many images have details at different scales and different positions, we can “look at” the image in different scales through the wavelet transform. It also allows us to deal with images locally.
Another important difference is the fact that many classes of signals or images can be
represented by wavelets in a more compact way. For example, images with discontinuities and images
with sharp spikes usually take substantially fewer wavelet basis functions than sine-cosine basis
functions to achieve the same precision. This implies the wavelet-based method has potential to get
a higher image compression ratio. Moreover as many have reported in the literature, for the same
precision, the images that were reconstructed from wavelet coefficients look better than the images
that were obtained using a cosine transform. This means that the wavelet scheme is closer to the
human visual system.
The wavelet-based image compression method provides higher image compression ratios, if we can take advantage of the mathematical structure of the wavelet transform coupled with the quantization and entropy encoder. The Lightning Strike product represents the very latest research available both in the literature as well as three years of in-house research. These efforts have produced the following results:
1) Process an image of any pixel dimension, not just a power of 2.
2) A much more tunable product according to the parameters of the transform.
3) Very large images can be compressed using sub-band encoding techniques without edge effects common to the Fourier based techniques.
4) A software only solution providing rapid compression and decompression times.
We are sure when you view the images compressed by Lightning Strike, you will agree that the bounds of compression have been redefined.