International Journal of Research and Reviews in Applicable Mathematics & Computer Science, Vol. 1, No.

6, 2011

Digital Image Watermarking Using Discrete Cosine Transform and Fractal Image Compression
Dr.S.R.Suresh
Dean- Computer Applications Bharath University, Chennai 73 sur1971@gmail.com

Abstract
Visual Cryptographic methods are not sufficient to solve all image security related issues. Watermarking is the art of hiding secret image in ways that prevent the detection of hidden images. Multimedia documents are very easy to copy and distribute in an illicit manner. Copyright labeling is a process that may help to reduce their illicit copying. If this document is copied, the copy will also contain the label. This label (or watermark) should be robust enough to withstand normal image processing activities (like image compression, transforming to different format) that do not significantly alter the image appearance. In fractal, image compression the encoding step is computationally expensive, because every range block must be compared to all domain blocks in the codebook to find the best-matched one during the coding procedure. In this paper, a fast fractal-encoding algorithm is proposed. By use of IDL Software, the simulation results show that the runtime of the proposed algorithm is reduced greatly compared to the existing methods. At the same time, the new algorithm also achieved high compression ratio. Keywords: DCT (Discrete Cosine Tranform), DWT, Fractal Compression, Watermark, Digital image.

I. INTRODUCTION
Watermarking is the process of embedding data into a multimedia element such as an image, audio or video file for the purpose of authentication [2]. This embedded data can later be extracted from, or detected in, the multimedia for security purposes. A watermarking algorithm consists of the watermark structure, an embedding algorithm, and an extraction or detection algorithm. Watermarks can be embedded in the pixel domain or a transform domain. In multimedia applications, embedded watermarks should be invisible, robust, and have a high capacity. The approaches used in watermarking still images include leastsignificant bit encoding, basic M-sequence, transform techniques, and image-adaptive techniques. In the classification of watermarking schemes, an important criterion is the type of information needed by the detector. Non-blind schemes require both the original image and the secret key(s) for watermark embedding. Semi-blind schemes require the secret key(s) and the watermark bit sequence. Blind schemes require only the secret key(s). The most important uses of watermarks include copyright protection (identification of the origin of content, tracing illegally distributed copies) and disabling unauthorized access to content. The requirements for digital watermarks in these scenarios are different, in general. Identification of the origin of content requires the embedding of a single watermark into the content at the source of distribution [4].

December Issue

Page 89 of 103

ISSN 2249 8931

International Journal of Research and Reviews in Applicable Mathematics & Computer Science, Vol. 1, No.6, 2011

To trace illegal copies, a unique watermark is needed based on the location or identity of the recipient in the multimedia network. In both of these applications, non-blind schemes are appropriate as watermark extraction or detection needs to take place in special laboratory environment only when there is a dispute regarding the ownership of content. For access control, the watermark should be checked in every authorized consumer device, thus requiring semi-blind or blind schemes. Two widely used image compression standards are JPEG and JPEG 2000. The former is based on the Discrete Cosine Transform (DCT), and the latter the Discrete Wavelet Transform (DWT). In recent years, many watermarking schemes has been developed using these popular transforms [3]. In image watermarking, two distinct approaches have been used to represent the watermark. In the first approach, the watermark is generally represented as a sequence of randomly generated real numbers having a normal distribution with zero mean and unity variance. This type of watermark allows the detector to statistically check the presence or absence of the embedded watermark. In second approach, a picture representing a company logo or other copyright information is embedded in the cover image. The detector actually reconstructs the watermark, and computes its visual quality using an appropriate measure. In fractal, image compression [1] image blocks (ranges) have to be compared against a large codebook of blocks. The typical codebooks consist of many thousands of blocks. For each such comparison, a computationally expensive least squared Metric is required. To decrease the computational cost during the domain block search, some efforts have focused on reducing the comparing complexity for making encoding faster. The classification or clustering methods [1], which speed the search up, by restricting the search space to a subset of the domain block pool in which features extracted from the blocks are represented. Organizing the domain blocks into a tree structure is another approach, which allows for faster searching compared to a linear search. This approach can provide a reasonable speed-up while maintaining the same quality of compression. Fast fractal image compression using spatial correlation is another method. DCT based classification has been used for speeding up the comparison time [8, 9]. Some "no search" methods have also been proposed [11]. The "no search method" works very fast but the reconstructed image quality is not good. Our proposed method is to combine both watermarking using DCT and Fractal Image Compression. This method improves the stego image quality, embedding capacity and reduce the computation cost.

II. PROPOSED SYSTEM

a) Watermark Embedding Process In the scheme, the size of the significant region is 256256.In accordance with section III-B, the size of range blocks and domain blocks are 88,1616.Taking the capacity of watermark into account, similar threshold 0 is dependent on the capacity of the watermark(256 bits). It must be greater than MSEmin and less than MSEmax. If the capacity of the watermark is larger, then 0 must be bigger to get more self-similar blocks. Otherwise, 0 is smaller. We also take 0 as a private key. Then pick up the selfsimilar blocks and numbered them from 1 to 256, represented by E (1 i 256) i .Each bit is embedded in one block in DCT domain. Watermark embedding process is shown in Fig.4, and the processing of embedding watermark is described below: (1) Apply DCT to each Ek (88), the block zigzag scanned coefficients A (i = (1.2,...,64). (2) Watermark bit is embedded in middle-band, with black background. Embedding strength . bk is adaptive according to the feature of the each Ek .

December Issue

Page 90 of 103

ISSN 2249 8931

International Journal of Research and Reviews in Applicable Mathematics & Computer Science, Vol. 1, No.6, 2011

b) Watermark Extraction Process Watermark extraction is the inversion process of the embedding. The following steps are taken to decode the embedded watermark in an image. (1) Find significant region (2) Find self-similar blocks. (3) Apply DCT to each self-similar block to extract watermark through the following equation:

(4) Finally, reconstruct watermark from Wk c) New Fractal image Compression Algorithm In thissection, we give a sketch of the proposed algorithm based on the new DCT metric. In the following we indicate with Ri (Dj) either a 4 x 4 (8 x 8) spatial area or the image defined on it. 1. Partition given image into 4 x 4 blocks Ri, and reshape it into 1D array of 4x4=16 elements. 2. Compute the DCT of each Ri: DRi= DCT(Ri) 3. For each 8 x 8 block Dj, compute the contracted 4x4block Dj '; Dj 's are overlapped blocks, with p being (p=1 in our proposed method) the overlapping step, i.e. the distance (in pixels) between the upper left corners of two consecutive blocks D; the smaller the value of p, the greater the size of the searching space and the better quality of the reconstructed image. Reshape Dj 's into 1D array of 4x 4=16 elements. 4. Compute the DCT of each Dij:DDj= CT(Dj); 5. For each DRi find array DDj 6. Save isometric transformation Ri and index of domain relative to the best matching between DRi and DDj. We used 8 bits to save Ri, 14 bit for save domain index and 3 bit for save isometric transform.

Convert 2D matrix to array

December Issue

Page 91 of 103

ISSN 2249 8931

International Journal of Research and Reviews in Applicable Mathematics & Computer Science, Vol. 1, No.6, 2011

III Experimental Results

The proposed algorithm has been executed on a set of images. The algorithm tests only color images. This algorithm was found to be a very robust method of non-blind watermarking which can be used to embed copyright information in the form of a visual watermark or text. Embedding can be carried out in all the frequencies without reasonable distortion in the visual watermark. This method was found to satisfy all the requisites of an ideal watermarking scheme such as imperceptibility, robustness and good capacity. The quality of the reconstructed image was evaluated by PSNR. PSNR is reduced and time taken for executing method is reduced. This system is implemented in IDL (Interactive Data Language) software.

IV CONCLUSION
In this paper, Watermarking based on DCT and Fractal compression on the color image is proposed. This proposed method is expected to work satisfactorily on color image. This method consists of two phase. In the first phase, watermarking using DCT is carried out. In this phase, first input image is divided number of equal block, calculate the DCT transform coefficients, then select DC components of each block and finally embed the secret image pixels in each image . In the second phase, Fractal compression is carried out. In this, input image is divided into equal size of square blocks, determine which larger block has the lowest difference and calculate a grayscale transform to match intensity levels between large block and child block. Finally, image is compressed. The runtime of the proposed algorithm is reduced greatly. At the same time, new algorithm achieved high compression ratio.

a) Input Image

b) Secret Image

December Issue

Page 92 of 103

ISSN 2249 8931

International Journal of Research and Reviews in Applicable Mathematics & Computer Science, Vol. 1, No.6, 2011

c) Watermarked Image

d) Extracted Image

REFERENCE
[1] K.M Curtis, G.Neil and V.Fotopoulos A Hybrid Fractal / DCT Image Compression Method DSP 2002-1337 IEEE. A.M.Kothari, A.C.Suthar, R.S.Gajre, Performance Analysis of Digital Image Watermarking TechniqueCombined DWT DCT over individual DWT, International Journal of Advanced Engineering & Applications, Jan. 2010 Navas K.A. et al. DWT-DCT-SVD based Watermarking . Chi-Kwong Chan*, L.M. Cheng, Hiding data in images by simple LSB substitution, 2003 Pattern Recognition Society. Kaliappan Gopalan, An Image Steganography Implementation for JPEG-Compressed Images, 2007 IEEE. Chin-Chen Chang, Tung-Shou Chen, Lou-Zo Chung, A steganographic method based upon JPEG and quantization table modification, 2002 Elsevier Science Inc., Ingemar J. Cox, Joe Kilian , F. Thomson Leighton, and Talal Shamoon, Secure Spread Spectrum Watermarking for Multimedia IEEE Transactions on Image Processing Vol 6, No. 12, December 1997. Jarno Mielikainen, LSB Matching Revisited, IEEE Signal Processing Letters, Vol 13, No. 5, May 2006. Nguyen T. Thao, A Hybrid Fractal-DCT Coding Scheme for Image Compression, 1996 IEEE. G. Farhadi, A Hybrid Image Compression Scheme using Block-Based Fractal coding and DCT, 4th EURASIP Conference focused on Video / Image Processing and Multimedia Communications.

[2]

[3] [4]

[5]

[6]

[7]

[8]

[9] [10]

December Issue

Page 93 of 103

ISSN 2249 8931

International Journal of Research and Reviews in Applicable Mathematics & Computer Science, Vol. 1, No.6, 2011

[11]

Ko-Ming Chan and Long-Wen Chang, A Novel Public Watermarking System based on Advanced Encryption System, Proceedings of the 18th International Conference on Advanced Information Networking and Application. Jiang-Bin Zheng, Sha Feng, A Color Image Multi-Channel DWT Domain Watermarking Algorithm for Resisting Geometric Attacks, 2008 IEEE. Sun Jin-guang, A New Fractal Watermarking Scheme Based on Image Normalization, 2009 International Conference on Multimedia Information Networking and Security. Korush Kiani, Keyvan jaferzadeh, hadi rezaei, A New Simple Fast DCT Coefficients-Based Metric Operation for Fractal Image Compression, 2010 Second Internationl Conference on Computer Engineering and Applications. Lintao LV, Liang Hao, Hui Lv, Resisting RST Watermarking Algorithm for Image Content Authentication, 2010 Second Internationl Conference on Networks Security, Wireless Communications and Trusted Computing. Haiyan Zhao, Algorithm of Digital Image Watermarking Technique Combined with HVS, 2010 IEEE.

[12]

[13]

[14]

[15]

[16]

Author Profile
Dr. S.R.Suresh received his Ph.D degree from Alagappa University, KARAIKUDI in 2009. He is currently working as a DEAN Computer Applications in Bharath University Chennai. He is having overall teaching experience of 17 years including professional colleges. His major research Interests are in Fuzzy logic, Expert systems, Artificial Intelligence and Computer-Engineering.

December Issue

Page 94 of 103

ISSN 2249 8931