Kingdome of Saudi Arabia

Ministry of Higher Education

Princess Nora Bint Abdul Rahman University
Faculty of Computer & Information Science

TRANSMISSION OF HOMOMORPHIC IMAGE WATERMARKING

WITH SVD ALGORITHM THROUGH THE CHANNEL
Amnh Abdulhameed , Bashair Al-Garni , Maryam Al-Mutairi , Mashael AL-Sakhabrah , Wafa Al-Malki.

Abstract:
In this paper, a new homomorphic image watermarking method implementing the Singular Value
Decomposition (SVD) algorithm is presented. The idea of the proposed method is based on embedding
the watermark with the SVD algorithm in the reflectance component after applying the homomorphic
transform. The reflectance component contains most of the image features, but with low energy, and
hence watermarks embedded in this component will be invisible. A block-by-block implementation of the
proposed method is also introduced. The watermark embedding on a block-by-block basis makes the
watermark more robust to attacks. A comparison study between the proposed method and the traditional
An SVD watermarking method is presented in the presence of attacks. The proposed method is more
robust to various attacks. Also ,investigated in this paper to increase the level of security.

Keywords: Image watermarking, Homomorphic transforms, SVD, Wavelet transforms

1. Introduction:
The spreading of digital multimedia nowadays has made copyright protection a necessity. Authentication
and information hiding have also become important issues. To achieve these security requirements,
watermarking technology can be used. Watermarking means embedding a piece of information into a
cover signal or image in such a way that it is imperceptible to a human observer, but is easily detectable
by a computer or a detector. Several researchers have worked in the field of watermarking for its
importance. The work in this field has led to several watermarking techniques such as the correlationbased techniques, the frequency-domain techniques, and the wavelet-domain techniques.

2. Problem statement:
In the modern digital world we face an immense challenge in discouraging unauthorized copying and
distributing of electronic documents. Previously in order to identify the source or creator of a material we
have used signatures, seals or watermarks. However, in todays world digital technology for manipulating
images has made it difficult to distinguish the visual truth. One existing solution is embedding digital
watermarks into the images to claim the ownership.
This technique of watermarking can then be extended to protect the privacy of individuals based on the
individuals choice. Many scientists discussed and studied the multiple ways of embedding watermark on
the image, but mostly have been ineffective and do not achieve a high level of security which is important
thing they are needed.
In this project, we will use our method to be more Robust than the other ways and increase efficiency,
quality and the level of security after embedding watermark on image.
One of the biggest problems is when they send an image on the channel it receive for the recipient with
noise or some attack happen and sometime with cropping. So, that makes the image fragile .[1]
In addition, we will study the attacks that affect the watermarked image. Attacks on the watermarking
security can be mainly divided in two categories active (unauthorized embedding and unauthorized
removal) and passive (i.e., Unauthorized detection). An active attack attempts to alter the watermarking
resources or to affect their operation, whereas a passive attack, without doing that, attempts to know or
exploit watermarking information. Also, sometimes there is an attack can be roughly defined any
malicious attempt to perform unauthorized embedding, removal, or detection of a (valid or invalid)

watermark this is called Additive noise attack. Another type of attack is Cropping attack. It is to remove
several parts of the image to destroy an embedded watermark. [2]
The security of watermarking is a demanding matter in watermarking community digital, although has
been sophisticated for protecting digital media, the embedding and extraction processes are complete on
the normal media, Therefore the watermark embedded must be the owner of the authentic medal or a
trusted third party. The homomorphic cryptosystems supply an appropriate way for secure signal
processing, since they keep the algebraic relations among the plaintext after encryption. When there is a
union between watermarking, homomorphic and block by block SVD We expect to get the watermark
more robust to attacks.
The problem is important because before the emergence of digital image watermarking, it was difficult to
achieve copyright protection, authentication, and data hiding, but now it is easy to achieve these goals
using watermarking techniques. Each watermarking technique consists of an embedding algorithm and a
detection algorithm, also, it is shown that in the case for using invisible watermarks for resolving rightful
ownership, uniqueness problems arise due to the data detection process irrespective of the data
embedding process. Therefore, there is a real and immediate need to develop reliable, efficient, and robust
detectors for digital watermarking applications and to increase the level of security.

3. Related work:
-

Watermarking Domains:

Spatial Domain:
The most straightforward approach for hiding a watermark is to modify the host image pixel values,
directly. Although spatial domain techniques are easy to implement, they are, in general, not as robust as
transform domain techniques. An advantage of the spatial domain is that they can be easily applied to any
image, regardless of subsequent processing. A possible disadvantage of the spatial domain techniques is
that they do not allow the exploitation of this subsequent processing in order to increase the robustness of
the watermark .[3]
The commonly used method is the least significant bit (LSB).
LSB:
LSB embedding is the earliest and also the simplest spatial domain embedding technique. In this
technique, the watermark is embedded into the LSB of the cover object. Given the extraordinarily high
channel capacity by using the entire cover for transmission in this method, a smaller object may be
embedded multiple times. Even if most of these are lost due to attacks, a single surviving watermark
would be considered a success. [4]

 Frequency (transform) Domain:

Most of the transform domain techniques embed the information into the transform coefficients of the
cover image. [4] Three popular transforms are used for this purpose. They are the DFT, the DCT, and the
DWT. After the modification of the coefficients, the image is converted back into the spatial domain. This
procedure needs a certain amount of computation, but it has more potential to prevent watermarks
destruction by a malicious attack. Taking these aspects into consideration, working in transforming
domains becomes very attractive.
The commonly used methods is the Discrete Wavelet Transform (DWT) and Discrete Cosine Transforms
(DCT).
DWT:
Another possible domain for watermark embedding is the DWT. The DWT separates an image into a
lower resolution approximation image (LL) as well as horizontal (HL), vertical (LH), and diagonal (HH)
detail components .[5]
This process can then be repeated to compute multiple scale wavelet decomposition, as in the scale 2
DWT. [6]
The strengths of this technique are, we dont need to divide the input coding into non-overlapping 2-D
blocks, it has higher compression ratios avoid blocking artifacts. Also, it allows good localization both in
time and the spatial frequency domain. Another thing is the transformation of the whole image,
Introduces inherent scaling and it is Better identification of which data is relevant to human perception
higher compression ratio.
In addition, it has higher flexibility: Wavelet function can be freely chosen. A possible drawback of the
DWT techniques is that the cost may be higher compared to DCT and the use of larger DWT basis
functions or wavelet filters produces blurring and ringing noise near edge regions in images/ video
frames. Also, compression time is longer and it has Lower more quality than JPEG at low compression
rates .[7]
DCT:
The DCT allows an image to be broken up into different frequency bands, making it much easier to
embed watermark information into the middle frequency bands of the image. The middle frequency bands
are chosen, because they avoid the most visual important bands of the image; the low frequencies and the
high frequencies. [8]
The advantage of using DCT is the hiding via a DCT is useful, as someone who just looks at the pixel
values of the image would be unaware that anything is amiss. Also the hidden data can be distributed
more evenly over the whole image in such a way as to make it more robust. One technique hides data in
the quantize staging. In this way a large image can store some data that are quite difficult to detect in it.

4. System design and analysis:

System Architecture:
The proposed tool implements watermarked image concept, using available hardware and software. It
does not require any database or web server.
The aim of the tool is to apply and facilitate embedding and extracting process is shown in the Flow Chart
below.

System Flow Chart:

This is a flow chart to show the steps of

how to embed the watermark on the cover
image.

This is a flow chart to show the steps of

how to extract the watermark from the
watermarked image.

5. Results and future work:

Result:

embed

Cover image

extract

Watermark image

,
Recovered watermark
(SVD)

Watermarked image

,
Recovered watermark
(SVD with block by block )

Recovered watermark
(SVD with homomorphic )

 Result :

Cover image

Watermark
image

Watermarked
image

Recovered
Watermark

Peake
signal
to noise
ratio

Correlation

53.24dB

Cr= 0.9968

7.63dB

Cr= 0.9620

10.44dB

Cr= 0.9847

12.37dB

Cr=0.8241

Rotation =30

Cropping

Gaussian
noise=0.01

 Future work:
In the future we have a lot of ideas to develop our project by creating mobile applications for
IOS and Android system supported multiple languages and we expand to other types of
watermark.

6. Conclusion:
This paper presented a homomorphic image watermarking method using the SVD algorithm. By
embedding a watermark with the SVD algorithm to the reflectance component of an image, we
guarantee that the effect of the watermark on the image is multiplicative not additive. That is
why watermarking in the homomorphic domain survives digital signal processing attacks.
Simulation results have shown that the block-by-block SVD watermarking in the homomorphic
domain has high fidelity, robust, and detectability under attacks.We have come to the conclusion
that permutation-based algorithms can be used efficiently for this purpose to increase the level of
security.

7. Reference:
[1] G. Kaur, K. Kaur, "Digital Watermarking and Other Data Hiding Techniques", International
Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075,
Volume-2, Issue-5, April 2013
[2] B. Ram, "Digital Image Watermarking Technique Using Discrete Wavelet Transform And
Discrete Cosine Transform", International Journal of Advancements in Research & Technology,
Volume 2, Issue4, April-2013
[3] P.Porwal ,T.Ghag , N.Poddar , A.Tawde , Digital Video Watermarking Using Modified Lsb
And Dct Technique , International Journal of Research in Engineering and Technology , vol.
03, no. 04, pp. 630-634, 2014.
[4] Puneet Kr Sharma and Rajni, "Analysis Of Image Watermarking Using Least Significant Bit
Algorithm ", International Journal of Information Sciences and Techniques (IJIST) Vol.2, No.4,
July 2012
[5] X. Feng and Y. Yang, "A New Watermarking Method Based on DWT", School of Science,
Xidian University, 710071 Xian, China
[6] M.Hasija , A.Jindal , Contrast of Watermarking Techniques in different domains ,
International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 2, May 2011
[7] A Survey Gupta, Sheenu; Shukla, Manshi , Reviews On Watermarking Techniques ,
International Journal of Computer Science and Network Security (IJCSNS) 15.6 (Jun 2015): 3943.
[8] D.Mistry, "Comparison of Digital Water Marking methods", (IJCSE) International Journal
on Computer Science and Engineering Vol. 02, No. 09, 2010, 2905-2909