Download Full-Text PDF Cite this Publication

**Open Access**-
**Total Downloads**: 5 -
**Authors :**Ramafiarisona Hajasoa Malalatiana -
**Paper ID :**IJERTV8IS010083 -
**Volume & Issue :**Volume 08, Issue 01 (January – 2019) -
**Published (First Online):**28-01-2019 -
**ISSN (Online) :**2278-0181 -
**Publisher Name :**IJERT -
**License:**This work is licensed under a Creative Commons Attribution 4.0 International License

#### Dual Watermarking Technic using Chaotic Map And Discrete Wavelet Transform

Ramafiarisona Hajasoa Malalatiana

Telecommunication-Automatic-Signal-Image-Research

Laboratory/Doctoral School in Science and Technology of Engineering and Innovation/University of Antananarivo Antananarivo, Madagascar

Abstract

There is an increasing need of security for information and communication due to the growth of internet users. Many techniques are available to satisfy these needs such as cryptography, steganography or watermarking. We propose a dual scheme for image watermarking by combining encryption and multi-resolution analysis. This mechanism has advantages of providing both high security and low time complexity. It uses chaotic encryption with logistic map, alpha fusion method and discrete wavelet transform (DWT) algorithm both together. The main objective is to achieve high security, high Peak Signal to Noise Ratio (PSNR) value, good imperceptibility and robustness.

KeywordsWatermarking; Encryption, Logistic map; Alpha fusion; DWT(Discrete Wavelet Transform).

INTRODUCTION

Nowadays, Information security and confidentiality become unavoidable problems and cannot be ignored.

This paper uses a new scheme based on two techniques: cryptography and watermarking.

Watermarking techniques are appropriate for copyright protection. It embeds an invisible signature into a host source. Some requirements are needed like imperceptibility of the hidden signature, robustness against data processing and attack, capacity of hiding. In this case, the embedding method is based on wavelet transform and alpha fusion.

CHAOTIC ENCRYPTION AND DECRYPTION

Principle

Chaotic systems are particular class of non linear system.

A chaotic system must obey some conditions [1][2]:

Non linearity

Determinism

Sensibility of initial values

We obtain a chaotic function by iteration of simple mathematical function. Many functions can be used like logistic recurrence (1), sine recurrence (2), standard recurrence (3), etc [3][4].

(1)

(2)

(3)

Encryption and decryption of the signature is performed by a two-dimensional logistic map that Eq (4) defines [4][5][6]:

(4)

X and Y contain elements as much as signature length: After this step, we rearrange X and Y to match the size of the signature. Results are used for diffusion and confusion.

Diffusion method

Maps X and Y are summed and converted to decimal numbers by an approximation, we obtain the map S. A function is preformed to each sub block of 4 by 4 of S, the result is noted T. Finally, we sum the mark M with T to get the cipher signature with diffusion method. It can be illustrated:

Fig. 1 Diffusion method of the signature

Figure 2 shows how the diffusion method using this two- dimensional logistic map affects the mark and its histogram.

Fig.2 Result of diffusion method

Statistically, the histogram of the cipher image is uniform. The mark is substituted by a chaotic generator with couple of initials values (xo, yo).

The mark is perfectly recovered when we strictly use the same couple of initials values on the restitution process.

Confusion method

X is used to mix pixel in the same row, and Y to the same column. First, the map X is sorted on its row to get a matrix containing the indexation of this sort: Xp. Then, the mark is permuted row by row following the layout of Xp: we obtain

We process in the same way for column by Y. This method is illustrated on Fig.3.

Reconstitution of f(t) is given by:

(8)

Fig.3 Confusion method of the signature

Figure 4 shows the permutation process of M instead of U so we can visualize how it works.

Fig.4 Logistic permutation of image

DISCRETE WAVELET TRANSFORM

Discrete Wavelet Transform

1D DWT

Discrete Wavelet Transform (DWT) uses filtering to analyze signals. An analyze process is based on dividing the signal in to 2 sub band: a half for low frequency and another half for high frequency. A decimation by 2 is used after filtering. We can compute many processing as needed by taking the low frequency of the previous process as new parameter. Fig.5 shows how an analysis works. [9][10][11].

In order to combine strengths of spatial and frequency domain watermarking, we use a multi-resolution analysis

2D DWT

Fig.5 Analysis with DWT

which provides a spatial-frequency representation of image. The wavelet transform is of this type.

Continuous Wavelet Transform

The Continuous Wavelet Transform (CWT) uses the same principle as Short Term Fourier Transform analysis. However, there are two main differences between them [8][9]:

Analyzer function isnt the same: for STFT, the analyzer is Fourier function; for CWT, the analyzer function is a wavelet.

The width of the window is changed as the transform is computed.

Wavelet

The base function of CWT is the wavelet. Its a function that graphically represents a little wave. We get the transformation by convolution of a contracted, dilated, and translated wavelet.

A function is a wavelet if:

For two dimensional signals, each decomposition level

contains two levels:

Analysis across row vector which give 2 signals. The decimation by 2 permits to reduce information by half so results are the same size as original.

Analysis across column vector.

A decomposition level gives one matrix of approximation LLX (stands for Low Low level X) and three matrixes of details: LHX, HLX, HHX (respectively Low High level X, High Low level X, High High level X).[10][11][12]

Fig.6 Representation of approximations and details coefficients

(5)

Where (f) is the FT of (t). It is the admissibility condition.

CWT

Analyzer functions are defined by dilatation and translation of the main wavelet.

b is the translation parameter a is the scale factor

So, CWT of signal f(t) is:

(6)

(7)

Fig.7 Wavelet decomposition of an image

PROPOSED WORK

An algorithm of watermarking using chaotic map and DWT decomposition is discussed in this section. Its

performance is quantified by insertion capacity, robustness against attack and imperceptibility.

Performance measurements

Capacity

The capacity is the ratio between the volume of signature and the size of cover image.

C. Results and Discussions

This section is dedicated on performance measurement. Host source is the image lena.tif and the mark is a grayscale image.

(9)

M is the size of the signature expressed in Bit.

The denominator is the size of the host image expressed in number of pixel.

Imperceptibility

Imperceptibility is quantified by Mean Square Error (MSE) and Peak Signal to Noise Ratio (PSNR)

(10)

(11)

M and N denote row and column size of image a and b. Higher the PSNR, better the imperceptibility is.

Robustness

Mathematically, robustness is expressed by the correlation between the original mark and the extracted mark from watermarked image.

(12)

Where A and B are images to be compared.

B. Embedding process

The signature is encrypted using logistic mp. The cover image is decomposed in 2 levels by DWT. We embed the cipher mark in a level 2 sub band by alpha fusion method.

Alpha fusion method is a weighted sum of two matrix described as follow:

(13)

X is the level 2 DWT decomposed host image. W is the encrypted signature.

Alpha is the integration coefficient and represents the strength of the watermark. Fig.8 shows the diagram of embedding process.

Fig.8 Embedding diagram

Fig.9 (a) host image, (b) mark

The capacity of insertion is equal to the size of the support sub band. In level 2, the capacity is the quarter of host image.

Influence of insertion sub band and alpha Imperceptibility depends on two factors: the insertion sub band and the integration coefficient. Fig.13 shows their relation.

Fig.10 PSNR depending on integration sub band and alpha

LL2 sub band contains the lowest frequencies of the image. So an insertion on this sub band drives to many bad effects on imperceptibility.

PSNR of the image increases with alpha. Human sight doesnt see differences between the original image and the watermarked if PSNR is above 40 dB.

Robustness measurements

This part tests the robustness of watermark against erasure and geometrical attack.

The watermarked image will be tested by:

Erasure attack

Geometrical attack

Results against noise

This section evaluates the robustness of the watermark when we add noise. Gaussian noise is used.

Fig.11 Robustness against Gaussian noise

The mark is robust against noise for little values of alpha. HH2 is the best insertion support.

Results against filtering

Median filter is used for tests.

Fig.12 Robustness against median filter

The algorithm is especially robust against filtering. Correlations remain constant for alpha values below 0.8. They suddenly decrease above this value but the mark is still recognizable.

Results against rotation

Figure 13 shows correlation results.

Fig.13 Robustness against rotation

Correlations dont exceed 0.25. It isnt enough to recover the signature. A slightest rotation drives to an undetectable and unrecognizable mark.

CONCLUSION

Applied to signatures, encryption using chaotic system with logistic map is very fast, easy to compute and provides high level of security.

Restriction of old embedding process led us to apply a multi- resolution analysis tool for watermarking, especially DWT. It requires the original image to extract the mark. DWT based watermarking scheme appears to be resistant on erasure attack.

REFERENCES

[1] | D E Goumidi, Â«Fonction logistique et standard chaotique pour le chiffrement des images satellitaires Â», Diploma thesis, Mentouri University, 2010 |

[2] | S J Clinton, Chaos and time-series analysis, Oxford Universities Press, 2003 |

[3] | F Ansett, Les systems dynamiques chaotiques pour le chiffrement: synthÃ¨se et cryptanalyse, Nancys Automatic Research Center, 2005 |

[4] | J Friedrich, Symmetric ciphers based on two-dimensional chaotic maps, Chaos Solitons and Fractals, 1998 |

[5] | J Gleick, La thÃ©orie du chaos vers une nouvelle science, Champs Flammarion, 1991 |

[6] | J Friedrich, Image encryption based on chaotic maps, IEEE Conference on System, Man and Cybernetics, 1997 |

[7] | M Antonini, Daubechies, Image coding using wavelet transform |

[8] | R Polikar, fundamental concept & overview of the wavelet theory, Dept. of Electrical and Computer Engineering, 1996 |

[9] | I Daubechies, Ten lectures on wavelets, Regional Conference Series in Applied Mathematics, Philadelphia, 1992 |

[10] | R Alt, La transformation en ondelettes, Pierre and Marie Curie University, 2001 |

[11] | C Rey and J L Dugelay, An overview of watermarking algorithms for image authentification, EUROCOM Institute, 2000 |

[12] | P Y Chen and H J Lin, A DWT based approach for image Steganography, International Journal of Applied Science and Engineering, 2006 |