IMAGE COMPRESSION USING CONTOURLET WITH SVM

GUIDE : Mr. ARUN VIKAS SINGH NAVYA R. - 1PI09EC072 NEENA S. HULKOTI 1PI09EC073

IMAGE
Image is a vivid or graphic description. It is a 2-D function f(x,y). x,y are spatial (plane) coordinates.

Amplitude of f(x,y) at any pair of coordinates (x,y) is the intensity or gray level of the image at that point.
Images are stored in various file formats . gif - Graphics Interchange Format . jpg - Joint Photographic Experts Group . tiff - Tagged Image File Format . png - Portable Network Graphics

TYPES OF IMAGE
Binary image: Each pixel can take only two values either 0 (black) or 1 (white).

Greyscale image (8 bit): Each pixel has a value from 0 (black) to 255 (white). The image includes 256 shades of grey.

Color image: Each pixel in color image is a three element vector and is constructed from three intensity maps. Each intensity map is projected through a color filter (red, green, blue) to create a blue, green) monochrome image.

IMAGE ACQUISITION

IMAGE RESTORATION

IMAGE ENHANCEMENT

IMAGE ANALYSIS: SEGMENTATION + RECOGNITION

IMAGE DISPLAY

IMAGE COMPRESSION

Image Acquisition involves sensing of an image. It also involves preprocessing, such as scaling. The acquisition of images is referred to as imaging. Image Enhancement involves highlighting certain features of the acquired image. It enhances the image and is a subjective process based on human perception. Image Restoration involves removal of distortion (noise) and restores a image. It is objective process based on mathematical and probabilistic models of image degradation.

Compression is a technique that is used for reducing the storage space for saving an image and reducing the bandwidth required for transmission of image.
Segmentation is the process in which image is converted into small segments so that we can extract the more accurate image attributes. Recognition is a process that assigns a label to an object based on its descriptors.

FOURIER TRANSFORMS
The Fourier transform is a mathematical operation that decomposes a signal into its constituent frequencies.

The Fourier transform decomposes a function into oscillatory functions. An inverse Fourier transforms data from the frequency domain into the time domain. The discrete Fourier transform (DFT) estimates the Fourier transform of a function from a finite number of its sampled points.

Disadvantages
If f(t) is a nonperiodic signal, the summation of the periodic functions, sine and cosine, does not accurately represent the signal Fourier sine and cosine are not localized in space. Traditional Fourier methods cannot be used in analyzing physical situations where the signal contains discontinuities and sharp spikes.

DISCRETE WAVELET TRANSFORM

Wavelets are small waves of varying frequency and limited duration.

They are mathematical functions that cut up data into different frequency components. The algorithms process data at different scales or resolutions.
The individual wavelet functions are localized in space and form the basis function. The wavelet series expansion maps a function of a continuous variable into a sequence of coefficients. If the function being expanded is itself discrete sample of a continuous function the resulting coefficients are the discrete wavelet transform (DWT).

CONTOURLETS

The contourlet transform is a new two-dimensional extension of the wavelet transform using multiscale and directional filter banks.
The contourlet expansion is composed of basis images oriented at various directions in multiple scales, with flexible aspect ratio. The main difference between contourlets and other multiscale directional systems is that the contourlet transform allows for different and flexible number of directions at each scale, while achieving nearly critical sampling

CONTOURLET TRANSFORM
The contourlet transform consists a LP followed by a DFB. LP-laplacian pyramid DFB-directional filter bank The Laplacian Pyramid (LP) is used to capture the point discontinuities, and then followed by a Directional Filter Bank (DFB) to link the point discontinuities. In contourlet transform, the Laplacian Pyramid decomposes the image into sub-bands and then the Directional Filter Banks analyze each detail image
LP DFB

CONTOURLET DECOMPOSITION

LAPLACIAN PYRAMID
The LP decomposition at each level generates a down sampled low pass version of the original and the difference between the original and the prediction, resulting in a band pass image

The Laplacian is then computed as the difference between the original image and the low pass filtered image. This process is continued to obtain a set of band-pass filtered images. Thus the Laplacian pyramid is a set of band pass filters. By repeating these steps several times a sequence of images, are obtained.

DIRECTIONAL FILTER BANK

The directional filter bank is a critically sampled filter bank that can decompose images into any power of twos number of directions.

WAVELETS & CONTOURLETS

Wavelets have square supports that can only capture point discontinuities, whereas contourlets having elongated supports that can capture linear segments of contours and thus effectively represent a smooth contour with fewer coefficients.
2-dimensional wavelets, with tensor-product basis functions lack directionality and are only good at catching point discontinuities, but contourlets also capture the geometrical smoothness of the contours.

SUPPORT VECTOR MACHINE

SVMs are used for classification, regression, and density estimation. Typically, the training vectors are mapped to a higher-dimensional space using a kernel function, and the linear separating plane with the maximal margin between classes is found in this space. SVM training involves optimizing over a number of parameters. SVMs can also be applied to regression problems. An input parameter to a SVM is a insensitivity zone (tolerance). The goal of the SVM is to produce an output which is within this insensitivity zone.

WAVELET COEFFICIENTS

CONTOURLET COEFFICIENTS

ORIGINAL

CONTOURLET WITH SVM

WAVELET WITH SVM

CONTOURLET WITH SVM

PSNR in DB

WAVELET WITH SVM

PSNR in DB

31.045321

27.680352

30.879295

25.698467

30.910235

29.868164

QUALITY MEASURE
The PSNR (Peak signal-to-noise Ratio) is most commonly used as a measure of quality of reconstruction of lossy compression codecs (e.g., for image compression). The signal in this case is the original data, and the noise is the error introduced by compression. When comparing compression codecs it is used as an approximation to human perception of reconstruction quality, therefore in some cases one reconstruction may appear to be closer to the original than another, even though it has a lower PSNR (a higher PSNR would normally indicate that the reconstruction is of higher quality).

REFERENCES
Jonathan Robinson, The Application of Support Vector Machines to Compression of Digital Images, February 2004 Brian Guilfoos, Judy Gardiner, Juan Carlos Chaves, John Nehrbass, Stanley Ahalt, Ashok Krishnamurthy, Jose Unpingco, Alan Chalker, Laura Humphrey, and Siddharth Samsi, Applications in Parallel MATLAB, Ohio Supercomputer Center, Columbus, OH S. Esakkirajan, T.Veerakumar, V.Senthil Murugan, R.Sudhakar, Image compression using contourlet transform and multi stage vector quantization, GVIP Journal,Vol 6,Issue 1, July 2006 Minh N. Do, Martin Vetterli, The Contourlet Transform for Image Representation, Digital Encoding of Signals, 06.07.2004 Duncan D.-Y. Po and Minh N. Do , Directional Multiscale Modeling of Images using the Contourlet Transform, IEEE Transactions on Image Processing

THANK YOU