Skip to main content
Top
Published in: Complex & Intelligent Systems 3/2018

Open Access 01-10-2018 | Original Article

Linear weighted watermarking using normalized principal components

Authors: Sangeetha N, Anita X

Published in: Complex & Intelligent Systems | Issue 3/2018

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This manuscript introduces a novel linear weighted watermarking through normalized principal components using discrete wavelet transform (DWT) and singular value decomposition (SVD). Weight evaluation for embedding a singular value matrix of a watermark into a host is a trivial task in watermark embedding process. This task is accomplished by the normalized principal components derived from the singular value matrices of HH subbands of the host and the watermark images. Experiments are conducted to analyze the effectiveness of the proposed watermark embedding and watermark-host extraction processes against the other DWT–SVD based watermarking schemes. Performance of this method is analyzed by peak signal to noise ratio, structural similarity index and correlation coefficient. The proposed method is also tested against various geometrical and non-geometrical attacks on watermarked images.
Notes

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Introduction

Watermarking is the process of embedding a secret image into a host image without degrading the imperceptibility of the observer. With the rapid development of multimedia applications, there is a growing concern over the authentication, copy right protection and ownership [1] of the multimedia content which are communicated in the open networks. Digital watermarking methods provide solutions to ownership and tamper localization issues [2]. For security and authentication, watermark (WM) should not be visible and at the same time, quality of the host should not be degraded. The same should be ascertained for better robustness of security and authentication even if the watermarked image experiences geometrical or any non-geometrical attacks. There is always a tradeoff between amount of information embedded on the host and imperceptibility for authentication and copyright protection. This system requirement directs the researchers towards the watermarking algorithms which provide security, authentication, imperceptibility and robustness.
Watermarking algorithms do provide a solution to handle all these issues either in spatial domain or in frequency domain [3]. Spatial domain algorithms are more sensitive to image processing operations and other attacks than frequency domain methods [4]. In spatial domain methods, the selected pixels of the host image are directly modified by the watermark pixels without degrading the quality of the host image. In frequency domain, the transformed coefficients of the host image are modified by the watermark image [1]. Higher robustness can be achieved by transform domain methods [5].
Table 1
Comparison of Spatial and frequency domain watermarking
Spatial domain watermarking
Transform domain watermarking
The pixel values of host image are modified in accordance to the watermark image as per watermarking criteria
Transform coefficients of the host image are modified in accordance to the watermark image coefficients as per the watermarking criteria [12]
Less robustness and imperceptibility against various attacks [16]
Better robustness and imperceptibility [5, 17]
Less complex [18, 19]
Complexity based on the type of the transform
Even distribution of watermark values in the host image
Watermark values are distributed all over the host image because of the inverse transform [20]
WM algorithms are classified into fragile, semi-fragile and robust methods based on their response to the attacks. Fragile watermarking does not tolerate any modifications; hence the WM image is either lost or modified by the attacks. Semi-fragile methods are robust against certain attacks and allow certain image processing tasks such as image compression and image enhancement [6]. On the other hand, robust watermarking techniques resist any modifications or attacks to the WM to preserve the quality of the watermarked image [7]. These robust methods are very much useful for the protection of copyrights and ownership authentication.
In the recent years, semi-fragile watermarking gains momentum that attracts the researchers to employ frequency domain techniques. Spatial domain watermarking schemes need less computation but often results in poor robustness against geometric attacks [8]. Frequency domain algorithms provide an alternative for this issue and hence the watermarking schemes based on DCT [8], DWT, RDWT [9, 10] and SVD [11] have gained momentum in watermarking concepts. SVD combined with transforms such as DCT, DWT, RDWT are more efficient than SVD based methods [12]. DWT–SVD based watermarking schemes provide better robustness and imperceptibility [13] because of the sensitiveness to modeling of DWT. In DWT–SVD watermarking schemes [4, 14], WM embedding is carried out on ‘S’ matrices of LL subbands [10, 15] of the host and the WM images. The amount of embedding is decided by the scaling factor ‘\(\alpha \)’. Pros and cons of spatial and transform domain watermarking methods are given in Table 1.
Watermarking schemes using SVD matrices of the watermark and the host images faces false positive detection problem in watermark extraction process [20]. DWT–SVD watermarking [15] repeats the watermark embedding process and hence the complexity increases. In SVD-Radon transform [7] and SVD-support vector regression [21] based watermarking methods, embedding is done on LL subband of the host image.
This manuscript uses HH subband of the images for WM embedding. Singular value matrices (S matrices) of the HH coefficients of the host image and the WM image are combined for watermark embedding. The amount of WM embedding is determined by the normalized principal components (NPC). Principal components are evaluated for the HH coefficients of the host and the WM images. This can be interpreted as a principal component analysis (PCA) fusion which fuses the singular values of HH coefficients of the host and the WM images. Since linear weighted fusion rule is applied for the singular value matrices of the frequency subbands of DWT, pitfalls of spatial domain fusion are eliminated. The novelty of the proposed method lies on the evaluation of normalized principal components as scaling factors for embedding process. Hence the proposed method distances itself from the conventional DWT–SVD–PCA watermarking. Performance of this method is analyzed by peak signal to noise ratio (PSNR), structural similarity index (SSIM) and correlation coefficient (CC). Various experiments are conducted to analyze the performance of the proposed method. We also test the proposed method against geometrical and non-geometrical attacks on watermarked images.
This paper is organized as follows: “DWT–SVD watermarking and PCA fusion” section elaborately analyzes DWT–SVD and principal component analysis (PCA) fusion. “Linear weighted watermarking using NPC” deals with the proposed watermarking algorithm. Experiments and performance analysis is given in next section. This is followed by conclusion in last section.

DWT–SVD watermarking and PCA fusion

Frequency domain methods are more preferred for semi-fragile watermarking schemes. DWT–SVD [9] uses the scaling factor ‘\(\alpha \)’ for WM embedding. SVD could easily convert largest changes due to attacks into minor changes in the watermark and the host images. Watermarking schemes using SVD require more computations. On the other hand, SVD combined with transforms reduce the amount of computational requirement. This desirable property of SVD paved the way for watermarking algorithms such as DWT–SVD, RDWT–SVD, DCT–SVD and so on.
SVD finds wide applications in image compression, noise reduction, image hiding and watermarking. SVD decomposes a square or rectangular matrix into two orthogonal matrices U, V and a diagonal matrix S. SVD is preferred for watermarking because of its properties. In SVD, S matrix represents the brightness of the image whereas UV demonstrate geometry properties of the image [22]. Small changes on an image will not make big impact in S matrix of the image.

DWT–SVD watermark embedding

DWT–SVD watermarking techniques, available in the literature, use LL subbands for WM embedding. ‘S’ matrices are derived for the LL subbands of the host and the WM and further used for watermark embedding. The steps involved in DWT–SVD watermarking are elaborated below and shown in Fig. 1.
Step A1:
Apply DWT to the host image H(xy)
$$\begin{aligned}{}[\hbox {LL} _{\mathrm{H}} , \hbox {LH} _{\mathrm{H}} , \hbox {HL} _{\mathrm{H}} , \hbox {HH} _{\mathrm{H}} ]=\hbox {DWT}\{{H(x,y)}\} \end{aligned}$$
(1)
Apply SVD to \(LL_{\mathrm{H}}\)
$$\begin{aligned}{}[ {U}_{\mathrm{H}} , {S}_{\mathrm{H}} , {V}_{\mathrm{H}} ]=\hbox {SVD}\{ \hbox {LL}_{\mathrm{H}} \} \end{aligned}$$
(2)
 
Step A2:
Apply DWT to WM image WM(xy)
$$\begin{aligned}{}[ \hbox {LL}_{\mathrm{wm}} , \hbox {LH}_{\mathrm{wm}} , \hbox {HL}_{\mathrm{wm}} , \hbox {HH}_{\mathrm{wm}} ]=\hbox {DWT}\{\hbox {WM}(x,y)\} \end{aligned}$$
(3)
Apply SVD to \(LL_{\mathrm{wm}}\)
$$\begin{aligned}{}[ {U}_{\mathrm{wm}} , {S}_{\mathrm{wm}} , {V}_{\mathrm{wm}} ]=\hbox {SVD}\{ \hbox {LL}_{\mathrm{wm}} \} \end{aligned}$$
(4)
 
Step A3:
WM embedding is given by
$$\begin{aligned} {S}_{\mathrm{emb}} = {S}_{\mathrm{H}}+\alpha \cdot {S}_{\mathrm{wm}} \end{aligned}$$
(5)
 
where ‘\(\alpha \)’ is a scaling factor
Apply inverse SVD (ISVD) to get WM embedded Singular value matrix
$$\begin{aligned} \hbox {LL}_{\mathrm{emb}} = \hbox {ISVD}\{ {U}_{\mathrm{H}} , {S}_{\mathrm{emb}} , {V}_{\mathrm{H}}^{\mathrm{T}} \} \end{aligned}$$
(6)
Step A4:
Apply Inverse DWT (IDWT) to get watermarked image in spatial domain
$$\begin{aligned} {H}_{\mathrm{emb}} {(x,y)}=\hbox {IDWT}\{ \hbox {LL}_{\mathrm{emb}} , \hbox {LH}_{\mathrm{H}} , \hbox {HL}_{\mathrm{H}} , \hbox {HH}_{\mathrm{H}} \} \end{aligned}$$
(7)
 

DWT–SVD watermark and host extraction

Step B1:
Apply DWT to the \(H_\mathrm{emb}(x,y)\)
$$\begin{aligned}{}[\hbox {LL}_{\mathrm{emb}}, \hbox {LH}_{\mathrm{H}}, \hbox {HL}_{\mathrm{H}}, \hbox {HH}_{\mathrm{H}}]=\hbox {DWT}\{\hbox {H}_{\mathrm{emb}}\} \end{aligned}$$
(8)
Apply SVD to \(LL_\mathrm{emb}\)
$$\begin{aligned}{}[{U}_{\mathrm{emb}}, {S}_{\mathrm{emb}}, {V}_{\mathrm{emb}}]=\hbox {SVD}\{\hbox {LL}_{\mathrm{emb}}\} \end{aligned}$$
(9)
 
Step B2:
Repeat step A1
 
Step B3:
Repeat step A2
 
Step B4:
Extract the watermark \(\mathrm{WM}'(x,y)\)using
$$\begin{aligned} S_\mathrm{wm}'= (1/\alpha ) \cdot (S_\mathrm{emb}- S_{H}) \end{aligned}$$
(10)
Apply ISVD to get DWT coefficients
$$\begin{aligned} \hbox {LL}_{\mathrm{wm}}' = \hbox {ISVD} \{{U}_{\mathrm{wm}}, {S}_{\mathrm{wm}}', {V}_{\mathrm{wm}}^{\mathrm{T}}\} \end{aligned}$$
(11)
Apply IDWT to get WM image in spatial domain
$$\begin{aligned} \hbox {WM}'{(x,y)} =\hbox {IDWT}\{\hbox {LL}_{\mathrm{wm}}',\hbox {LH}_{\mathrm{wm}},\hbox {HL}_{\mathrm{wm}},\hbox {HH}_{\mathrm{wm}}\}\nonumber \\ \end{aligned}$$
(12)
 
Step B5:
Extract the host \(H'(x,y)\) using
$$\begin{aligned} S_{H}'=S_\mathrm{emb}-\alpha \cdot S_\mathrm{wm} \end{aligned}$$
(13)
Apply ISVD to get DWT coefficients
$$\begin{aligned} \hbox {LL}_{\mathrm{H}}' = \hbox {ISVD} \{{U}_{\mathrm{H}}, {S}_{\mathrm{H}}', {V}_{\mathrm{H}}^{\mathrm{T}}\} \end{aligned}$$
(14)
Apply IDWT to get host in spatial domain
$$\begin{aligned} \hbox {H}'{(x,y)} =\hbox {IDWT}\{\hbox {LL}_{\mathrm{H}}',\hbox {LH}_{\mathrm{H}},\hbox {HL}_{\mathrm{H}},\hbox {HH}_{\mathrm{H}}\} \end{aligned}$$
(15)
 

PCA fusion

Principal component analysis fusion is one of the fusion techniques performed in spatial domain. PCA is a dimension reduction technique [23] which represents a whole data set with very few principal components [24] and hence the principal components derived from the covariance properties of the source data sets deliver meaningful weights for a linear weighted spatial domain fusion [25]. This spatial domain fusion is often degraded by spectral distortions [26, 27] and thus frequency domain fusion is often preferred. Evaluation of normalized principal components is shown in Fig. 2 and the steps are given below
Consider two source images \(I_{1}(x,y)\) and \(I_{2}(x,y)\) with the spatial resolution of \(M \times M\). Principal component evaluation is given by
$$\begin{aligned}{}[{E, D}] = \hbox {Eigen} \{\hbox {cov}[{I}_{\mathrm{1}}{(x,y)}, {I}_{\mathrm{2}}({x,y})]\} \end{aligned}$$
(16)
where
$$ \begin{aligned} E = \left[ {\begin{array}{ll} {{E_{11}}} &{} {{E_{12}}}\\ {{E_{21}}} &{} {{E_{22}}}\\ \end{array}} \right] \quad \& \quad D=\left[ {\begin{array}{ll} {{D_{11}}}&{}\cdot \\ \cdot &{}{{D_{12}}}\\ \end{array}} \right] \end{aligned}$$
E—Eigen vectors D—Diagonal matrix with Eigen values
Normalized principal components \(P_{1}\) and \(P_{2}\) are evaluated by
If \(D_{11}>\) \(D_{22}\)
$$\begin{aligned} {P_1}= & {} \frac{{E_{11}}}{{E_{11}} + {E_{21}}};\quad {P_2} = \frac{{E_{21}}}{{E_{11}} + {E_{21}}} \end{aligned}$$
(17)
Else
PCA fusion is given by
$$\begin{aligned} F\left( {x,y} \right) =P_1 \cdot I_1 \left( {x,y} \right) + P_2 \cdot I_2 \left( {x,y} \right) \end{aligned}$$
(18)

Linear weighted watermarking using NPC

In DWT–SVD method, WM embedding is carried out by the factor ‘\(\alpha \)’. Evaluation of ‘\(\alpha \)’ is a trivial task that decides the amount of data to be embedded. This ambiguity of ‘\(\alpha \)’ evaluation can be replaced by PCA based fusion as given in “PCA fusion” section. Principal components evaluated for the ‘S’ matrices of the host and the WM images provide scaling factors ‘\(P_{1}\)’ and ‘\(P_{2}\)’ for WM embedding and extraction. This is illustrated for various host images in Table 2. If this scaling is experimented in spatial domain, then the watermarking will be a visible watermarking which is not preferred for image authentication. Since the fusion is carried out for ‘S’ matrices based on the covariance of the same, watermarking is not visible. This is evident in watermarked images shown in Fig. 6.
Table 2
Linear weights for WM embedding
 
Boat
Barbara
Baboon
Airplane
Zelda
Gold hill
\(P_{1}\)
0.758934
0.860309
0.878597
0.661746
0.602968
0.725408
\(P_{2}\)
0.241066
0.139691
0.121403
0.338254
0.397032
0.274592
The proposed linear weighted watermarking scheme uses HH coefficients for WM embedding. The rule for WM embedding in DWT–SVD is also replaced by PCA fusion. The entire proposed watermarking scheme is elaborated below and shown in Fig. 3.

Linear weighted watermark embedding using NPC

A host image H(xy) and a WM image WM(x,y) with the size of \(M \times M\) are considered for WM embedding. DWT is applied to the images with ‘Haar’ wavelet.
Step C1:
Apply DWT to the host image H(xy)
$$\begin{aligned}{}[\hbox {LL}_{\mathrm{H}}, \hbox {LH}_{\mathrm{H}}, \hbox {HL}_{\mathrm{H}}, \hbox {HH}_{\mathrm{H}}]=\hbox {DWT}\{{H(x,y)}\} \end{aligned}$$
(19)
Apply SVD to HH \(_{H}\)
$$\begin{aligned}{}[{U}_{\mathrm{H}}, {S}_{\mathrm{H}}, {V}_{\mathrm{H}}]=\hbox {SVD}\{\hbox {HH}_{\mathrm{H}}\} \end{aligned}$$
(20)
 
Step C2:
Apply DWT to WM image WM(x,y)
$$\begin{aligned}{}[\hbox {LL}_{\mathrm{wm}}, \hbox {LH}_{\mathrm{wm}}, \hbox {HL}_{\mathrm{wm}}, \hbox {HH}_{\mathrm{wm}}]=\hbox {DWT}\{\hbox {WM(x,y)}\}\nonumber \\ \end{aligned}$$
(21)
Apply SVD to HH \(_{wm}\)
$$\begin{aligned}{}[{U}_{\mathrm{wm}}, {S}_{\mathrm{wm}}, {V}_{\mathrm{wm}}]=\hbox {SVD}\{\hbox {HH}_{\mathrm{wm}}\} \end{aligned}$$
(22)
 
Step C3:
Apply PCA fusion for WM embedding
$$\begin{aligned}{}[{P}_{1}, {P}_{2}]= & {} \hbox {PCA} \{{S}_{\mathrm{H}}, {S}_{\mathrm{wm}}\} \end{aligned}$$
(23)
$$\begin{aligned} {S}_{\mathrm{emb}}= & {} {P}_{1} \cdot {S}_{\mathrm{H}} + {P}_{2} \cdot {S}_{\mathrm{wm}} \end{aligned}$$
(24)
Apply ISVD to get WM embedded HH coefficients
$$\begin{aligned} \hbox {HH}_{\mathrm{emb}}= \hbox {ISVD} \{\hbox {U}_{\mathrm{H}}, {S}_{\mathrm{emb}}, {V}_{\mathrm{H}}^{\mathrm{T}}\} \end{aligned}$$
(25)
 
Step C4:
Apply IDWT to get watermarked image in spatial domain
$$\begin{aligned} {H}_\mathrm{emb}{(x,y)}=\hbox {IDWT}\{\hbox {LL}_{\mathrm{H}}, \hbox {LH}_{\mathrm{H}}, \hbox {HL}_{\mathrm{H}}, \hbox {HH}_{\mathrm{emb}} \} \end{aligned}$$
(26)
 

Watermark and host extraction

Step D1:
Apply DWT to the \(H_{emb}(x,y)\)
$$\begin{aligned}{}[\hbox {LL}_{\mathrm{H}}, \hbox {LH}_{\mathrm{H}}, \hbox {HL}_{\mathrm{H}}, \hbox {HH}_{\mathrm{emb}}]=\hbox {DWT}\{\hbox {H}_{\mathrm{emb}}\} \end{aligned}$$
(27)
Apply SVD to HH \(_{emb}\)
$$\begin{aligned}{}[{U}_{\mathrm{emb}}, {S}_{\mathrm{emb}}, {V}_{\mathrm{emb}}]=\hbox {SVD}\{\hbox {HH}_{\mathrm{emb}}\} \end{aligned}$$
(28)
 
Step D2:
Repeat step C1
 
Step D3:
Repeat step C2
 
Step D4:
Extract the watermark WM’(xy) using
$$\begin{aligned} {S}_{\mathrm{wm}}'= ({1/P}_{2}) \, \cdot \,({S}_{\mathrm{emb}}- {P}_{1}\cdot {S}_{\mathrm{H}}) \end{aligned}$$
(29)
Apply ISVD to get DWT coefficients
$$\begin{aligned} \hbox {HH}_{\mathrm{wm}}' = \hbox {ISVD} \{{U}_{\mathrm{wm}}, {S}_{\mathrm{wm}}', {V}_{\mathrm{wm}}^{\mathrm{T}}\} \end{aligned}$$
(30)
Apply IDWT to get WM image in spatial domain
$$\begin{aligned} \hbox {WM}'{(x,y)} =\hbox {IDWT}\{\hbox {LL}_{\mathrm{wm}},\hbox {LH}_{\mathrm{wm}},\hbox {HL}_{\mathrm{wm}},\hbox {HH}_{\mathrm{wm}}'\}\nonumber \\ \end{aligned}$$
(31)
 
Step D5:
Extract the host \(H'(x,y)\) using
$$\begin{aligned} S_{H}'= (1/P_{1}) \, \cdot (S_{emb}-P_{2}\cdot S_{wm}) \end{aligned}$$
(32)
Apply ISVD to get DWT coefficients
$$\begin{aligned} \hbox {HH}_{\mathrm{H}}' = \hbox {ISVD}\, \{{U}_{\mathrm{H}}, {S}_{\mathrm{H}}', {V}_{\mathrm{H}}^{\mathrm{T}}\} \end{aligned}$$
(33)
Apply IDWT to get host in spatial domain
$$\begin{aligned} {H}'{(x,y)} =\hbox {IDWT}\{\hbox {LL}_{\mathrm{H}},\hbox {LH}_{\mathrm{H}},\hbox {HL}_{\mathrm{H}},\hbox {HH}_{\mathrm{H}}'\} \end{aligned}$$
(34)
 

Experiments and analysis

Performance of the proposed watermarking algorithm is evaluated by various experiments and metrics. In our experiments, we use six host images of spatial resolution \(512 \times 512\) and given in Fig. 4. A watermark image with the same spatial resolution is used for embedding and given in Fig. 5. All experiments are simulated by MATLAB R2012a image processing tool box in Intel Core i5, 3.2 GHz processor with 4 GB RAM.
DWT with first level of decomposition is applied to the host and WM images using ‘Haar’ wavelet and subsequently SVD is applied. We conduct various experiments to analyze the performance of the proposed method. First experiment analyzes WM embedding process. Second one deals with WM and host extraction process. In the third experiment, we analyze the selection of DWT subbands for WM embedding. Fourth experiment analyzes the impact of various attacks on WM embedded image and the fifth one is about the cost of computation.
Table 3
Wavelet selection
Wavelets
PSNR in dB
Boat
Barbara
Baboon
Pool
Zelda
Gold hill
Haar
54.7469
51.95889
51.39822
58.71134
61.72735
55.87358
Mexian hat
57.5451
55.50501
55.03464
61.70783
60.89389
58.29581
db2
56.50751
54.17234
53.69035
60.88098
60.99883
57.34666
bior1.1
54.7469
51.95889
51.39822
58.71134
61.72735
55.87358
sym1
56.50751
54.17234
53.69035
60.88098
60.99883
57.34666
bior2.2
57.86309
55.05852
55.11162
61.3802
61.09999
58.23598
Host extraction
   Haar
315.3405
315.4165
314.5552
312.5326
318.1948
316.1987
   Mexian hat
102.9277
102.527
89.62921
103.5492
105.5778
103.09
   db2
92.99962
91.29276
77.03794
88.58636
99.33936
88.75591
   bior1.1
318.3756
314.9913
315.028
318.5849
318.6773
318.4863
   sym1
92.99962
91.29276
77.03794
88.58636
99.33936
88.75591
   bior2.2
88.53934
88.71099
74.07558
86.21806
94.04718
86.02174
Watermark extraction
   Haar
318.3756
314.9913
315.028
318.5849
318.6773
318.4863
   Mexian hat
116.0113
119.5873
109.8813
110.3675
113.0801
114.4143
   db2
104.7897
108.4076
96.21933
95.01921
105.2092
98.96804
   bior1.1
315.3405
315.4165
314.5552
312.5326
318.1948
316.1987
   sym1
104.7897
108.4076
96.21933
95.01921
105.2092
98.96804
   bior2.2
103.1319
106.1544
95.31355
93.98313
102.6953
98.73337
Table 4
Performance metrics for WM embedding
Methods
Boat
Barbara
PSNR in dB
SSIM
CC
PSNR in dB
SSIM
CC
DWT–SVD
28.67672
0.995223
0.999555
28.67672
0.996082
0.999717
RDWT–SVD
28.67497
0.995369
0.999614
28.67557
0.996225
0.999743
Proposed
54.7469
1
0.99995
51.95889
1
0.999931
 
Baboon
Airplane
DWT–SVD
28.67672
0.995434
0.998981
28.67672
0.997086
0.999665
RDWT–SVD
28.67831
0.995697
0.999078
28.67354
0.997149
0.99972
Proposed
51.39822
1
0.999871
58.71134
1
0.99998
 
Zelda
Goldhill
DWT–SVD
28.67672
0.993116
0.999908
28.67672
0.993879
0.999551
RDWT–SVD
28.67311
0.993223
0.999934
28.67523
0.994083
0.999591
Proposed
61.72735
1
0.999987
55.87358
1
0.999965
Table 5
Performance metrics for host extraction
Methods
Boat
Barbara
PSNR in dB
SSIM
CC
PSNR in dB
SSIM
CC
DWT–SVD
297.2019
1
1
302.1114
1
1
RDWT–SVD
74.64329
0.999997
1
68.45947
0.999989
0.999999
Proposed
315.3405
1
1
315.4165
1
1
 
Baboon
Airplane
DWT–SVD
293.3464
1
1
299.5996
1
1
RDWT–SVD
70.24676
0.999995
0.999999
76.39387
0.999997
1
Proposed
314.5552
1
1
312.5326
1
1
 
Zelda
Goldhill
DWT–SVD
294.6514
1
1
293.1579
1
1
RDWT–SVD
75.54812
0.999995
0.999999
74.22174
0.999995
1
Proposed
318.1948
1
1
316.1987
1
1
Table 6
Performance metrics for WM extraction
Methods
Boat
Barbara
PSNR in dB
SSIM
CC
PSNR in dB
SSIM
CC
DWT–SVD
285.4239
1
1
289.7184
1
1
RDWT–SVD
54.57439
0.999436
0.999953
47.70025
0.997011
0.999751
Proposed
318.3756
1
1
314.9913
1
1
 
Baboon
Airplane
DWT–SVD
279.5829
1
1
286.0401
1
1
RDWT–SVD
50.01403
0.998763
0.999867
56.35298
0.999521
0.999967
Proposed
315.028
1
1
318.5849
1
1
 
Zelda
Goldhill
DWT–SVD
289.321
1
1
286.1962
1
1
RDWT–SVD
55.41243
0.999397
0.999958
54.04597
0.999279
0.999946
Proposed
318.6773
1
1
318.4863
1
1

Metrics for performance analysis

Performance analysis is accomplished by the three matrices PSNR in dB, SSIM and CC. PSNR is inversely proportional to mean square error which finds out the quantitative difference between the two images. Hence, higher value of PSNR [28] denotes better performance. Mean SSIM is the quality assessment metric that exhibits much better consistency with the qualitative visual presentation based on luminance subtraction, contrast and structural characteristics [29]. CC is the metric which finds out the correlation between two images by evaluating the difference between the mean and gray value of the individual pixels. This is another quantitative metric that demonstrates the closeness of one image with the reference image. SSIM and CC values close to one demonstrate superior watermarking process.
Table 7
Performance on Caltech background dataset
Method
PSNR in dB
SSIM
CC
Watermark embedding
   DWT–SVD
28.69421
0.995006
0.999604
   RDWT–SVD
28.68888
0.995137
0.999659
   Proposed
60.53653
0.999557
0.999966
Watermark extraction
   DWT–SVD
287.8672
1
1
   RDWT–SVD
50.4641
0.998108
0.99985
   Proposed
318.5108
1
1
Host extraction
   DWT–SVD
295.2617
1
1
   RDWT–SVD
70.55934
0.99998
0.999999
   Proposed
315.0988
1
1

Watermark embedding analysis

Six host images are experimented with a WM with the same spatial resolution. DWT with ‘Haar’ wavelet is applied to the host and the WM images. PSNR values of embedding and extraction are used to select the appropriate wavelet for DWT decomposition and given in Table 3. Mexican hat and bior2.2 wavelets deliver better embedding but result in poor extraction process. Both embedding and extraction are better with Haar wavelet and hence Haar wavelet is selected for decomposition. Bior1.1 wavelet also delivers similar results to that of Haar wavelet and can be alternatively used in embedding and extraction. Principal components are derived from the S matrices of ‘HH’ subbands of the host and the WM images. The amount of WM embedding into the host decides PSNR, SSIM and CC. For comparative analysis, DWT–SVD and RDWT–SVD watermarking methods are evaluated and given in Table 4. Upon analyzing the metrics, it is revealed that the proposed method is able to deliver better PSNR, SSIM and CC values compared to other two methods for all the host images. Higher PSNR value demonstrates better imperceptibility for the observer. Watermarks are also not visible, since the embedding is carried in transformed domain. This is illustrated by the watermarked host images in Fig. 6. SSIM and CC values of close to one demonstrate high similarity between the host and the watermarked images. SSIM reveals the qualitative performance of the proposed method by analyzing the structural characteristics and contrast of the watermarked image with respect to the original image.
Table 8
Performance metrics for subband selection
Method
Subband
PSNR in dB
Boat
Barbara
Baboon
Airplane
Zelda
Gold hill
Embedding
LL
22.40662
24.34049
22.57053
18.14572
36.17646
24.72025
HH
54.7469
51.95889
51.39822
58.71134
61.72735
55.87358
Host extraction
LL
291.229
291.1888
289.9447
289.5098
291.0575
291.2265
HH
318.3756
314.9913
315.028
318.5849
318.6773
318.4863
WM extraction
LL
297.6624
301.558
292.1991
294.3182
294.3982
293.3587
HH
315.3405
315.4165
314.5552
312.5326
318.1948
316.1987

Host and watermark extraction analysis

For ensuring authentication, copyright and ownership, extraction of both the images needs to be experimented. By carrying out reverse process, as stated in “Watermark and host extraction” section, host and WM images can be extracted and analyzed for performance evaluation. After extraction, both the host and WM images should be similar to the original host and the WM images. This is can be objectively analyzed by evaluating PSNR, SSIM and CC between the extracted and the original images. Upon analyzing Tables 5 and 6, it is observed that the proposed method is able to extract the host and the WM images with higher PSNR compared to other methods. SSIM and CC values of one denote that the extracted images are similar to that of the original images.
The proposed algorithm is also experimented on Caltech background dataset [30] with 451 images and the metrics for embedding and extraction are given in Table 7. Mean value of the metrics are evaluated to all the images of background dataset. This dataset comprises of low and high contrast images of varying illumination. Upon analyzing the metrics, it is evident that the proposed method delivers better embedding and extraction for the images of different contrast and background.

Subband selection for WM embedding

DWT–SVD and RDWT–SVD use LL subbands for WM embedding, but the proposed method is tested with HH subbands. In our experiments, selection of subband for WM embedding is not only decided by embedding process and also by the host and WM extraction. From the metrics given in Table 8, one can observe that the selection of HH subbands not only results in better embedding but also delivers better extraction.

Robustness analysis

Image authentication, copyright and ownership can be established by watermarking algorithms with better robustness against geometrical and non-geometrical attacks on WM embedded images. The robustness of the proposed method is tested with different attacks and the extracted WM images are given in Fig. 7. Extracted WM images are also given for other methods also. Crop and rotation attacks don’t change the gray values of the pixels, but results in loss of pixel values in certain spatial locations. Watermarking in DWT–SVD domain distributes watermark coefficients all over the host image and hence the crop and rotation hampers the recovery of watermark with cropped and out of bound details of the host image. For these two attacks, DWT–SVD and RDWT–SVD methods are able to extract the WM with less imperceptibility but the proposed methods delivers better results. Mean, median attacks change the gray values of the pixels and hence lead to poor extraction. In mean and median attacks, edges of the extracted watermark are blurred and this effect is similar to the dead band effect. When the watermarked image is corrupted by additive noises such as impulse and white Gaussian noise, noise values are distributed over the entire spatial location of the host image. The recovery of the watermark entirely depends on the noise density. If the noise density is less, then the extracted watermark will be good and vice versa. Upon analyzing the extracted images, it is observed that the proposed method delivers better results compared to other two methods.

Cost of computation

The three methods are compared based on the cost of computation for embedding and extraction process and given in Table 9. DWT–SVD method takes less time for embedding and extraction because of down sampling of subbands and absence of evaluation of \(\alpha \). RDWT–SVD method takes more time because of the absence of down sampling in DWT decomposition. Because of the evaluation of normalized principal components, the proposed method consumes more time than DWT–SVD.

Conclusion

This manuscript proposes a linear weighted WM embedding and extraction based on NPC, DWT and SVD. NPCs are derived from the singular value matrices of the HH coefficients of the host and the WM images. The singular value matrices of both the images are fused by the normalized linear weights derived from the principal components. Since this fusion is carried out in the transform domain, the impact of the WM over the host image is significantly unnoticeable, thus leads to invisible watermarking. Selection of scaling factors for watermarking is also replaced by this linear weight evaluation and hence this method eliminates the ambiguity of scaling factor evaluation. Experiments conducted on the watermarked and extracted images do sufficiently prove that the proposed method performs better watermarking even in the presence of geometrical and non-geometrical attacks. Comparative analysis with other DWT–SVD algorithms also reveals the effectiveness of the proposed method. Cost of computation of the proposed method is higher compared to other DWT–SVD based methods and the future work can include the robustness of the method against more attacks.
Table 9
Cost of computation for embedding and extraction
Methods
Embedding
Extraction
Time in sec
Time in sec
DWT–SVD
0.269155
0.60672
RDWT–SVD
1.192001
2.045824
Proposed method
0.99354
0.738366
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://​creativecommons.​org/​licenses/​by/​4.​0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Literature
1.
go back to reference Al-Otum Hazem munawer (2014) Semi-fragile watermarking for grayscale image authentication and tamper detection based on an adjusted expanded-bit multiscale quantization-based technique. J Vis Commun Image R 25:1064–1081CrossRef Al-Otum Hazem munawer (2014) Semi-fragile watermarking for grayscale image authentication and tamper detection based on an adjusted expanded-bit multiscale quantization-based technique. J Vis Commun Image R 25:1064–1081CrossRef
2.
go back to reference Ahmad AI, Millie P (2017) Multipurpose image watermarking in the domain of DWT based on SVD and ABC. Pattern Recogn Lett 94:228–236CrossRef Ahmad AI, Millie P (2017) Multipurpose image watermarking in the domain of DWT based on SVD and ABC. Pattern Recogn Lett 94:228–236CrossRef
3.
go back to reference Kuo CT, Cheng SC (2007) Fusion of color edge detection and color quantization for color image watermarking g using principal axes analysis. Pattern Recogn 40:3691–3704CrossRef Kuo CT, Cheng SC (2007) Fusion of color edge detection and color quantization for color image watermarking g using principal axes analysis. Pattern Recogn 40:3691–3704CrossRef
4.
go back to reference Lai CC, Tsai CC (2010) Digital image watermarking using discrete wavelet transform and singular value decomposition. IEEE Trans Instrum Meas 59(11):3060–3063CrossRef Lai CC, Tsai CC (2010) Digital image watermarking using discrete wavelet transform and singular value decomposition. IEEE Trans Instrum Meas 59(11):3060–3063CrossRef
5.
go back to reference Potdar VM, Han S, Chang E (2004) A survey of digital image watermarking techniques. INDIN’05, 3rd IEEE international conference on industrial informatics, IEEE Explore, pp 709–716 Potdar VM, Han S, Chang E (2004) A survey of digital image watermarking techniques. INDIN’05, 3rd IEEE international conference on industrial informatics, IEEE Explore, pp 709–716
6.
go back to reference Rzouga HL, Bernadette D, Ben ANE (2017) A combined watermarking approach for securing biometric data Signal Processing. Image Commun 55:23–31 Rzouga HL, Bernadette D, Ben ANE (2017) A combined watermarking approach for securing biometric data Signal Processing. Image Commun 55:23–31
7.
go back to reference Rastegar S, Namazi F, Yaghmaie K, Aliabadian A (2011) Hybrid watermarking algorithm based on singular value decomposition and radon transform. Int J Electron Commun (AEU) 65(7):658–63CrossRef Rastegar S, Namazi F, Yaghmaie K, Aliabadian A (2011) Hybrid watermarking algorithm based on singular value decomposition and radon transform. Int J Electron Commun (AEU) 65(7):658–63CrossRef
8.
go back to reference Lin S, Chen CF (2000) A robust DCT-based watermarking for copyright protection. IEEE Trans Consum Electron 46(3):415–21CrossRef Lin S, Chen CF (2000) A robust DCT-based watermarking for copyright protection. IEEE Trans Consum Electron 46(3):415–21CrossRef
9.
go back to reference Makbol Nasrin M, Ee KB (2013) Robust blind image watermarking scheme based on Redundant discrete wavelet transform and singular value decomposition. Int J Electron Commun (AEU) 67:102–112CrossRef Makbol Nasrin M, Ee KB (2013) Robust blind image watermarking scheme based on Redundant discrete wavelet transform and singular value decomposition. Int J Electron Commun (AEU) 67:102–112CrossRef
10.
go back to reference Lagzian S, Soryani M, Fathy M (2011) A new robust watermarking scheme based on RDWT–SVD. Int J Intell Inform Process 2(1):22–29 Lagzian S, Soryani M, Fathy M (2011) A new robust watermarking scheme based on RDWT–SVD. Int J Intell Inform Process 2(1):22–29
11.
go back to reference Chandra DS (2002) Digital image watermarking using singular value decomposition. In: Proceedings of the 45th Midwest symposium on circuits and system, vol 3, pp 264–267 Chandra DS (2002) Digital image watermarking using singular value decomposition. In: Proceedings of the 45th Midwest symposium on circuits and system, vol 3, pp 264–267
12.
go back to reference Ansari IA, Pant M, Ahn CW (2016) Robust and false positive free watermarking in IWT domain using SVD and ABC. Eng Appl Artif Intell 49:114–125CrossRef Ansari IA, Pant M, Ahn CW (2016) Robust and false positive free watermarking in IWT domain using SVD and ABC. Eng Appl Artif Intell 49:114–125CrossRef
13.
go back to reference Haouzia A, Noumeir R (2008) Methods for image authentication: a survey. Multimedia tools Appl 39(1):1–46CrossRef Haouzia A, Noumeir R (2008) Methods for image authentication: a survey. Multimedia tools Appl 39(1):1–46CrossRef
14.
go back to reference Faragallah Osama S (2013) Efficient video watermarking based on singular value decomposition in the discrete wavelet transform domain. Int J Electron Commun (AEU) 67:189–196CrossRef Faragallah Osama S (2013) Efficient video watermarking based on singular value decomposition in the discrete wavelet transform domain. Int J Electron Commun (AEU) 67:189–196CrossRef
15.
go back to reference Joo S, Suh Y, Shin J, Kitkuchi H (2002) A new robust watermarking embedding into wavelet DC components. ETRI J 24:401–404CrossRef Joo S, Suh Y, Shin J, Kitkuchi H (2002) A new robust watermarking embedding into wavelet DC components. ETRI J 24:401–404CrossRef
16.
go back to reference Schyndle RGV, Tirkle AZ, Osbrone CF (1994) A digital watermark. Proc IEEE Int Conf Image Process 2:86–90CrossRef Schyndle RGV, Tirkle AZ, Osbrone CF (1994) A digital watermark. Proc IEEE Int Conf Image Process 2:86–90CrossRef
17.
go back to reference Ejima M, Myazaki A (2001) On the evaluation of performance of digital watermarking in the frequency domain. In: Proceedings of IEEE international conference on image processing, pp 546–549 Ejima M, Myazaki A (2001) On the evaluation of performance of digital watermarking in the frequency domain. In: Proceedings of IEEE international conference on image processing, pp 546–549
18.
go back to reference Bors AG, Pitas I (1994) Image watermarking using DCT domain constraints. Proc IEEE Int Conf Image Process 3:231–234CrossRef Bors AG, Pitas I (1994) Image watermarking using DCT domain constraints. Proc IEEE Int Conf Image Process 3:231–234CrossRef
19.
go back to reference Sweldens W (1995) The lifting scheme: a new philosophy in biorthogonal wavelet constructions. Wave Appl Signal Image Process III(SPIE2569):68–79 Sweldens W (1995) The lifting scheme: a new philosophy in biorthogonal wavelet constructions. Wave Appl Signal Image Process III(SPIE2569):68–79
20.
go back to reference Geeta K, Singh KS (2017) Reference based semi blind image watermarking scheme in wavelet domain. Optik 142:191–204CrossRef Geeta K, Singh KS (2017) Reference based semi blind image watermarking scheme in wavelet domain. Optik 142:191–204CrossRef
21.
go back to reference Tsai HH, Jhuang YJ, Lai YS (2012) A SVD-based image watermarking in wavelet domain using SVR and PSO. Appl Soft Comput 12:2442–2453CrossRef Tsai HH, Jhuang YJ, Lai YS (2012) A SVD-based image watermarking in wavelet domain using SVR and PSO. Appl Soft Comput 12:2442–2453CrossRef
22.
go back to reference Ganic E, Eskicioglu AM (2005) Robust embedding of visual watermarks using discrete wavelet transform and singular value decomposition. J Electron Image 14(4):043004–043009CrossRef Ganic E, Eskicioglu AM (2005) Robust embedding of visual watermarks using discrete wavelet transform and singular value decomposition. J Electron Image 14(4):043004–043009CrossRef
23.
go back to reference Turk MA, Pentland AP (1994) Eigen faces for recognition. J Cogn Neuroscience 3(1):71–86CrossRef Turk MA, Pentland AP (1994) Eigen faces for recognition. J Cogn Neuroscience 3(1):71–86CrossRef
24.
go back to reference Sadhasivam SK, Bharath KM, Muttan S (2011) Implementation of max principle with pca in image fusion for surveillance and navigation application. Electron Lett Comput Vis Image Anal 10(1):1–10CrossRef Sadhasivam SK, Bharath KM, Muttan S (2011) Implementation of max principle with pca in image fusion for surveillance and navigation application. Electron Lett Comput Vis Image Anal 10(1):1–10CrossRef
25.
go back to reference Vijayarajan R, Muttan S (2014) Iterative block level principal component averaging medical image fusion. Optik Int J Light Electron Opt 125(17):4751–4757CrossRef Vijayarajan R, Muttan S (2014) Iterative block level principal component averaging medical image fusion. Optik Int J Light Electron Opt 125(17):4751–4757CrossRef
26.
go back to reference Vijayarajan R, Muttan S (2015) Discrete wavelet transform based principal component averaging fusion for medical images. Int J Electron Commun 69(6):896–902CrossRef Vijayarajan R, Muttan S (2015) Discrete wavelet transform based principal component averaging fusion for medical images. Int J Electron Commun 69(6):896–902CrossRef
27.
go back to reference Vijayarajan R, Muttan S (2016) Adaptive principal component analysis fusion schemes for multifocus and different optic condition images. Int J Image Data Fusion 7(2):189–201 Vijayarajan R, Muttan S (2016) Adaptive principal component analysis fusion schemes for multifocus and different optic condition images. Int J Image Data Fusion 7(2):189–201
28.
go back to reference Musrrat A et al (2015) An image watermarking scheme in wavelet domain with optimized compensation of singular value decomposition via artificial bee colony. Inf Sci 301(20):44–60 Musrrat A et al (2015) An image watermarking scheme in wavelet domain with optimized compensation of singular value decomposition via artificial bee colony. Inf Sci 301(20):44–60
29.
go back to reference Wang Z, Bovik AC, Sheikh HR, Simoncelli EP (2004) Image quality assessment: from error visibility to structural similarity. IEEE Trans Image Process 13(4):600–612CrossRef Wang Z, Bovik AC, Sheikh HR, Simoncelli EP (2004) Image quality assessment: from error visibility to structural similarity. IEEE Trans Image Process 13(4):600–612CrossRef
Metadata
Title
Linear weighted watermarking using normalized principal components
Authors
Sangeetha N
Anita X
Publication date
01-10-2018
Publisher
Springer International Publishing
Published in
Complex & Intelligent Systems / Issue 3/2018
Print ISSN: 2199-4536
Electronic ISSN: 2198-6053
DOI
https://doi.org/10.1007/s40747-017-0065-5

Other articles of this Issue 3/2018

Complex & Intelligent Systems 3/2018 Go to the issue

Premium Partner