Analysis of Current FPGA-Based Image Watermarking Attempts: Taha Basheer Taha, Ehkan Phaklen and Ngadiran Ruzelita
Analysis of Current FPGA-Based Image Watermarking Attempts: Taha Basheer Taha, Ehkan Phaklen and Ngadiran Ruzelita
Analysis of Current FPGA-Based Image Watermarking Attempts: Taha Basheer Taha, Ehkan Phaklen and Ngadiran Ruzelita
Indian Journal of Science and Technology, Vol 9(33), DOI: 10.17485/ijst/2016/v9i33/88449, September 2016 ISSN (Online) : 0974-5645
Abstract
Objective: Analysing of current FPGA-based image watermarking attempts to figure out the future requirements for such
systems. Analysis: Hardware-based watermarking systems have been studied according to their performance in time,
frequency and robustness measurements. A comparison has been made among current systems in terms of robustness,
image quality achieved and system performance. Findings: Image watermarking was a very demand area of research in
last decades, but hardware based attempts of image watermarking are still few in compare with software implementations
although many modern systems nowadays rely on hardware-based real time algorithms. For their flexibility and
reprogrammable nature, Field Programmable Gate Arrays (FPGAs) where adopted by many researchers for implementing
watermarking hardware algorithms in cases where the need of high speed computations is a critical requirement. We
find that many current watermarking schemes need to combine the required watermarking features as image quality
measurements, using real size images, adaptable designs, and using FPGA features in using parallel high performance
systems.
techniques. Section 6 is analysing current works and watermarked image and/or secret key and/or original
list future requirements. Last but not least, section 7 is a image7. The watermarking algorithm which uses the orig-
conclusion of survey. inal image to extract the watermark is called non blind,
while blind watermarking relies on watermarked image
only8.
2. General Image Marking Process
Image watermarking is the process of inserting watermark 3. Watermark Requirements
pixels to original (host) image in a way that is still hidden
(for invisible watermarking schemes) while in the same Before designing or developing a watermark system, the
time, it has a security by which only authorized people requirements of a system must be studied as the impor-
can extract it. The process of adding watermark pixels to tance of each requirement shapes the system design and
the host image is called embedding scheme (Figure 1), its methodology. The five common watermarking require-
and on the other hand the process of extracting hidden ments are as follow9
watermark pixels from the watermarked image is called i. Robustness
extracting process (Figure 2)7. Robustness is the ability to detect the watermark after
Inputs for the watermarking embedding scheme are unintended or intended distortion on watermarked data.
original image, watermark and optionally the secret key, However, this requirement is desirable in robust water-
which is used to enforce security in watermarking system. marking systems only. Since in fragile watermarking
A watermark may be an image, text or sequence number. systems with authentication duty, any data modification
Embedding scheme produces watermarked image as an is detected by the watermark damage. Hence, no need for
output. The decoding or extracting scheme inputs are robustness in such systems.
ii. Invisibility
Invisibility is to hide the watermark in a way that it can-
not be observed by Human Visual System (HVS). This
requirement is essential for invisible watermarking sys-
tems where the watermark is not preferred to be visible on
host data. A similar word for invisibility is fidelity, which
is the perceptual similarity between the host and water-
marked data.
iii. Data Payload
Data payload is the number of embedded watermark
bitswithin the original data. That number should uniquely
Figure 1. Watermark embedding scheme. definesthe copyright of the image. Possible attacks and
distortions must be taken into consideration while choos-
ing the data payload.
iv. Simplicity
Watermarking system must be as simple as possible,
especially while working on real time systems, where the
hardware resources are limited and the required process-
ing time is short.
v. Real-time
Although this requirement is not mentioned frequently,
but it is crucial feature in applications where no delay
is permitted between capturing data and watermark
embedding. Example of these are real time broadcasting
Figure 2. Watermark extracting scheme. and camera system in courtroom evidence10. Hardware
2 Vol 9 (33) | September 2016 | www.indjst.org Indian Journal of Science and Technology
Taha Basheer Taha, Ehkan Phaklen and Ngadiran Ruzelita
Vol 9 (33) | September 2016 | www.indjst.org Indian Journal of Science and Technology 3
Analysis of Current FPGA-Based Image Watermarking Attempts
noise, image sharpening, and compression. The next ii. Transform Domain Attempts
attempt by18 was done using a spread spectrum utilizing a In general, transform or frequency based watermarking
binary watermark. The conversion from integer to binary schemes are resisting to some attacks and immune too
is done by Matlab. The size of the watermark was (64*64) many alterations20, but the disadvantage of such systems is
while the cover image was in (256*256). The required the complexity and high resource consuming. Developers
number of slices was 959 with a frequency of 82.26MHz. usually try to find the possible ways to economize in their
Detailed measurements of PSNR, MSSIM, normalized resources as floating number redemption or pipelining.
correlation, and mean absolute error are given for the One of the earliest FPGA-based frequency watermark-
extracted watermark but not for the original image. The ing attempts was done by21 when they presented a robust
using of real size host image and watermark is a good step image watermarking scheme on image and video by using
in watermarking, since visible and invisible watermarking Altera Stratix II FPGA. They utilized Discrete Wavelet
techniques are required to clearly express authentication Transform (DWT) for their work with pipelined 2D-Scan
of owners. For instance, if you meant to add a TV logo, based architecture running at maximum frequency of
you would think of an image as watermark more than a 100 MHz with PSNR equal to 31dB. However the extrac-
random number. tion process was not explained and no attack had been
Image to image communication algorithm is speci- presented to measure robustness21.
fied by6 in which the aim was to achieve distortion free 3
Proposed Spread Spectrum (SS) watermarking
communication while the original data still unaltered. scheme with two major features, first is dual watermark-
However, this attempt differs from the formers in that ing duties, one for integrity(robust watermark) and other
there is less care on carrier image quality (host image qual- for authentication purpose (fragile watermark). This had
ity) which is utilized as a high frequency carrier signal in done by embedding more than one watermark in each
digital communication, hence no quality measurements image block. Second feature was employing the watermark
values were given. for QoS measurements to check channels conditions. For
A novel six level pipelined watermarking architecture frequency transformation, Walsh transform had been
proposed by2 in spatial domain were using Reversible used while maximum frequency obtained was 80 MHz
Contrast Mapping (RCM). In this attempt, the least sig- with number of 730 Configurable Logic Blocks (CLB) for
nificant bit (LSB) is used for embedding the data after XCS40 and XCS40L chips while a gray scale image of (8*8)
applying simple integer transform on two adjacent pixels. was used to embed 4 bits watermark signal. PSNR for the
Here, watermark pixels can be reconstructed even if the watermarked image is 41.08. For authentication purpose,
LSB is lost, by one exception when the two pairs are in watermark has been tested and the alteration reflected
odd values. Two architectures are used here one for (8*8) on the watermark blocks. However, no attacks are listed
block size image and other for (32*32) with watermark for robustness evaluation. By using 4 bits as watermark
of (8*4) or (32*16) pixels. PSNR values were 29.46 dB that means there are only 16 possible watermarks may be
and 30.41 dB for Lena and Boat images, respectively. A created as identical case.
total of 9881 slices were needed for (32*32) bit architec- Xingfu Wang et.al22 proposed Discrete Cosine
ture with operating frequency up to 98.6 MHz, no attacks Transform (DCT) scheme to embed the random series
measurements are shown in this work. watermark into host image, with bit error rate (BER) of
As a general notice of time domain watermarking 5%, in this work but no quality measurement is listed for
attempts, simplicity and low overhead design can be watermarked image. However, artifact which is one of the
noticed as well as real time achievement. However, we major issue in DCT transformations were noticeable on
may see in many attempts the watermark implemented the watermarked image. The IDCT is done by transfer-
by a set of random sequences, not real images, although ring the watermarked data to another board connected
the watermark can be extracted here, there must be via RS23222.
enough bits to uniquely define ownership19. Moreover, 20
Developed reversible (Lossless) watermarking algo-
attacks in many cases are either not measured, or limited rithm, they tried to achieve maximum embedding rate
to traditional ones. As a result, many researchers meant and robustness using integer wavelet transform. The
to use frequency or dual domain for their watermarking PSNR was 31.37 for embedding capacity of 27% and up
systems. to 4 watermark bits have been embedded per coefficient.
4 Vol 9 (33) | September 2016 | www.indjst.org Indian Journal of Science and Technology
Taha Basheer Taha, Ehkan Phaklen and Ngadiran Ruzelita
The Xilinx Spartan 3 FPGA was used with frequency up easurements values are listed. Components of the
m
to 62.073 MHz. Modelsim was used for simulation, but security keys were the original image size, wavelet trans-
the input image was a text file previously converted by form filters and the channel in which watermark is
Matlab programming environment which means the embedded, however, these factors could be easily deter-
system needs extra software support to be implemented. mined. No results for FPGA was shown26. DCT based
This, as a result, may negatively affects real time imple- approach has developed by Khoshki et.al. where auto
mentation requirement20. code generation is utilized with the help of Matlab and
An adaptive watermark system has been proposed Altera DSP builder. The code downloaded to DE2-115
by Chen Feifei et.al23 in 2012, the system is adaptive Cyclone IV FPGA27. Nallathambi, B. and Karthigaikumar,
according to image format whether it is BMP or JPEG. P. (2014) fuse Iris images and fingerprint to create the
In case of JPEG, the image is decoded into BMP before secret key, they utilized and compared DWT, DCT and
applying watermarking algorithm. Host data is a col- LSB which is spatial approach28. The comparison is done
ored image of BMP or JPEG format with PSNR between according to different attacks. However, Attacks’ factors
(66.9152 - 77.7584) while the watermark is a binary are not mentioned, for example, different noise ratio gives
image. No objective quality measurements are shown different PSNR and also the ratio of JPEG compression
for extracted watermark but subjectively, watermark was yields different results while differentiating between one
not identical but could be recognizes even after cropping algorithm and another3.
attack23. Koushik and Mahanta et.al4 (2014) proposed Message
DWT based watermarking technique for colour and State Indicator (MSI) number based image watermarking
gray scale images had been used by24 in 2012 and (256*256) architecture which relied on Walsh transform. The water-
of watermark image was used. This paper mentioned the mark can be extracted by MSI number which is generated
reason beyond using the robust watermark to overcome in embedding process. Walsh transform has been applied
issues like the high power consumption and large area for both host and watermark images. Results shows the
requirements, however for most researcher’s opinion that watermark is successfully extracted but no numeric qual-
is not the core reason to use robust watermark, since it is ity measurements are listed. In this work, watermark
used for copyright protection and confirm ownership9. No cannot be recovered in case of MSI damage4.
attacks are listed and the results show the watermark had As general scope of Transform-based image water-
been distorted after extraction. High frequency achieved marking on FPGA devices, high image quality values
by hitting frequency of 344MHz. Images is converted to could be achieved, hence more robustness. More bits are
bits using Simulink before it processed by FPGA. That’s used to construct watermark data which it is mostly an
again, affects the real time requirement and it may be a image represents owner’s logo. However, designs are more
reason that help to obtain a high frequency since not all complicated and in many cases not all the watermarking
steps are achieved using FPGA24. processes is done by hardware while researchers in some
DWT also used by A.D. Darji et.al25 when they pre- cases rely on software to apply image conversion or even
sented a new pipelined, blind FPGA-based watermark frequency transformation. Some researcher attempted to
approach using quantization method. A gray scale image mix the advantages of time and frequency domains so
is used as host image and a binary image is used as water- they used dual mode watermarking architectures.
mark. For the parallel architecture, a maximum frequency
obtained is 29.017 MHz while in pipelined approach iii. Dual Domain Watermarking Schemes
is 97.507 MHz. PSNR for the watermarked image was Amit M Joshi et.al10 (2011) used both bit slicing scheme
44.408 dB while a range of (30-45) dB after attacks was (Spatial) and DWT (Frequency) to develop their water-
given. They compared this range with21 which is a video- marking algorithm. The approach applied lifting wavelet
image approach. It is important to mention that not all transform (to reduce the computations of wavelet con-
the steps for the algorithm were done by FPGA hardware, volutions) on (64*64) host image and applied bit space
but DWT, IDWT and the extraction processes had been slicing on the low frequency band (LL) in DWT. A binary
performed using Matlab25. watermark which is the output of LFSR is embedded on
S. Kiran et.al26 used the mid frequencies of Haar LSB plane. It required number of slices 1078 and max fre-
DWT domain to embed watermark bits. No quality quency obtained on XC4VLX25-10FF676 FPGA Virtex
Vol 9 (33) | September 2016 | www.indjst.org Indian Journal of Science and Technology 5
Analysis of Current FPGA-Based Image Watermarking Attempts
6. Analysis
From the variety of measurements found in literature,
two common and most mentioned factors are listed in
Figures 3 and 4, PSNR and Frequency results respectively.
6 Vol 9 (33) | September 2016 | www.indjst.org Indian Journal of Science and Technology
Taha Basheer Taha, Ehkan Phaklen and Ngadiran Ruzelita
is mentioned instead of CLBs, LE in Cyclone III device comprehensive research aspects and results which clarify
family has a four-input LUTs, programmable registers readers’ doubts. Some of the features which are absent in
and set of connectors30. many FPGA-based watermarking schemes are listed as
Another aspect is the disparity of hardware while using follow
different types of images, coloured, grayscale, or binary
images, for example, five multipliers and six adders are • Robustness against Basic Geometric Attack (Scaling,
needed to convert RGB image to YCbCr image31. YCbCr Rotation Cropping).
conversion is a middle step for applying image conver- • Adaptable Algorithm.
sion operations such as time domain to DCT frequency • 2D-Images are utilized as watermark data.
domain, these resources are not required while using • Dual purpose scheme (Robust and Fragile)
grayscale or binary images. • Quality measurements (PSNR, MSE or any others)
While comparing with software watermarking • Pipelined design (For maximum system utilization).
attempts, there are huge difference in number of works
achieved in hardware and software. Maybe the number Table 2 lists the existence of these features in literature
is not the only factor, many FPGA-attempts lack that attempts.
21 FREQ - - -
3 FREQ - - - - -
22 FREQ - - - - -
20 FREQ - - - - -
JPEG-BMP
23 FREQ Cropping Only - -
Adaptable
24 FREQ - - - - -
Attacks as general are
25 FREQ - -
mentioned
26 FREQ - - - - -
27 FREQ - - - - -
YES (without Specifying
28 FREQ - Biometric Data - -
attacks’ value)
Mentioned it is robust
4 FREQ against attacks without - - - -
numbers
Within Lifting
10 Dual Mode - - - -
based DWT
14 Dual Mode - - - -
Vol 9 (33) | September 2016 | www.indjst.org Indian Journal of Science and Technology 7
Analysis of Current FPGA-Based Image Watermarking Attempts
8 Vol 9 (33) | September 2016 | www.indjst.org Indian Journal of Science and Technology
Taha Basheer Taha, Ehkan Phaklen and Ngadiran Ruzelita
22. Wang X, Qin Q, Cheng Y. Design and Implementation of Conference on Current Trends in Engineering and
Digital Image Watermark Based on FPGA. Heidelberg: Technology (ICCTET). 2013; p. 323–25.
Springer Berlin: Recent Advances in Computer Science and 27. Khoshki RM, Oweis S, Wang S, Pappas G, Ganesan S.
Information Engineering. 2012; p. 223–29. FPGA Hardware Based Implementation of an Image
23. Feifei C, Yuhui L, Bo L, Yu L. FPGA-based adaptive image Watermarking System. International Journal of Advanced
watermark embedding method and implementation. Research in Computer and Communication Engineering.
Shenzhen: IET International Conference on Information 2014; 3(5):6400–05.
Science and Control Engineering, ICISCE 2012. 2012; p. 28. Nallathambi B, Karthigaikumar P. FPGA implementa-
1–4. tion of hiding information using cryptographic key.
24. Karthigaikumar P, Baskaran K. FPGA Implementation Coimbatore: 2014 International Conference on Electronics
of High Speed Low Area DWT Based Invisible Image and Communication Systems (ICECS). 2014; p. 1–5.
Watermarking Algorithm. Procedia Engineering. 2012; 29. 7 Series FPGAs Configurable Logic Block. Date accessed
30:266–73. 17/11/2014: Available from: http://www.xilinx.com/sup-
25. Darji AD, Lad TC, Merchant SN, Chandorkar AN. port/documentation/user_guides/ug474_7Series_CLB.pdf.
Watermarking Hardware Based on Wavelet Coefficients 30. Logic Elements and Logic Array Blocks in the Cyclone III
Quantization Method. Circuits, Systems, and Signal Device Family Cyclone III Device Handbook. 2011 Dec;
Processing. 2013; 32(6):2559–79. 1:1–8.
26. Kiran S, Nadhini Sri KV, Jaya J. Design and implementation 31. Mohanty SP, Kougianos E. Real-time perceptual water-
of FPGA based invisible image watermarking encoder using marking architectures for video broadcasting. Journal of
wavelet transformation. Coimbatore: 2013 International Systems and Software. 2011; 84(5):724–38.
Vol 9 (33) | September 2016 | www.indjst.org Indian Journal of Science and Technology 9