You are on page 1of 5

2020 International Conference on Artificial Intelligence and Signal Processing (AISP)

DCT-DWT Based Digital Watermarking and


Extraction using Neural Networks
R S Kavitha1 , U Eranna2 , and M N Giriprasad3
1
Research Scholar, Department of ECE, JNTUA Ananthapuramu, AP, India.
2
Department of ECE, Ballari Institute of Technology and Management, Ballari, KTK, India.
3
Department of ECE, JNTUA Ananthapuramu, AP, India.
email: drkavithakavana@gmail.com, jayaveer 88@yahoo.com, mahendragiri1960@gmail.com

Abstract—Recent trends in information technology have mirac-


Distorted
ulously changed the way people interact with multimedia de- Watermarked Watermarked
vices. The steady and consistent developments in communication Water image Image Water
Recovered
Original Attacks/ Detection
technologies have created a situation where a massive amount Image
Embedding
Noise Algorithm
Watermark
Algorithm
of data and thereby information is created, stored and shared
every second. With an increased number of devices, backed by
•Robustness Attacks
enhanced communication technologies the insurgence towards Watermark •Presentation Attacks
originality and ownership of the data is increasing. Among •Counterfeiting Attacks
•Spatial domain
various other methods of protecting the originality and ownership •Additive Watermarking
of the digital data, watermarking has emerged to be a prominent •Least Significant Bit
•Texture Mapping Coding Technique
one. Watermarking allows the copyrighting of the data through •Patchwork Algorithm
algorithm-driven encoding techniques. Along with imperceptibil- •Correlation-Based Technique
•Frequency Domain
ity and robustness, digital watermarking also requires default •Discrete Cosine Transforms
•Discrete Wavelet Transforms
requirements such as security, fidelity, inseparability, payload •Discrete Fourier Transforms
capacity and effectiveness. For a digital watermark to be insep-
arable, the carrier signal(secret key) should remain undistorted
outside certain specific conditions. The aim here is to create an
algorithm which can efficiently create strong a digital watermark
and which can also extract the watermark without the need of Fig. 1. A typical digital watermarking process.
the original image using neural networks. Here we propose a
neural network-driven digital watermarking with functions in
frequency domain transformation. A strong DCT-DWT hybrid marks were created across Europe in the late 13th century and
algorithm is used to embed a visible watermark into the original
were inspired by steganographic techniques. Steganography
image and at later stages neural networks are deployed to extract
the watermark without the use of the original pure image. and watermarking are the two sides of a coin which role
Index Terms—Chaos, Secure communication, Signal generator, together. While Steganography focuses on making the data
double scroll. imperceptible to the unwanted user, watermarking tries to
control the robustness of the encoded noise. Though emerged
I. I NTRODUCTION out of conventional steganographic techniques, digital water-
The digitalization of information has paved a way to the marking has evolved to have its distinguished approaches and
massive and rapid creation of data in various types such as challenges.
image, audio, video, and transactions[1]. The sophistication of A typical digital watermarking process follows three major
technologies in data and information which are favoured by steps. The embedding stage is the first stage where the
the improvement in communication technologies have largely watermark is inserted. The distortion or attack stage is where
supported multimedia device users to create, store and share the supposed distortion of the watermarked image takes place
a massive amount of data every second. The amount of data which may or may not occur with an attack by a third user.
generated by the users has almost increased ten folds within The final step is the detection of the original image where the
the recent few years. With more of the user-generated data original image is retrieved out of the watermarked image.
stored and accessed through public domain platforms, unau- Varieties of digital watermarking are sought out in a wide
thorized and malicious use of data has increased which has spectrum of applications. With visible watermarks being the
lead to active requirements towards maintaining the originality most basic form, they usually find applications in video
and ownership of the data. Digital watermarking has emerged contents to show the ownership. On the other hand, invisible
as a prominent research area in this regard[2]. watermarks are used to maintain the originality of the image.
The work being carried out towards maintaining the orig- Robust watermarking is used to assign copyrights to digital
inality of the content or object has quite an old history. As content. Fragile watermarks are usually found sensitive to
a means to identify the papermaker, the first forms of water- changes in the signal and are used to protect the integrity

978-1-7281-4458-0/20/$31.00
Authorized ©2020
licensed use limited to: Consortium IEEE
- Algeria (CERIST). Downloaded on December 08,2022 at 17:37:29 UTC from IEEE Xplore. Restrictions apply.
2020 International Conference on Artificial Intelligence and Signal Processing (AISP)

TABLE I
L ITERATURE S URVEY FOCUSING ON OBTAINING SPECIFIC RESULTS AND TECHNIQUES

Authors Technique Remarks


WANG Zhenfei et al., Davis et al.,Zhenfei Wang et al., Xue-Quan Xu et al.[5][6] DWT Robustness
Jose Aguilar et al. Spatial domain
Qianhui Yi et al. [7] DWT Imperceptibility
Sameh Oueslati et. al DCT
Song HUANG et al. [8] Arnold Transform Invisibility
Jun Sang et al. Spatial domain
Zhang et al. Multiwavelet Transform
Jun Zhang et al. Multiwavelet Transform
Mohamad Vafaei et al., Vafaei et al.,Cheng-Ri Piao et al.Nallagarla Ramamurthy et al. [9][10] DWT Imperceptibility and robustness
Pallavi Agrawal DCT,CWT Robustness an Adaptability
Olanrewaju et al. [11][12] Fourier Transform Fidelity

of the digital information[3]. These being the major forms of Andrew Terkel and Charles Osborne in 1992. The major
watermarks, their variations and selective combination such studies on the domain caught fire in the early 2000s[20]. In
as semi-fragile watermarks, invisible-robust watermarks, and 1999 watermarking as a technique to hide secret information
invisible-fragile watermarks also find task-specific applica- within images for labelling digital pictures was proposed
tions. Further, the quality of digital watermarks is found to by Hsu C-T., et al[21]. Nikolaidis N et al. gave a birds-
be dependent on four major aspects[4]. Robustness of the view on various other data hiding techniques to protect the
watermark usually has to be high enough to be able to resist copyright of still images around the same time. During 2002,
certain designated classes of transformations. The payload Lihyang et al. put forward a detection based algorithm which
capacity of the watermarks depends on the schemes used. was applied to the attacked signal in an attempt to recover
From one bit scheme to n-bit scheme, the capacity usually the watermark[22][23]. Faithful results in this regards were
determines how well the watermark can be detected by the obtained confirming that if the signal were unobliterated, the
detection algorithm. The perceptibility of the watermark has watermark could be extracted completely. Mathew et al. in
to be low enough to prevent detection from malicious users. 2010, proposes an image watermarking scheme which was
Most importantly, the embedding method determines how well based on Singular Value Decomposition method. The result
the watermark serves its purpose[13]. was found to be more robust and secure. Rather than using
fixed orthogonal bases, the method contradicted giving good
II. BACKGROUND accuracy, imperceptibility and robustness[24]. In 2013 Kaur
G et al. proposed the Least Significant Bit watermarking
Watermarking can be achieved either by changing the least
technique which mainly focused on the security of the applied
significant pixel values or by changing the coefficient values.
image[25]. However, it was understood that LSB being a
The quality of the watermark depends on the method used.
spatial domain, it could be easily identified and thus was
The pixel variation method corresponds to a non-robust spatial
a loose chain. The very next year Zargar et al. showed
domain of transformation whereas the coefficient variation
that the LSB method could be enhanced by doing an and
technique refers to frequency domain variations[14]. Most
operation with MSB of the watermarked image[26]. Based
popular among which, being the frequency domain variation
on this technique a simple watermarking algorithm was given
method which includes Discrete transformation techniques of
which was resistant to several attacks. In 2016, Kaur S et
cosine, Fourier, and wavelet parameters. Unlike the spatial
al. presented a hybrid watermarking technique[27]. It used
domain, frequency-domain methods are more efficient. The
Singular Value decomposition along with Discrete transforms
watermark is embedded in spectral coefficients of the image
of Fourier and wavelet coefficients. The repeated iterative
as the characteristics of the human visual system are better
function of the Kalman filter was used to enhance the quality
captured in spectral coefficient[15][16]. Discrete wavelet trans-
of the watermarked image[28]. Diagonal components of value
form, as the name suggests uses small waves, namely wavelets
decomposition followed by LH filtering of Wavelet transform
with different frequencies. As it points both to location and
which was protected by a middle-frequency level of cosine
frequency of the information, it is mostly used for audio and
transforms were in combination. Table 1. Shows an extended
video data compression. Digital cosine transform, on the other
literature survey focusing on obtaining specific application
hand, is a lossy compression method usually used for audio
based advantages[29][30]. Adapting the most suitable tech-
and images. Along with strong energy compaction, it treats
nique for particularly required advantage has to be inferred
individual frequencies uniquely[17][18][19]. These algorithms
from the table.
are usually found robust against brightness, contrast and low
pass filtering adjustments. Discrete Fourier transform modifies
III. E XPERIMENTATION AND R ESULT ANALYSIS
continues functions into discrete coefficients of frequencies.
The recent decade has seen significant research in the It has now to be appreciated that frequency domain trans-
domain. The term ’Digital Watermark’ was first coined by form techniques give far better results when compared to

Authorized licensed use limited to: Consortium - Algeria (CERIST). Downloaded on December 08,2022 at 17:37:29 UTC from IEEE Xplore. Restrictions apply.
2020 International Conference on Artificial Intelligence and Signal Processing (AISP)

spatial domain transformation. In particular, DWT is more Algorithm 2 Watermarking using DWT (PART II)
reliable as it gives multi-resolution characteristics along with Require: inputimg : C
faithful spatial localization. On the other hand, DCT embeds x[n] : random watermark generator
the watermark into the coefficients of middle frequency mak- outputimg : watermarked image by x.
ing the watermarked image resistant to a wide range of attacks. while image is 2D or 3D do
In this work, the authors develop a hybrid algorithm which start encoding model;
uses both DWT and DCT techniques to embed the watermark if inputimg > required size then
into the image. Unlike conventional watermarking techniques, start encoding model:
two types of watermarks are simultaneously embedded into the image encoding process starts;
original image. initially, DCT is applied to the original image read C;
to generate a visible Watermark. This DCT watermarked compute variations in C;
image is then fed into the DWT system where it embeds compute size and array matrix of C;
the previously watermarked image with invisible watermark. A = apply DWT to C;
Thus the hybrid algorithm is used to make the watermarked x[n] = generate random array;
image more imperceptible and highly resistant to a wide if visual masking = enabled then
range of attacks. Further, Neural networks are used to extract D = cast image with x;
watermark out of the distorted image as shown in Fig. 2. visualization[boxsize]=1;
end if
Algorithm 1 Watermarking using DCT (PART I) else {inputimg < required size}
Require: inputimg : original image resize image;
k : watermark end if
outputimg : watermarked image by k. return encoded image D;
while setup do end while
start encoding model;
if inputimg > required size then Algorithm 3 Extracting watermark using neural networks
start encoding model: (PART III)
image encoding process starts; Require: inputimg : distorted image, difference image;
read original image; outputimg : image, watermark;
compute variations in image; while setup do
compute size and array matrix of image; start decoding model;
A = apply DCT to original image; image decoding process starts;
read watermark image; read distorted image;
B = apply DCT to watermark image; if distortion > n then
else {inputimg < required size} apply correction filter;
resize image; else {distortion < n}
end if check DWT rule;
C = combine A and B; apply neural network[hidden stage one];
return C; compare difference image;
end while apply neural network[hidden stage two];
end if
return image;
A. Algorithm part I: Discrete Cosine Transform return watermark;
The first part of the algorithm consists of a DCT system end while
which applies watermark into the mid-frequency coefficients
of the image. Considering the above represented ’Algorithm
1’, The original image [Fig. 3(a)]to be encoded is fed into the to the watermarked image. It should be noted at this stage
system. A watermark in Fig. 3(b) is then initialized. While the that the watermark being embedded in this stage is a visible
embedding is initialized, the system first computes variations watermark. The obtained result of visible watermarked image
in the original image. Secondly, once the variations have is shown in Fig. 3(c).
stored the size and array matrix of the image is computed.
Discrete Cosine Transform is then applied to the original B. Algorithm part II: Discrete Wavelet Transform
image. Further, the watermark image is initialized and resized The second part of the algorithm is the Discrete Wavelet
to the suitable size of the original image. DCT is then applied Transform system. The system encodes the image with an
to the watermark image. Now, both transformed images of invisible, randomly generated watermark. The DWT system
original and watermark are combined during the final encoding is known to embed every discrete wavelet of the image
process. after the encoding is finished, Inverse DCT is applied separately. Initially, the wavelet variations of the watermarked

Authorized licensed use limited to: Consortium - Algeria (CERIST). Downloaded on December 08,2022 at 17:37:29 UTC from IEEE Xplore. Restrictions apply.
2020 International Conference on Artificial Intelligence and Signal Processing (AISP)

Fig. 2. Extraction process of watermarked image.

Fig. 3. Stage by stage obtained results. (a)Original image; (b)Watermark image for DCT; (c)DCT watermarked image; (d)DWT watermarked image;
(e)Subtracted difference image; (f)Distorted image; (g)Extracted image; (h)Extracted watermark.

image from the ’Algorithm 1’ is computed. It should be noted original image. Fig. 3(f) shows the distorted image which will
that the original image for this algorithm will be the visible be considered for the extraction of the watermark. During the
watermarked image from the previous algorithm. Once the size extraction of the watermark, the image is filtered to correct the
of the image is set, the DWT operation is applied. The lowest distortion to some extent. The DWT watermark is checked for
coefficient of the DWT is calculated and is stored in a variable. presence according to the rule set in ’Algorithm 2’. The DWT
Further, the system generates a random array following a watermark is then extracted if present through first hidden
pre-specified rule. This rule will later be considered while stage of the neural network. The subtracted image Fig 2(e)
extracting the watermark in the next algorithm. Once the is then used to compare the pixels. Once the pixels of the
random array is ready, the process of visual masking is distorted image is compared with subtracted image pixels, the
initiated. This is the step wherein the random key will be cast watermark can be extracted by the second hidden layer of the
into the image to give the watermarked image. The condition neural network. Thus the visible watermark is extracted. Fig
that if the visual masking is enabled, the visualization with 3(g) and Fig 3(h) show, the extracted original and watermark
block size is set to high. Similarly low for the contrary. The images.
output of this stage is shown in Fig. 3(d). The performance of the proposed algorithm is checked to
verify its effectiveness. The algorithm was applied to a famous
C. Algorithm part III: Extracting the Watermark using neural image, Lena and output at each stage were recorded. The
network hybrid algorithm is found to be effective in watermarking and
Even before the watermark can be extracted, it is important extracting the watermark after the distortion. As the proposed
to differentiate the original and the watermarked image. This algorithm uses two sets of discrete transform techniques to
has to be done to check the strength of the watermarked embed two distinguished watermarks into the image, the wa-
image compared to the original image. The subtraction of termark is found to be resistive to most of the possible attacks.
the original image from the watermarked image was done Further, the neural network works phenomenally in extracting
in this regard. Fig. 3(e) shows the difference image where the watermark without the need of original image.However, the
every white pixel is the varied pixel when compared to the quality of the image obtained after extraction is found to be

Authorized licensed use limited to: Consortium - Algeria (CERIST). Downloaded on December 08,2022 at 17:37:29 UTC from IEEE Xplore. Restrictions apply.
2020 International Conference on Artificial Intelligence and Signal Processing (AISP)

reduced. Finally, the quality and consistency of the algorithm [12] A. M. Zeki, A. Abubakar and H. Chiroma, ”Investigating Digital Water-
has to be analysed. mark Dynamics on Carrier File by Feed-Forward Neural Network,” 2013
International Conference on Advanced Computer Science Applications
and Technologies, Kuching, 2013, pp. 162-165.
IV. C ONCLUSION [13] C. He, ”Research of Web Resources Protection Based on Digital
Watermarking and Digital Signature,” 2016 International Conference on
A hybrid algorithm was developed and proposed to digi- Intelligent Networking and Collaborative Systems (INCoS), Ostrawva,
tally watermark image. The systems uses two techniques to 2016, pp. 294-297.
[14] Y. Goto and O. Uchida, ”Digital Watermarking Method for Printed Mate-
produce a strong watermark. Discrete cosine transform is first rials Embedding in Hue Component,” 2009 Fifth International Conference
applied to obtain the visible watermarked image. Further, the on Intelligent Information Hiding and Multimedia Signal Processing,
discrete wavelet transform is applied to embed an invisible Kyoto, 2009, pp. 148-152.
[15] S. Kumar and A. Dutta, ”A study on robustness of block entropy based
watermark into the image. This hybrid technique makes the digital image watermarking techniques with respect to various attacks,”
watermark strong and effective. On the other hand, extraction 2016 IEEE International Conference on Recent Trends in Electronics,
of watermark and the original image was also carried out using Information Communication Technology (RTEICT), Bangalore, 2016, pp.
1802-1806.
an extraction algorithm using a two stage neural network. [16] Q. Wang, F. Sun and F. Liu, ”Research on public-key digital watermark-
It was found in later stages of output that the extracted ing system,” 2011 IEEE 3rd International Conference on Communication
image has retarded image quality when compared to the input Software and Networks, Xi’an, 2011, pp. 158-162.
[17] Z. Peng, Z. Xue-fang and Z. Ming-sheng, ”An Approach to Anti-
image. Further, stronger techniques have to be developed in counterfeit of Identity Document Based on Digital Watermarking and
the future. An extensive realization revealed that the use of Digital Signature,” 2010 International Conference on E-Business and E-
neural networks gives appreciable results. With the advent of Government, Guangzhou, 2010, pp. 3653-3655.
[18] S. C. Ramesh and M. M. I. Majeed, ”Implementation of a visible
Deep learning, Deep Neural Networks [DNN] will be explored watermarking in a secure still digital camera using VLSI design,” 2009
to encode and decode the watermark in the future works. European Conference on Circuit Theory and Design, Antalya, 2009, pp.
798-801.
[19] S. C. Ramesh and M. M. I. Majeed, ”Implementation of a visible water-
ACKNOWLEDGMENT marking in a secure still digital camera using VLSI design,” AFRICON
2009, Nairobi, 2009, pp. 1-4.
The authors would like to express their gratitude to JNTUA, [20] G. Xiuhui and T. Hao, ”Research on Application of Reversible Digital
Ananthapuramu for providing the necessary infrastructure to Watermark Algorithm,” 2008 International Conference on Computer
carry out this work. Science and Software Engineering, Hubei, 2008, pp. 810-813.
[21] Weiguo Zhao, Ziyong Zhai and Zijun Wang, ”Digital watermarking
algorithm based on block singular value decomposition and BP network,”
R EFERENCES 2010 Chinese Control and Decision Conference, Xuzhou, 2010, pp. 2503-
2508.
[1] N. Bhargava, M. M. Sharma, A. S. Garhwal and M. Mathuria, ”Digital [22] Q. Guo, Y. Zhao, P. Cheng and W. Guo, ”An air channel digital audio
image authentication system based on digital watermarking,” 2012 Inter- watermarking algorithm based on DCT domain,” 2012 2nd International
national Conference on Radar, Communication and Computing (ICRCC), Conference on Consumer Electronics, Communications and Networks
Tiruvannamalai, 2012, pp. 185-189. (CECNet), Yichang, 2012, pp. 853-856.
[2] W. Hsieh and P. Lin, ”Analyze the Digital Watermarking Security [23] S. P. Mohanty, N. Ranganathan and R. K. Namballa, ”A VLSI archi-
Demands for the Facebook Website,” 2012 Sixth International Conference tecture for visible watermarking in a secure still digital camera (S/sup
on Genetic and Evolutionary Computing, Kitakushu, 2012, pp. 31-34. 2/DC) design (Corrected)*,” in IEEE Transactions on Very Large Scale
[3] G. Voyatzis, N. Nikolaidis and I. Pitas, ”Digital watermarking: An Integration (VLSI) Systems, vol. 13, no. 8, pp. 1002-1012, Aug. 2005.
overview,” 9th European Signal Processing Conference (EUSIPCO 1998), [24] I. Echizen, S. Singh, T. Yamada, K. Tanimoto, S. Tezuka and B.
Rhodes, 1998, pp. 1-4. Huet, ”Integrity Verification System For Video Content By Using Digital
[4] H. Chaoju and W. Xuning, ”Zero Watermark Protocol Based on Time- Watermarking,” 2006 International Conference on Service Systems and
Stamp and Digital Signature,” 2009 International Forum on Information Service Management, Troyes, 2006, pp. 1619-1624.
Technology and Applications, Chengdu, 2009, pp. 193-196. [25] T. Sasaki and T. Nagase, ”Constructing Digital Watermark Based on
[5] Sharma, Swati, et al. ”Digital Image Watermarking using Machine Orthogonal Functions,” 2018 5th IEEE International Conference on Cyber
Learning Techniques: A Technical Review.” Security and Cloud Computing (CSCloud)/2018 4th IEEE International
[6] W. Zhang, J. Meng and C. Ma, ”Research progress of applying digital wa- Conference on Edge Computing and Scalable Cloud (EdgeCom), Shang-
termarking technology for printing,” 2018 Chinese Control And Decision hai, 2018, pp. 140-143.
Conference (CCDC), Shenyang, 2018, pp. 4479-4482. [26] Xingyang Zhao and Jiyin Sun, ”A novel third party’s double watermark-
[7] Jian Zhang, ”A Web Services-based security model for digital water- ing scheme reject to malice attack,” 2009 IEEE International Conference
marking,” 2011 International Conference on Multimedia Technology, on Network Infrastructure and Digital Content, Beijing, 2009, pp. 1018-
Hangzhou, 2011, pp. 4805-4808. 1022.
[8] M. S. Goli and A. Naghsh, ”Introducing a new method robust against [27] J. Zhou and M. Pang, ”Digital watermark for printed materials,” 2010
crop attack in digital image watermarking using two-step sudoku,” 2017 2nd IEEE InternationalConference on Network Infrastructure and Digital
3rd International Conference on Pattern Recognition and Image Analysis Content, Beijing, 2010, pp. 758-762.
(IPRIA), Shahrekord, 2017, pp. 237-242. [28] R. Xie, K. Wu, J. Du and C. Li, ”Survey of Public Key Digital Wa-
[9] Zhang Wen and Jiang Meng, ”The research of algorithm for Electronic termarking Systems,” Eighth ACIS International Conference on Software
Seal System based on digital watermark Technology,” 2011 International Engineering, Artificial Intelligence, Networking, and Parallel/Distributed
Conference on Electric Information and Control Engineering, Wuhan, Computing (SNPD 2007), Qingdao, 2007, pp. 439-443.
2011, pp. 4650-4652. [29] J. Xie and Q. Qin, ”Study of image digital watermarking algorithm and
[10] M. A. Qadir and I. Ahmad, ”Digital text watermarking: secure content robustness based on the wavelet transform techniques,” 2010 2nd IEEE
delivery and data hiding in digital documents,” Proceedings 39th Annual International Conference on Information Management and Engineering,
2005 International Carnahan Conference on Security Technology, Las Chengdu, 2010, pp. 529-532.
Palmas, 2005, pp. 101-104. [30] R. M. Prasad and S. Koliwad, ”A robust wavelet-based watermarking
[11] L. Zhu and L. Zhu, ”Electronic signature based on digital signature and scheme for copyright protection of digital images,” 2010 Second In-
digital watermarking,” 2012 5th International Congress on Image and ternational conference on Computing, Communication and Networking
Signal Processing, Chongqing, 2012, pp. 1644-1647. Technologies, Karur, 2010, pp. 1-9.

Authorized licensed use limited to: Consortium - Algeria (CERIST). Downloaded on December 08,2022 at 17:37:29 UTC from IEEE Xplore. Restrictions apply.

You might also like