JOURNAL OF COMPUTING, VOLUME 4, ISSUE 4, APRIL 2012, ISSN 2151-9617 https://sites.google.com/site/journalofcomputing WWW.JOURNALOFCOMPUTING.

ORG

82

Still Image Compression Technique Using Edge Based In Painting and Wavelet Transform
A. Benjamin Joseph and R. Baskaran
AbstractEdges constitute the high frequency components of an image. This work proposes a novel approach for still image compression using edge based in painting technique and wavelet transform to preserve the high frequency components. The main objective of the proposed work is to elevate the PSNR without compromising the compression ratio. Edge based in painting technique is used to enhance the PSNR. In painting technique used in the proposed work traces the high frequency information which is lost during transmission using edge information transmitted. At the encoder the image is decomposed using wavelet transform, which reduces the blocking artifacts and then coded using EZW coder. Edge information is extracted using canny edge detector which outperforms the traditional detectors and then coded using entropy coding. At the decoder using edge based in painting technique, the image is reconstructed with less mean square error. The results show that proposed compression technique outperforms the existing technique in terms of PSNR and compression ratio. Index Terms Image Compression, Wavelet Transform, Edges, Feature Extraction, Image InPainting, Entropy Encoding, EZW Coding.

1 INTRODUCTION
Image compression plays a vital role in multimedia applications. Many image compression techniques have been evolved for different application; generally it can be classified as lossy and lossless techniques. In lossless technique image quality is not sacrificed, whereas in lossy image compression technique image quality can be sacrificed with intent of elevating compression ratio. The second generation coding concentrates on semantic based coding i.e the features of the images are preserved according to the desired applications. In the proposed work the edge information is preserved to increase the picture quality. Attempts have been made to code the features (edges) and low frequency components of the image to increase coding efficiency [1]. Wavelet transformation (WT) [2], [3]-[8], vector quantization (VQ) [9] and different encoding approaches are generally used in addition to numerous other methods in image compression for various applications, but all of the generic approaches suffer either in coding efficiency or picture quality. This work uses a hybrid system to preserve both spatial and spectral characteristics using wavelet transform and feature preservation. Wavelet transform is used at the encoder to decompose the image at various resolution levels. Even

though many transforms are available, wavelet transforms outperforms due to its multiresolution characteristics. Inpainting [10] was first used in image processing to restore the lost information in region of interest for visual quality. The approach that can be used to deploy inpainting in image compression is to drop certain spatial or spectral components at the encoder and restore the lost component by encoding. One straightforward way to employ inpainting in compression is to directly drop some regions in encoding but fill them up in decoding using inpainting as used in [11]. In our work in painting technique is used at the receiver to enhance the decompressed image for high visual quality to be used in computer vision applications. The main contribution in this work is towards edge preservation and inpainting technique. Further the paper structured as follows. Section II explains the related works, section III explains the proposed work and its sub sections, section IV discusses about the results and finally concluded with future scope in section V.

2 RELATED WORKS
In literature many works have been carried out in the field of image compression techniques. This section provides some of the closely related works in the literature stating its merits and demerits. The work proposed in [12 ] used parameter assisted in painting technique in which region based coding is done based on the assisted parameter. At the encoder the selected region

A. Benjamin Joseph is with the Computer Science Department, Anna University, Chennai. R.Baskaran is with the Computer Science Department, Anna University, Chennai.

JOURNAL OF COMPUTING, VOLUME 4, ISSUE 4, APRIL 2012, ISSN 2151-9617 https://sites.google.com/site/journalofcomputing WWW.JOURNALOFCOMPUTING.ORG

83

and assisted parameter is transmitted and at the decoder the original image is recovered using in painting technique. This technique saves the compression time in terms of bits and produces good visual quality but the selection of assistant parameter is complex and the spectral characteristics are not preserved. The work proposed in [13] uses the bi directional partial differential equation to inpaint the structural part. The image is decomposed into structural and texture part in a dynamic range. The structural part is inpainted using bi directional diffused PDE. This method restores the image smoothly and preserves the linear structure. The bi-directional diffusion PDE is better for structure image. Theoretical analysis and experiments proved that the novel hybrid model can inpainted both texture and structure image well. The main advantage is that the linear structure is preserved but spectral characteristics are not preserved. The compression technique proposed in [14 ] aims at visual quality instead of pixel wise fidelity. In the encoder some of the portions are skipped, edge information are extracted and transmitted to the decoder side by coding the features, At the decoder In painting is done by integrating pixel wise structure propagation and texture synthesis. This method provides 33% to 44% bit saving at high visual quality. Comparing to JPEG and H.264 the bit saving percentage is increased.. The work proposed in [15 ] uses a quick curvature driven diffusions (QCDD) model to enhance the picture quality and to reduce the computation time but the spatial characteristics neither are not preserved. The paper [16] proposes a technique, which divides the image into blocks depending upon the image size. Instead of extracting and storing the image parameter it directly operates on the image patches. The assistant parameter used here is actually the difference between the removed and preserved patches. The assistant parameter is used at the decoder to restore the image. This approach is effective only for texture images. In all the previous works only the spatial characteristics are preserved. The work proposed in this paper makes an attempt to preserve the spectral characteristics by preserving the high frequency components.

Fig. 1. Proposed Compression system.

3.1 Edge extraction and coding

Edges are points where there is a boundary (or an edge) between two image regions. In general, an edge can be of almost arbitrary shape, and may include junctions. In practice, edges are usually defined as sets of points in the image which have a strong gradient magnitude. Furthermore, some common algorithms will then chain high gradient points together to form a more complete description of an edge. These algorithms usually place some constraints on the properties of an edge, such as shape, smoothness, and gradient value. Locally, edges have a one dimensional structure. Many traditional algorithms are used to detect edges but canny [17] edge detector outperforms all other traditional detectors. Canny edge detector produces an optimal result due to the good localization and traceability of true edges. The canny edge detection consists of namely five steps Step1: Smoothening of image, removes the noise by using Gaussian filter. Step2: Finding gradient, gradient at each pixel is found by applying sobel operator and then calculate the magnitude of the gradient. Step3: Non maximum suppression, it is used to create the sharp edges from the blurred edge by rotating the pixel at some orientation angles. Step 4: Thresholding, this process uses two threshold values namely t1 and t2. The pixel values higher than t2 is accepted as edge and lower than t1 is not accepted as edge. Step5: Edge tracking, this process id used to segregate the strong and weak edges. The extracted edges are then coded using any one of the entropy coder namely Huffman or arithmetic coding.

3 PROPOSED FRAMEWORK
The proposed frame work (figure 1) aims to increase the compression ratio and PSNR using edge directed in painting techniques. The framework consists of two phases namely encoding and decoding phase. The encoding phase consists of image coding, edge extraction, edge coding and mapping as a data stream. The decoding phase consists of edge decoding, image decoding and image in-painting. The sub sections discusses about each module in the framework.

3.2 Wavelet transform

Wavelet transform is especially used for transforming images in image compression applications. For this, we apply it according to the JPEG-2000 standard: first on columns, second on rows. Upon this, we de-interleave the image matrix, and possibly recursively transform each sub band individually further. Approximate and detail coefficients are calculated by filtering process (see figure2). This process continues until the image is

JOURNAL OF COMPUTING, VOLUME 4, ISSUE 4, APRIL 2012, ISSN 2151-9617 https://sites.google.com/site/journalofcomputing WWW.JOURNALOFCOMPUTING.ORG

84

completely described or the level of detail necessary to represent the image is achieved. As more detail coefficients are described, the image becomes clearer and less blocky. Once the wavelet transform is complete, a picture can be displayed at any resolution by recursively adding and subtracting the detail coefficients from a lower-resolution version.

choose the neighbor pixel around the point p. compute the first order approximation of the image as Is(p) in point p. Given the value Is(p) and edge image Ie(p), the first iteration can be computed as

(1)
where is the original image, is the gradient edge assisted information. Compute the image and at all points of the image and then add the value of resultant value to obtain the original image. The reconstructed image is shown in figure 4.

Fig. 2. Wavelet transform

3.3 Embedded Zero-tree Wavelet

The embedded zerotree wavelet algorithm (EZW) is a simple, yet remarkable effective, image compression algorithm, having the property that the bits in the bit stream are generated in order of importance, yielding a fully embedded code using two different passes namely confinement and refinement passes. Using an embedded coding algorithm, an encoder can terminate the encoding at any point thereby allowing a target rate or target distortion metric to be met exactly. Also, given a bit stream, the decoder can cease decoding at any point in the bit stream and still produce exactly the same image that would have been encoded at the bit rate corresponding to the truncated stream.
Fig. 4. Image extraction using Edge based in painting technique

3.5 Steps in Proposed framework

Step1: Read the input image as I(x,y). Step2. Detect the edge image using Ie(x,y) using canny edge detector (section 3.1). Step3. Apply wavelet transform for the original image and extract the low frequency components alone (section 3.2). Step4: Encode the low frequency component using EZW coder (section 3.3) and edge image using entropy coding. Step5: At the decoder perform decoding operation for both encoded original image and edge image. Step6: Extract the decompressed image using edge based in painting technique (section 3.4) Step7: calculate the compression ration and PSNR.

4 RESULT AND DISCUSSION

The proposed compression system is evaluated using the two parameters namely compression ratio and PSNR. MATLAB is used for implementation and testing the results. The MSE is the cumulative squared error between the compressed and the original image, whereas PSNR is a measure of the peak error. A lower value for MSE means lesser error, and as seen from the inverse relation between the MSE and PSNR, this translates to a high value of PSNR. Logically, a higher value of PSNR is good because it means that the ratio of Signal to Noise is higher. Here, the 'signal' is the original image, and the 'noise' is the error in reconstruction. So, a compression scheme having a lower MSE (and a high PSNR), can be recognized as a better one. The compression ratio and PSNR is calculated by using the following equations Compression ratio= ori_bytes/comp_bytes PSNR = 10*log10 (255*255/MSE) (2) (3)

Fig. 3. Embedded zero tree wavelet coding.

3.4 Edge based In-painting technique

At the encoder side, the contents to be coded are comprised of original image region and assistant parameters namely edges. The original image is encoded using EZW coding and the positions of the edge are coded using entropy coding. At the decoder the edge based in-painting is used to extract the original image from the decoded image and edge image. In the decoded image the high frequency components are lost due to the omission of high frequency components at the encoder. Hence an edge based in painting technique is used to reconstruct the lost high frequency components. Consider an image to be in painted, choose a point p, and

JOURNAL OF COMPUTING, VOLUME 4, ISSUE 4, APRIL 2012, ISSN 2151-9617 https://sites.google.com/site/journalofcomputing WWW.JOURNALOFCOMPUTING.ORG

85

The results shows that (see table 1) the proposed system out performs the existing systems in terms of compression ratio and PSNR. It has been found that by ignoring the high frequency components at the encoder increases the compression ratio and by using inpainting technique at the decoder increases the picture quality. Even though many edge detection techniques are in the literature the canny edge detection detects more number of edges shown in (figure 5). TABLE1 COMPARISON OF EXISTING AND PROPOSED SYSTEM IN TERMS OF COMPRESSION RATIO AND PSNR FOR LENA IMAGE.

[6]

[7]

[8]

[9]

[10] [11]

[12]

Fig. 5. Comparison between different edge detectors.

[13]

5 CONCLUSION
In this paper we have presented a simple and novel approach for compressing the still image. Edges are extracted from the original image and encoded using entropy encoder. The original image is transformed using wavelet transform and then coded using EZW coder. The result shows that the canny edge detector outperforms the other edge detector in terms of number of edges detected. The detected edge is used at the receiver as the assistant parameter to inpaint the decompressed image. The result shows that both compression ratio and PSNR gets elevated and the spectral characteristics are preserved. The proposed method suffers due to coding complexity and number of overheads. In future the work can be enhanced for color images and by optimizing the existing system by reducing the complexity and overheads.
[14]

[15]

[16]

[17]

Engineering, Computing And Technology Vol 13 May 2006 Mohamed A. El-Sharkawy, Chstian A. White and Harry ,Subband Image Compression Using Wavelet Transform And Vector Quantization, 1997 IEEE. Amir Averbuch, Danny Lazar, and Moshe Israeli ,Image Compression Using Wavelet Transform and Multiresolution Decomposition, IEEE Transactions on Image Processing, vol. 5, NO. 1, Jan 1996. Jianyu Lin, Mark J. T. Smith, New Perspectives and Improvements on the Symmetric Extension Filter Bank for Subband /Wavelet Image Compression, IEEE Transactions on Image Processing, vol. 17,NO. 2, Feb 2008. Xin Li, , and Michael T. Orchard Edge-Directed Prediction for Lossless Compression of Natural Images, IEEE Transactions on Image Processing, vol. 10, NO. 6, Jun 2001. M. Bertalmio, G. Sapiro, V. Caselles, and C. Ballester, Image inpainting, in Proc. ACM SIGGRAPH, 2000, pp. 417424. S. D. Rane, G. Sapiro, and M. Bertalmio, Structure and texture filling-in of missing image blocks in wireless transmission and compression applications, IEEE Trans. Image Process., vol. 12, no. 3, pp. 296303, Mar. 2003. Zhiwei Xiong, Xiaoyan Sun, Feng Wu and Shipeng Li," Image Coding With Parameter-Assistant Inpainting", 2007, IEEE conference on image Processing, Dept. of Electronic Science and Technology, Univ. of Science and Technology of China, Hefei, China Internet Media Group, Microsoft Research Asia, Beijing, China. Jiying Wu, Qiuqi Ruan, "A Novel Hybrid Image Inpainting Model", 2008 IEEE conference on Image processing, Institute of Information Science Beijing Jiaotong University, Bejiing, 100044, China. Dong Liu, Xiaoyan Sun, Feng Wu, Shipeng Li, and Ya-Qin Zhang, "Image Compression With Edge-Based Inpainting' , 2007, IEEE Transaction on Circuit and System for Video Technology, Microsoft Research Asia, Beijing 100081, China. Zhongyu Xu, Xiaoli Lian, Lili Feng, "Image Inpainting Algorithm Based on Partial Differential Equation" 2008, ISECS International Colloquium on Computing, Communication, Control, and Management, School of Computer Science &Engineering, Changchun University of Technology, Changchun,Jilin, 130012, China Dong Liu , Xiaoyan Sun , and Feng Wu, "Manipulating Image Patches For Compression", 2008 IEEE conference on Image Processing, MOEMicrosoft Key Laboratory of Multimedia Computing and Communication, University of Science and Technology of China, Hefei 230027, China. Microsoft Research Asia, Beijing 100190, China. J. Canny, A computational approach to edge detection, IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. 8, No. 6, pp. 679-698, Nov. 1986.

REFERENCES
[1] M. M. Reid, R. J. Millar, and N. D. Black, Second-generation image coding: An overview, ACM Comput. Surveys, vol. 29, no. 1, pp. 329, Mar. 1997. Xiwen OwenZhao, Zhihai HenryHe, Lossless Image Compression Using Super-Spatial Structure prediction, IEEE Signal Processing Letters, vol. 17, no. 4, April 2010 383. Jaemoon Kim, Jungsoo Kim and Chong-Min Kyung , A Lossless Embedded Compression Algorithm for High Definition Video Coding 978-1-4244-4291 / 09 2009 IEEE. ICME 2009. Rene J. van der Vleuten, Richard P.Kleihorstt ,Christian Hentschel,t Low-Complexity Scalable DCT Image Compression, 2000 IEEE. K.Somasundaram, and S.Domnic, Modified Vector Quantization Method for image Compression, Transactions On

[2]

[3]

[4] [5]