A game-theoretic architecture for visible watermarking system of ACOCOA (adaptive content and contrast aware) technique
- First Online:
- Received:
- Accepted:
DOI: 10.1186/1687-6180-2011-48
- Cite this article as:
- Tsai, MJ. & Liu, J. EURASIP J. Adv. Signal Process. (2011) 2011: 48. doi:10.1186/1687-6180-2011-48
- 3.5k Downloads
Abstract
Digital watermarking techniques have been developed to protect the intellectual property. A digital watermarking system is basically judged based on two characteristics: security robustness and image quality. In order to obtain a robust visible watermarking in practice, we present a novel watermarking algorithm named adaptive content and contrast aware (ACOCOA), which considers the host image content and watermark texture. In addition, we propose a powerful security architecture against attacks for visible watermarking system which is based on game-theoretic approach that provides an equilibrium condition solution for the decision maker by studying the effects of transmission power on intensity and perceptual efficiency. The experimental results demonstrate that the feasibility of the proposed approach not only provides effectiveness and robustness for the watermarked images, but also allows the watermark encoder to obtain the best adaptive watermarking strategy under attacks.
Keywords
copyright protection visible watermarking watermarking game Nash equilibrium waveletList of abbreviations
- ACOCOA
adaptive content and contrast aware
- COCOA
content and contrast aware
- CSF
contrast sensitive function
- DCT
discrete cosine transform
- DFT
discrete Fourier transform
- DWT
discrete wavelet transform
- HVS
human visual system
- MSSIM
mean structural similarity
- NVF
noise visibility function
- PSNR
peak signal-to-noise ratios
- PSNR-HVS-M
PSNR human visual system masking metric
- SSIM
structural similarity
- VIF
visual information fidelity
- WPD
wavelet packet decomposition
- WSNR
weighted signal-to-noise ratio.
1. Introduction
In this study, we have explored the inter-relationship between the image fidelity and robust requirement of visible watermarking and propose a powerful secure watermarking architecture which is based on game-theoretic methodology. The system provides an equilibrium condition solution for the copyright manager to make a decision by studying the effect of transmission power on intensity and perceptual efficiency. In addition, we have formulated the watermark embedding problem as a dynamic non-cooperative game with complete information [4]. Complete information requires that every player knows the strategies of the other players but not necessarily the actions. Under the complete information, we present a game-theoretic architecture as a watermarking game to analyze the different situation and get the best strategy between the embedding watermark energy and the perceptual translucence for visible watermark where the best strategy is defined by the Nash equilibrium of the game [4]. Tsai and Liu's research [5] has preliminary study for visible watermarking which only applies peak signal noise ratio (PSNR) and correlation for the payoff functions. However, visual image quality measure is very critical for visible watermarking and such an issue should be included and weighted during the algorithm design. Therefore, we here leverage the previous research of [5] not only to consider the above discussion but also improve the visible watermarking technique for a novel payoff function under the game-theoretic architecture.
The rest of this article is organized as follows. In section 2, related works about visible watermarking and game-theoretic architecture will be introduced briefly. In section 3, we will give the detailed description of the proposed watermarking algorithm called ACOCOA (adaptive content and contrast aware) and a power security watermarking architecture design. In section 4, numerical results with discussion will be presented. Finally, the conclusions and future works are in section 5.
2. Related works
2.1. Digital watermarking
Digital watermarking techniques are the process of possibly irreversibly embedding information into a digital signal and they are used to protect copyright of digital multimedia like sound, music, audio, images, or video files that have to be delivered for certain purpose, such as digital multimedia used in exhibition, digital library, advertisement, or distant learning web, while illegal duplication is forbidden.
A review of the literature indicates that the visible watermarking studies have captured significant attention since their applications meet the requirements of many media industries [2, 3].
Through the survey, Braudaway et al. [6] proposed one of the early approaches for visible watermarking by formulating the non-linear equation to divide the linear brightness scale into two regions and accomplish the brightness alteration in spatial domain. Meng and Chang [7] proposed an efficient compressed-domain content-based algorithm which applied the stochastic approximation model for Braudaway's method in the discrete cosine transform (DCT) domain by adding visible watermarks in video sequences. Kankanhalli et al. [8] proposed a coefficient modulation in the DCT domain where the scaling factors are calculated by exploiting the human visual system (HVS), to ensure that the perceptual quality of the host image is preserved. Mohanty et al. proposed a watermarking technique called dual watermark, which is a combination of a visible watermark and an invisible watermark in the spatial domain. The visible watermark is adopted to establish the owner's right to the image and invisible watermark is used to check the intentional and unintentional tampering of image [9]. Due to the watermark insertion is done in the spatial domain, the image fidelity and robustness under attacks is pretty low. Tsai and Lin have developed more advanced approach in [10] by considering the global and local characteristics of the host and watermark images in the discrete wavelet transform (DWT) domain. Consequently, Mohanty et al. [11] also proposed a mathematical modification model for exploiting the texture sensitivity of the HVS in DCT domain. The weakness of this approach is the necessity to keep the watermark secret which is very unrealistic for visible watermarking. Better design is achieved in [12] and the approach is leveraged in this research. Chen [13] has proposed a visible watermarking mechanism to embed a gray level watermark into the host image where the strength of the embedded watermark locally depends on the standard deviation of luminance.
Vehel and Manoury [14] proposed a method for digital image watermarking which is based on the modification of certain subsets of the wavelet packet decomposition (WPD) and the WPD is a generalization of the dyadic wavelet transform with low-pass subbands. Hu and Kwang implemented an adaptive visible watermarking in the wavelet domain by using the truncated Gaussian function to approximate the effect of luminance masking for the image fusion. Based on image features, they first classify the host and watermark image pixels into different perceptual classes. Secondly, they use the classification information to guide pixel-wise watermark embedding. In high-pass subbands, they focus on image features, while in the low-pass subbands, they use truncated Gaussian function to approximate the effect of luminance masking [15, 16]. Yong et al. [17] also proposed a translucent digital watermark in the DWT domain and use error-correct code to improve the ability of anti-attack.
Each of above mentioned schemes was not devoted to better feature-based classification and the use of sophisticated visual masking models. Huang and Tang [18] later presented a contrast sensitive visible watermarking scheme with the assistance of HVS. They utilized the contrast sensitive function (CSF) mask of the DWT domain with square function to determine the mask weights and at last they adjusted the scaling and embedding factors based on the block classification with the texture sensitivity of the HVS for watermark embedding. Tsai [12] improved their approach and further proposed a novel visible watermarking algorithm based on the content and contrast aware (COCOA) technique. He utilized the global and local characteristics of the host and watermark images and considered HVS model in the DWT domain by using the CSF, noise visibility function (NVF), and DWT basis amplitude modulation for the best quality of perceptual translucence and noise reduction.
In summary, Figure 1 describes the generic structure for visible watermark embedding processes. First, a host image (original image) directly embeds watermark in spatial domain or is transformed into frequency domain through the well-known spread spectrum approach [19], i.e., Discrete Fourier Transform (DFT), DCT, or DWT. However, the algorithms using transform domain approach develop more robust watermarking techniques than directly embedding watermark into the spatial domain [3, 18]. Consequently, coefficients are passed through a perceptual analysis block that determines how strong the watermark in embedding algorithm can be, so that the resulting watermarked image is acceptable. The watermark is embedded through using a well-designed algorithm based on mathematical or statistical model. If the host image is employed in frequency domain, the inverse spread spectrum approach is then adopted to obtain a watermarked image [2, 3]. The watermark extraction applies to the similar operations in embedding processes with reverse procedures.
Digital contents embedded with visible watermarks will overlay recognizable but unobtrusive copyright patterns to identify its ownership. Therefore, a visible watermarking technique should retain details of contents and ensure embedded patterns difficult or even hard to be removed, and no one could use watermarked data illegally. How to solve the conflict problem and to determine the best tradeoff between the intensity of embedded watermark and the perceptual translucence for adaptive visible watermark under intentional attacks is becoming a subject of importance [5, 12, 18]. In this article, we present a game-theoretic architecture to solve this gap by proposing the ACOCOA (adaptive content and contrast aware) algorithm that provides more flexible design for encoder to set the energy of embedding watermark. We will introduce the ACOCOA technique and a game-theoretic architecture for visible watermarking system in details.
2.2. Game theory
Game theory is the formal study of the conflict and cooperation. The concepts of a game-theoretic approach help to formulate structure, analyze and understand strategic scenarios, and make a decision whenever the actions of the several agents are interdependent [4]. Game theory aims to help us to understand the situations in which decision-makers interact. Therefore, decision-makers can better estimate the potential effects of their actions and then make the ideal decisions to avoid the conflict.
There are two types of game theory. One is non-cooperative game, which focuses on analyzing each game player to maximize their own profit. The other is the cooperative game, which concentrates on groups of players and may enforce cooperative behaviors. Game theory has applications in several fields, such as economics, auctions, bargaining, politics, law, biology, social network, and voting systems. Some games have been proposed and we will briefly address different game techniques here.
Cohen and Lapidoth [20] computed the coding capacity of the watermarking game for Gaussian covertext and squared-error distortions. Both the public version of the game (covertext known to neither attacker nor decoder) and the private version of the game (covertext unknown to attacker but known to decoder) are treated. Moulin et al. [21] proposed an information-theoretic analysis of information hiding. They describe the fundamental limits of information-hiding system, formulate the information-hiding problem as a communication problem, and seek the maximum rate of reliable communication through the communication system.
Among the various theories of game, Nash equilibrium is one of the most important and widespread equilibrium concepts in the twentieth century. Nash equilibrium is a solution concept of a game involving two or more players, in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only his or her own strategy unilaterally. If each player has chosen a strategy and no player can benefit by changing his or her strategy while the other players keep theirs unchanged, then the current set of strategy choices and the corresponding payoffs constitute Nash equilibrium [4]. Under such scenario, the situation of visible watermark embedding strategies against attacks can be formulated as a competition game based on the actions of encoder and attackers. Therefore, we proposed a secure watermarking system based on game-theoretic methodology to achieve the objective of watermarking management. The idea of Nash equilibrium is adopted to develop the solution for the non-cooperative problem. Section 3 will describe how we can apply such a concept to make the game design for making decision of the visible watermark embedding procedures.
2.3. Image quality measure
- (1)PSNR is the most commonly used quality measure for reconstruction of lossy compression codecs such as image compression, image distortion, and so on. The definition of PSNR is as following:$\mathsf{\text{PSNR}}=10{log}_{10}\left(25{5}^{2}\u2215\mathsf{\text{MSE}}\right)$(1)
- (2)
VIF is based on local mutual information which measures how much information could flow from the reference image through the image distortion process to the human observer [22]. It uses natural scene statistics modeling in conjunction with an image-degradation model and the HVS model. The VIF measure can have values in the range [1], with VIF equal to 1 when the two compared images are identical.
- (3)
SSIM is a method for measuring the similarity between original and tested images [25]. Typically, it is computed from three measurement comparisons: luminance, contrast and structure with the window sizes of 8 × 8. The window can be displaced pixel-by-pixel on the image but the authors propose to use only a subgroup of the possible windows to reduce the complexity of the calculation. In practice, one usually requires a single overall quality measure of the entire image; thus, the mean SSIM index is computed to evaluate the overall image quality. The SSIM can be viewed as a quality measure of one of the images being compared, while the other image is regarded as perfect quality. Similar to SSIM, the MSSIM [25] method is a convenient way to incorporate image details at different resolutions. The results of SSIM and MSSIM can be between 0 and 1, where 1 means excellent quality and 0 means poor quality.
- (4)
PSNR-HVS-M is peak signal to noise ratio taking into account of CSF and between-coefficient contrast masking of DCT basis functions [26, 27]. Similar to PSNR, a higher PSNR-HVS-M value means that the tested image is less degraded.
- (5)
WSNR [28] is a method, which uses the CSF as the weighting function by defining WSNR as the ratio of the average weighted signal power to the average weighted noise power. As HVS is not equally sensitive to all spatial frequencies, CSF is taken into account where CSF is simulated by a low-pass or band-pass frequency filter. Similar to PSNR, a higher WSNR value means that the tested image is less degraded.
3. The proposed approach
In practice, the receiver will request the sender to send the watermarked image again if the received image quality is below an acceptable criterion. Such a condition forms a constraint for the application of visible watermarking since the image feasibility is essential to convince the receiver to take what is offered. In Figure 2, a horizontal dash line represents the acceptable image quality requirement where the equilibrium condition for both encoder and attack must above it. Otherwise, the attacked watermarked image will be rejected by the receiver. To fulfill our design methodology, we leverage the study of COCOA [12] to adaptive COCOA (ACOCOA) approach and develop a dynamic game-theoretic architecture for the watermark embedding problem which is described as a dynamic non-cooperative game with complete information [4]. The ideal strategy developed in Section. 3.2 is defined by the Nash equilibrium of the game [4]. The detailed information about ACOCOA will be explained in the following.
3.1. The ACOCOA (adaptive content and contrast aware) technique
Basis function amplitudes for a 5-level 9/7 DWT [12]
Orientation | Level | ||||
---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | |
LL | 0.62171 | 0.34537 | 0.18004 | 0.09140 | 0.045943 |
HL | 0.67234 | 0.41317 | 0.22726 | 0.11792 | 0.059758 |
LH | 0.67234 | 0.41317 | 0.22726 | 0.11792 | 0.059758 |
HH | 0.72709 | 0.49428 | 0.28688 | 0.15214 | 0.077727 |
CSF masking with 11 unique weights for a 5-level wavelet pyramidal decomposition
Orientation | Level | ||||
---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | |
LL | 0.23563 | ||||
HL | 0.46750 | 0.12674 | 0.07963 | 0.26699 | 0.27694 |
LH | 0.46750 | 0.12674 | 0.07963 | 0.26699 | 0.27694 |
HH | 0.75151 | 0.23960 | 0.01000 | 0.27694 | 0.31710 |
$w\left(x,y\right)=\gamma {\left[\eta \left(\gamma \right)\right]}^{\gamma}\frac{1}{{\u2225r\left(i,j\right)\u2225}^{2-\gamma}}$ and ${\sigma}_{I}^{2}$ are the global variance of the cover image I, $\eta \left(\gamma \right)=\sqrt{\Gamma \left(3\u2215\gamma \right)\u2215\Gamma \left(1\u2215\gamma \right)}$, $\Gamma \left(t\right)={\int}_{0}^{\infty}{\mathsf{\text{e}}}^{-u}{u}^{t-1}\mathsf{\text{d}}u$ (gamma function) and $r\left(x,y\right)=\left(I\left(x,y\right)-\overline{I}\left(x,y\right)\right)\u2215{\sigma}_{I}$, γ is the shape parameter, and r(x, y) is determined by the local mean and the local variance. For most of real images, the shape parameter is in the range 0.3 ≤ γ ≤ 1.
- (1)
The host color image is converted in the color space domain from RGB to YCrCb.
- (2)
By using Bi9/7 filter, compute the 5-level 2-D wavelet coefficients of Y component from host color image and grayscale watermark image.
- (3)Modify the DWT coefficients of the host image by using the following equation:${I}_{x,y}^{w}={\alpha}_{\lambda ,\theta}\times {I}_{x,y}+\left({\beta}_{\lambda ,\theta}+\mathsf{\text{NV}}{\mathsf{\text{F}}}_{x,y}\times K\right)\times {w}_{x,y}$(7)
- (4)
Inverse transform the DWT coefficients of the host image to obtain a watermarked image.
3.2. A game-theoretic architecture design for visible watermarking system
Take the ACOCOA algorithm as an example and the formula from Equation 7 where I_{x,y} , ${I}_{x,y}^{w}$, and w_{x,y} are the (x,y)th pixels of the host image, the watermarked image, and the visible logo image, respectively. α_{λ,θ} in Equation 2 and β_{λ,θ} in Equation 3 are the two weighting factors that contain the adjustable parameter value of P for host image and watermark intensity. While the image quality of ${I}_{x,y}^{w}$ is a constraint during the watermark embedding, the selection of α_{λ,θ} and β_{λ,θ} will be critical points since they will determine the expected image quality of ${I}_{x,y}^{w}$. After the watermark embedding stage, encoder will send the watermarked image to the receiver via Internet or other communication channels, while the attackers would try various ways to remove or destroy the watermark if they can intercept the transmission. Under such scenario, the robustness of the watermarking technique is essential to protect the intellectual property. Therefore, the visible watermark embedding action can be stated as a non-cooperative game where individual player decides the strategy to cope with the different situations.
We adopt the definition of Nash equilibrium in [29]. Suppose that there are N players in a game. Let X_{i} denote the set of possible strategies for player i. V_{i}(s_{1}, ... s_{N} ) denotes player i's payoff function where s_{1}, ... s_{N} are the strategies chosen by players 1, ..., N,respectively. An Nash equilibrium is a strategy profile $\left\{{s}_{1}^{*},\phantom{\rule{0.25em}{0ex}}...,\phantom{\rule{0.25em}{0ex}}{s}_{N}^{*}\right\}$ where ${s}_{1}^{*}\in {X}_{i}$ is the equilibrium strategy of player i and the function ${f}_{i}\left(x\right)\phantom{\rule{0.25em}{0ex}}=\phantom{\rule{0.25em}{0ex}}{V}_{i}\left({S}_{i}^{*},\phantom{\rule{0.25em}{0ex}}...,\phantom{\rule{0.25em}{0ex}}{S}_{i-1}^{*},\phantom{\rule{0.25em}{0ex}}x,\phantom{\rule{0.25em}{0ex}}{S}_{i+1}^{*},\phantom{\rule{0.25em}{0ex}}...,\phantom{\rule{0.25em}{0ex}}{S}_{N}^{*}\right)$ is optimized, for all x ∈ X_{i} . That is, in Nash equilibrium, a player's equilibrium strategy is the best response to the belief where the other players will also adopt their Nash equilibrium strategies.
There are two stages in Nash equilibrium. First, each player's optimal strategy is identified in response to what the other players might do. This is done for every combination of strategies by the other players. Second, Nash equilibrium is identified when all players are playing their optimal strategies simultaneously, and every player's strategy is ideal given under the other players use their equilibrium strategy. If both the set of players and set of strategies are not infinite, at least one such equilibrium exists in any time.
- (1)
a set of players;
- (2)
for each player, each has a set of strategies/actions;
- (3)
for each player, there is existing a payoff function to evaluate the gain/profit associated with the adopted strategy/action;
- (4)
for each player, there are a set of constraints.
- (1)
Players
- (2)
Strategies/actions
- (3)
Payoffs
The payoffs represent the welfare of the players at the end of the game. They are on the basis of each player choosing his strategy and the payoff function of a player is defined as the total profit/gain. From encoder player point of view, the image quality between the host image and the watermarked image is critical since the encoder need to reserve the highest fidelity after watermark embedding. Based on the quality assessment metric study of Ponomarenko et al [23], we apply four quality assessment metrics that produce reasonably good results from [23], such as MSSIM, VIF, PSNR-HVS-M, and WSNR. In addition, the correlation between the logo watermark and the extracted watermark after attack is also important since the robustness of the watermark embedding technique is critical for the encoder player. Therefore, four image quality assessment metric and correlation functions will be adopted in the payoff function for encoder player.
where ${\mathsf{\text{e}}}_{\left(N,M\right)}^{m}=\mathsf{\text{qualityassessmentmetric}}{\left(I,{I}_{w}\right)}_{N,M}^{m}$, ${\mathsf{\text{e}}}_{\left(N,M\right)}^{5}=\mathsf{\text{correlation}}{\left(\left({I}_{w}-I\right),w\right)}_{N,M}$,0 ≤ W_{1} ≤ 1, 0 ≤ W_{2} ≤ 1, and W_{1} + W_{2} = 1.
e^{m} represents image visual quality metric where e^{1} is MSSIM, e^{2} the VIF, e^{3} the PSNR-HVS-M, and e^{4} the WSNR. W_{1} and W_{2} are the weighting parameters for image quality and the robustness of watermark respectively in Equation 8.
The meaning of ${\mathsf{\text{e}}}_{\left(.,\phantom{\rule{0.25em}{0ex}}M\right)}^{m}$ represents the payoff value of a certain M for whole set of N where N is from 1 to N_{Max}.
Note:
I is the original host image; w is the logo watermark; and I_{w} is watermarked image.
In order to achieve the objective of encoder player's evaluation, the payoff should get a balanced function value between the intensity of embedded watermark and the perceptual translucence for watermark. Therefore, the payoff function f_{1} is defined as a normalized operation from four quality assessment metrics (MSSIM, VIF, PSNR-HVS-M, and WSNR) and correlation where the encoder's best strategy is ${f}_{1}^{*}=argmax{{f}_{1}}_{\phantom{\rule{0.25em}{0ex}}\left(.,\phantom{\rule{0.25em}{0ex}}M\right)}$.
where
${e}_{\left(N,M\right)}^{n}=\mathsf{\text{qualityassessmentmetric}}{\left({I}_{w},{I}_{w}^{\prime}\right)}_{N,M}^{n}$.
Note: e^{n}represents image visual quality metric where e^{1} is MSSIM, e^{2} is VIF, e^{3} is PSNR-HVS-M, and e^{4} is WSNR.
The meaning of ${e}_{\left(N\mathsf{\text{,}}\mathsf{\text{.}}\right)}^{n}$ represents the payoff value of a certain N for whole set of M where M is from 1 to M_{max}.
Note: I_{w} is watermarked image and ${I}_{w}^{\prime}$ is the attacked watermarked image.
- (4)
The constraints
- (5)
Equilibrium condition
We adopt the concept of the Nash equilibrium and analyze the strategies/actions of the players in the watermarking system. If there has a solution profile $\left({f}_{1}^{*},{f}_{2}^{*}\right)=\left(argmax\left({f}_{1\phantom{\rule{0.25em}{0ex}}\left(.,\phantom{\rule{0.25em}{0ex}}M\right)}\right),argmin\left({f}_{2\phantom{\rule{0.25em}{0ex}}\left(N,.\right)}\right)\right)$, we can say $\left({f}_{1}^{*},{f}_{2}^{*}\right)$ is an equilibrium condition result of the game-theoretic architecture for visible watermarking.
4. Experimental results
The proposed ACOCOA visible watermarking algorithm and game-theoretic architecture have been implemented and intensively tested by using the commonly available color images from USC image database [30] with 512 × 512 images. The image quality metrics for the payoff function are available at the following website: MeTriX MuX Visual Quality Assessment Package [31]. The grayscale watermark of logo image adopted in the experiments is the school logo shown in Figure 1a. Different signal processing and geometric attacks have been thoroughly tested. Due to the limit of enough space to tabulate all attacks, the experimental results show similar behavior which provides the best selection of Nash equilibrium condition under different attacks. The performance analysis can be categorized as follows.
4.1. JPEG2000 compression
Here, we tabulate all details of strategies/actions for encoder and attacker using JPEG2000 compression as attacker's action. Such procedures can be applied to any different attack. The actions for encoder player are V_{j} (s_{1}, ...s_{N} ) where s_{1}, ...s_{N} are different watermark weightings of 0.0, 0.1, 0.2,..., 1.0 for β_{λ,θ} . On the other hand, the actions for attacker player are V_{j} (s_{1}, ...s_{M} ) where s_{1}, ...s_{M} are equivalent to compression ratio of no compression, 0.1, 0.09, ..., 0.01 for total 11 states. The meaning of compression ratio like 0.01 represents 100:1 between the uncompressed image and compressed image. Other settings from 0.1 to 0.02 are with the same operation.
It is the assumption here that the encoder knows the potential attack and it will apply the game theory to obtain the best strategy for watermark embedding. Through detailed examination, the watermark robustness plays an important role for the payoff function so we set the two weighting parameters W_{2} = 0.6 and W_{1} = 0.4 for Equation 8.
The encoder's payoffs and the best selection
Image: Lena | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
M | |||||||||||
Attacker | |||||||||||
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | |
N | |||||||||||
Encoders | |||||||||||
1 | 0.400 | 0.400 | 0.400 | 0.400 | 0.400 | 0.400 | 0.400 | 0.400 | 0.398 | 0.400 | 0.389 |
2 | 0.830* | 0.541 | 0.529 | 0.523 | 0.521 | 0.513 | 0.509 | 0.499 | 0.491 | 0.455 | 0.473 |
3 | 0.809 | 0.634 | 0.620 | 0.604 | 0.600 | 0.586 | 0.581 | 0.567 | 0.546 | 0.520 | 0.486 |
4 | 0.789 | 0.682 | 0.667 | 0.655 | 0.647 | 0.638 | 0.635 | 0.609 | 0.586 | 0.555 | 0.567 |
5 | 0.762 | 0.702 | 0.696 | 0.687* | 0.690* | 0.682* | 0.675 | 0.652 | 0.635 | 0.616 | 0.590 |
6 | 0.734 | 0.704* | 0.697* | 0.683 | 0.685 | 0.681 | 0.684 | 0.676 | 0.663 | 0.618 | 0.611 |
7 | 0.706 | 0.700 | 0.688 | 0.676 | 0.678 | 0.675 | 0.689* | 0.681* | 0.681 | 0.644 | 0.621 |
8 | 0.679 | 0.680 | 0.673 | 0.658 | 0.655 | 0.666 | 0.671 | 0.656 | 0.684* | 0.623 | 0.634* |
9 | 0.652 | 0.656 | 0.644 | 0.639 | 0.645 | 0.656 | 0.656 | 0.641 | 0.684 | 0.644 | 0.623 |
10 | 0.626 | 0.629 | 0.626 | 0.625 | 0.633 | 0.635 | 0.623 | 0.620 | 0.636 | 0.647* | 0.573 |
11 | 0.600 | 0.600 | 0.600 | 0.600 | 0.600 | 0.600 | 0.600 | 0.600 | 0.600 | 0.600 | 0.612 |
The attacker's payoffs and the best selection
Image: Lena | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
M | |||||||||||
Attacker | |||||||||||
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | |
N | |||||||||||
Encoders | |||||||||||
1 | 1.000* | 0.602 | 0.579 | 0.554 | 0.518 | 0.497 | 0.456 | 0.391 | 0.330 | 0.211 | 0.000 |
2 | 1.000 | 0.795 | 0.759 | 0.721 | 0.674 | 0.639* | 0.586 | 0.504 | 0.430 | 0.251 | 0.000 |
3 | 0.946 | 0.914 | 0.869 | 0.825 | 0.775 | 0.739 | 0.678* | 0.582 | 0.489 | 0.305 | 0.000 |
4 | 0.829 | 0.940 | 0.874 | 0.841 | 0.790 | 0.760 | 0.691* | 0.586 | 0.490 | 0.303 | 0.000 |
5 | 0.741 | 0.960 | 0.908 | 0.862 | 0.827 | 0.786 | 0.713* | 0.608 | 0.510 | 0.332 | 0.000 |
6 | 0.653 | 0.977 | 0.913 | 0.869 | 0.828 | 0.779 | 0.711* | 0.611 | 0.522 | 0.329 | 0.000 |
7 | 0.572 | 0.996 | 0.934 | 0.894 | 0.857 | 0.783 | 0.722* | 0.616 | 0.523 | 0.337 | 0.000 |
8 | 0.487 | 1.000 | 0.945 | 0.908 | 0.850 | 0.788 | 0.699* | 0.586 | 0.520 | 0.317 | 0.000 |
9 | 0.413 | 1.000 | 0.941 | 0.925 | 0.877 | 0.793 | 0.674* | 0.589 | 0.531 | 0.332 | 0.005 |
10 | 0.374 | 1.000 | 0.968 | 0.948 | 0.908 | 0.802 | 0.665* | 0.604 | 0.504 | 0.363 | 0.015 |
11 | 0.303 | 1.000 | 0.975 | 0.953 | 0.884 | 0.764 | 0.664* | 0.602 | 0.473 | 0.338 | 0.037 |
Payoff function value for Lena image under JPEG2000 attack and the best selection of (N, M) is (7, 7) under acceptable image quality constraint
Image: Lena | ||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
M | ||||||||||||||||||||||
Attacker | ||||||||||||||||||||||
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | ||||||||||||
N | ||||||||||||||||||||||
Encoders | ||||||||||||||||||||||
1 | 0.40 | 1.00* | 0.40 | 0.60 | 0.40 | 0.58 | 0.40 | 0.55 | 0.40 | 0.52 | 0.40 | 0.50 | 0.40 | 0.46 | 0.40 | 0.39 | 0.40 | 0.33 | 0.40 | 0.21 | 0.39 | 0.00 |
2 | 0.83* | 1.00 | 0.54 | 0.80 | 0.53 | 0.76 | 0.52 | 0.72 | 0.52 | 0.67 | 0.51 | 0.64* | 0.51 | 0.59 | 0.50 | 0.50 | 0.49 | 0.43 | 0.46 | 0.25 | 0.47 | 0.00 |
3 | 0.81 | 0.95 | 0.63 | 0.91 | 0.62 | 0.87 | 0.60 | 0.83 | 0.60 | 0.78 | 0.59 | 0.74 | 0.58 | 0.68* | 0.57 | 0.58 | 0.55 | 0.49 | 0.52 | 0.31 | 0.49 | 0.00 |
4 | 0.79 | 0.83 | 0.68 | 0.94 | 0.67 | 0.87 | 0.66 | 0.84 | 0.65 | 0.79 | 0.64 | 0.76 | 0.64 | 0.69* | 0.61 | 0.59 | 0.59 | 0.49 | 0.56 | 0.30 | 0.57 | 0.00 |
5 | 0.76 | 0.74 | 0.70 | 0.96 | 0.70 | 0.91 | 0.69* | 0.86 | 0.69* | 0.83 | 0.68* | 0.79 | 0.68 | 0.71* | 0.65 | 0.61 | 0.64 | 0.51 | 0.62 | 0.33 | 0.59 | 0.00 |
6 | 0.73 | 0.65 | 0.70* | 0.98 | 0.70* | 0.91 | 0.68 | 0.87 | 0.69 | 0.83 | 0.68 | 0.78 | 0.68 | 0.71* | 0.68 | 0.61 | 0.66 | 0.52 | 0.62 | 0.33 | 0.61 | 0.00 |
7 | 0.71 | 0.57 | 0.70 | 1.00 | 0.69 | 0.93 | 0.68 | 0.89 | 0.68 | 0.86 | 0.68 | 0.78 | 0.69* | 0.72* | 0.68* | 0.62 | 0.68 | 0.52 | 0.64 | 0.34 | 0.62 | 0.00 |
8 | 0.68 | 0.49 | 0.68 | 1.00 | 0.67 | 0.95 | 0.66 | 0.91 | 0.66 | 0.85 | 0.67 | 0.79 | 0.67 | 0.70* | 0.66 | 0.59 | 0.68* | 0.52 | 0.62 | 0.32 | 0.63* | 0.00 |
9 | 0.65 | 0.41 | 0.66 | 1.00 | 0.64 | 0.94 | 0.64 | 0.93 | 0.65 | 0.88 | 0.66 | 0.79 | 0.66 | 0.67* | 0.64 | 0.59 | 0.68 | 0.53 | 0.64 | 0.33 | 0.62 | 0.01 |
10 | 0.63 | 0.37 | 0.63 | 1.00 | 0.63 | 0.97 | 0.63 | 0.95 | 0.63 | 0.91 | 0.64 | 0.80 | 0.62 | 0.67* | 0.62 | 0.60 | 0.64 | 0.50 | 0.65* | 0.36 | 0.57 | 0.02 |
11 | 0.60 | 0.30 | 0.60 | 1.00 | 0.60 | 0.98 | 0.60 | 0.95 | 0.60 | 0.88 | 0.60 | 0.76 | 0.60 | 0.66* | 0.60 | 0.60 | 0.60 | 0.47 | 0.60 | 0.34 | 0.61 | 0.04 |
Payoff function value for Tiffany image under JPEG2000 attack and the best selection of (N, M) is (6, 8) under acceptable image quality constraint
Image: Tiffany | ||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
M | ||||||||||||||||||||||
Attacker | ||||||||||||||||||||||
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | ||||||||||||
N | ||||||||||||||||||||||
Encoders | ||||||||||||||||||||||
1 | 0.40 | 1.00* | 0.40 | 0.59 | 0.40 | 0.57 | 0.40 | 0.53 | 0.40 | 0.50 | 0.40 | 0.48 | 0.40 | 0.44 | 0.40 | 0.38 | 0.40 | 0.30 | 0.40 | 0.19 | 0.39 | 0.00 |
2 | 0.81 | 1.00 | 0.54 | 0.74 | 0.52 | 0.69 | 0.53 | 0.66 | 0.52 | 0.62* | 0.52 | 0.60 | 0.51 | 0.55 | 0.49 | 0.46 | 0.49 | 0.36 | 0.48 | 0.23 | 0.45 | 0.00 |
3 | 0.84* | 0.97 | 0.65 | 0.88 | 0.63 | 0.84 | 0.62 | 0.77 | 0.61 | 0.72 | 0.61 | 0.70 | 0.59 | 0.65* | 0.58 | 0.56 | 0.55 | 0.43 | 0.52 | 0.26 | 0.50 | 0.00 |
4 | 0.81 | 0.86 | 0.69 | 0.93 | 0.69 | 0.89 | 0.68 | 0.83 | 0.67 | 0.78 | 0.66 | 0.75 | 0.64 | 0.68* | 0.64 | 0.60 | 0.61 | 0.45 | 0.58 | 0.29 | 0.54 | 0.00 |
5 | 0.77 | 0.74 | 0.71* | 0.96 | 0.70* | 0.90 | 0.69* | 0.83 | 0.69 | 0.79 | 0.69 | 0.77 | 0.68 | 0.71 | 0.68 | 0.61* | 0.64 | 0.46 | 0.62 | 0.30 | 0.60 | 0.00 |
6 | 0.74 | 0.63 | 0.71 | 0.98 | 0.70 | 0.92 | 0.69 | 0.86 | 0.70* | 0.83 | 0.69* | 0.81 | 0.70* | 0.72 | 0.70* | 0.63* | 0.67* | 0.48 | 0.64 | 0.31 | 0.63* | 0.00 |
7 | 0.71 | 0.54 | 0.69 | 1.00 | 0.69 | 0.92 | 0.68 | 0.89 | 0.68 | 0.86 | 0.68 | 0.81 | 0.68 | 0.71* | 0.69 | 0.60 | 0.67 | 0.48 | 0.66 | 0.33 | 0.61 | 0.00 |
8 | 0.68 | 0.43 | 0.68 | 1.00 | 0.67 | 0.92 | 0.67 | 0.89 | 0.67 | 0.87 | 0.67 | 0.81 | 0.67 | 0.70* | 0.68 | 0.56 | 0.66 | 0.46 | 0.67* | 0.32 | 0.62 | 0.00 |
9 | 0.65 | 0.34 | 0.65 | 1.00 | 0.65 | 0.93 | 0.64 | 0.91 | 0.64 | 0.87 | 0.65 | 0.82 | 0.66 | 0.71* | 0.67 | 0.57 | 0.65 | 0.47 | 0.66 | 0.32 | 0.61 | 0.01 |
10 | 0.63 | 0.27 | 0.62 | 1.00 | 0.62 | 0.93 | 0.62 | 0.92 | 0.62 | 0.89 | 0.62 | 0.80 | 0.63 | 0.67* | 0.63 | 0.54 | 0.63 | 0.48 | 0.63 | 0.32 | 0.60 | 0.03 |
11 | 0.60 | 0.20 | 0.60 | 1.00 | 0.60 | 0.95 | 0.60 | 0.93 | 0.60 | 0.89 | 0.60 | 0.79 | 0.60 | 0.65* | 0.60 | 0.54 | 0.60 | 0.49 | 0.60 | 0.31 | 0.60 | 0.04 |
Performance summaries of watermarked color images before and after JPEG 2000 compression at compression ratio 100:3
Method | MSSIM | VIF | PSNR-HVS-M (dB) | WSNR (dB) | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
A(1) | A(2) | A(3) | B(1) | B(2) | B(3) | C(1) | C(2) | C(3) | D(1) | D(2) | D(3) | |
Lena | ||||||||||||
Before | 0.933 | 0.943 | 0.973 | 0.693 | 0.599 | 0.718 | 22.685 | 27.462 | 30.056 | 21.598 | 28.129 | 29.592 |
After | 0.912 | 0.927 | 0.954 | 0.326 | 0.306 | 0.357 | 22.092 | 26.420 | 28.036 | 21.213 | 27.337 | 28.100 |
After (wm) | 0.971 | 0.969 | 0.968 | 0.467 | 0.465 | 0.378 | 32.047 | 31.605 | 31.859 | 34.588 | 34.276 | 34.478 |
Tiffany | ||||||||||||
Before | 0.910 | 0.931 | 0.975 | 0.664 | 0.572 | 0.733 | 24.008 | 27.869 | 32.861 | 27.167 | 32.968 | 36.949 |
After | 0.885 | 0.910 | 0.952 | 0.287 | 0.273 | 0.344 | 23.625 | 27.186 | 30.286 | 27.039 | 32.453 | 35.031 |
After (wm) | 0.966 | 0.964 | 0.966 | 0.453 | 0.451 | 0.364 | 32.364 | 32.016 | 32.712 | 38.579 | 38.572 | 39.148 |
4.2. Median filter
Applying the same approaches under proposed game-theoretical architecture, the attacks in StirMark [32] have been thoroughly tested and we have found that the experimental results show similar behavior, which provides the best selection of Nash equilibrium under different attacks. Due to the limited space to tabulate all attacks, we only explain median filter attack here but the scheme can be applied for other attacks.
Performance summaries of watermarked color images before and after 7 × 7 median filtering
Method | MSSIM | VIF | PSNR-HVS-M (dB) | WSNR (dB) | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
A(1) | A(2) | A(3) | B(1) | B(2) | B(3) | C(1) | C(2) | C(3) | D(1) | D(2) | D(3) | |
Lena | ||||||||||||
Before | 0.933 | 0.943 | 0.973 | 0.693 | 0.599 | 0.718 | 22.685 | 27.462 | 30.056 | 21.598 | 28.129 | 29.592 |
After | 0.888 | 0.913 | 0.923 | 0.255 | 0.256 | 0.272 | 16.772 | 18.914 | 18.497 | 15.857 | 18.329 | 17.766 |
After (wm) | 0.946 | 0.940 | 0.942 | 0.535 | 0.512 | 0.501 | 20.260 | 20.231 | 20.186 | 20.718 | 20.463 | 20.586 |
Tiffany | ||||||||||||
Before | 0.910 | 0.931 | 0.975 | 0.664 | 0.572 | 0.733 | 24.008 | 27.869 | 32.861 | 27.167 | 32.968 | 36.949 |
After | 0.867 | 0.929 | 0.904 | 0.203 | 0.209 | 0.215 | 19.184 | 19.405 | 18.704 | 23.219 | 23.484 | 22.518 |
After (wm) | 0.940 | 0.904 | 0.929 | 0.548 | 0.510 | 0.492 | 19.565 | 19.681 | 19.715 | 23.798 | 23.935 | 24.101 |
4.3. Image recovery and watermark removal attack
4.4. Discussions
- (1)
Multiple equilibrium conditions
Summary of best selections under JPEG2000 attack for Nash equilibrium solution
Image | Attack |
---|---|
JPEG 2000 | |
Peppers | (7,7),(6,8) |
Baboon | (8,7),(2,1) |
Splash | (6,7),(5,8) |
- (2)
New types of attack actions
- (3)
Multiple attack actions
- (4)
The weighting parameters
- (6)
Selected best parameters for different attacks
- (7)
The computation time for using game-theoretic architecture for ACOCOA watermarking
The computation time for using game-theoretic architecture is determined by each player's strategies/actions and payoffs. The whole complexity should be examined by calculating each individual visual quality metric's computation.
For VIF, the fastest way of computing the determinant of a matrix is actually to use good old Gaussian elimination [34]. The determinant of a triangular matrix is simply the product of the diagonal elements. Every matrix can be reduced to a triangular matrix through elementary row operations, and all of these change the determinant in an easily predictable manner. The complexity of VIF is closely related with Equations A2 and A4 and the total amount of calculation approximately equals to the image size (we can use static array to store the results). Thus, the complexity of variance takes O(n^{2}) computation and the natural logarithm operation also takes roughly O(log n). Hence, the complexity of mutual information between X and its perceptual image Y can be computed as O(n^{3}logn) (O(n • n^{2} • logn)) ≈ O(n^{2} • logn) for n × n image size.
The complexity of image visual quality metric for a n × n testing image
Image visual quality metric | Complexity |
---|---|
VIF | ≈ O(n^{3}log n) |
MSSIM | ≈ O(n^{2}) |
PSNR-HVS-M | ≈ O(n^{3} log n) |
WSNR | ≈ O(n^{2}) |
Correlation | ≈ O(n^{2}) |
From our simulation of JPEG 2000 compression, encoder player has N = 11 strategies and its payoff needs to calculate five different values of image quality (MSSIM, VIF, PSNR-HVS-M, WSNR, and correlation). In the mean time, attack player has M = 11 strategies and its payoff needs to calculate four different values of image quality (MSSIM, VIF, PSNR-HVS-M, and WSNR).
The average computation time for each image visual quality metric
Image visual quality metric | Computation time (s) |
---|---|
VIF | 3.7828144 |
MSSIM | 0.2330334 |
PSNR-HVS-M | 2.3939420 |
WSNR | 0.1506786 |
Correlation | 0.0399120 |
5. Conclusions
The researchers have been working hard to pursue the visible digital watermarking techniques for copyright protection. There are two essential characteristics: first, robustness for common signal processing operations and the second, perceptual translucence of the watermark with acceptable image quality. Since these two issues are correlated closely, how to find the best parameter settings has become a critical factor for the watermarking applications.
In order to resolve these concerns, the ACOCOA technique and a security watermarking system, which is based on game-theoretic approach that provides the best selection for the decision maker, are proposed by studying the effect of transmission power on intensity and perceptual efficiency. The game-theoretic architecture helps us to analyze the watermarking competition game between the encoder and the attacker. In the mean time, it also provides the solution to acquire the best selection between watermark transparency and robustness for digital contents in different strategies/actions with complete information in the dynamic non-cooperative situations.
After thorough simulation and examination, the experimental results demonstrate that the proposed scheme can provide the useful information for the encoder to determine the best watermarking strategy. On the other hand, further investigations of research topics are suggested to get more precise inter-relationship among constituted components of payoff functions for the players. In summary, the proposed game-theoretic technique provides a useful decision methodology for encoder who can make the best selection among choices. Accordingly, our research could help each player to maximize its utility benefits under different situation and resolve the security issue of visual communication.
Appendix
Formulas of image quality measures
Here are the brief descriptions of the image quality measures (IQM) formulas used for payoff function in this study. Interested readers should refer the references for the detailed information.
A.1. VIF [22, 35]
where V is the vision noise and obeys normal distribution with zero mean and ${\sigma}_{V}^{2}$.
A.2. MSSIM [25]
where X and Y are the reference and the distorted images respectively; x_{j} , y_{j} are the image contents at the j th local window and M is the number of local windows in the image.
with
μ_{x} the average of x; μ_{y} the average of y;
${\sigma}_{x}^{2}$ the variance of x;${\sigma}_{y}^{2}$ the variance of y;
σ_{xy}the covariance of x and y;
C_{1} and C_{2} are two variables to stabilize the division with weak denominator. Typically, it is calculated on window-sizes of 8 × 8.
A.3. PSNR-HVS-M [26, 27]
where X_{ij} is a DCT coefficient with indices i,j, C_{ij} is a correcting factor determined by the CSF.
The DCT coefficients X and Y are visually undistinguished if E_{w} (X - Y) < max (E_{w}(X)/16, E_{w} (Y)/16), where E_{w} (X)/16 is a masking effect E_{m} of DCT coefficients X (normalizing factor 16 has been selected experimentally).
where $\delta \left(D\right)=\left(V\left({D}_{1}\right)+V\left({D}_{2}\right)+V\left({D}_{3}\right)+V\left({D}_{4}\right)\right)\u22154V\left(D\right)$, V(D) is the variance of the pixel values in block D.
where E_{norm} is $\sqrt{{E}_{max}\u221564}$.
A.4. WSNR [28]
where x_{n} and y_{n} denote the original image and the noisy image. * denotes linear convolution and c(x_{n} ) is CSF in the spatial domain.
Acknowledgements
This work was partially supported by the National Science Council in Taiwan, Republic of China, under Grant NSC99-2410-H-009-053-MY2.
Supplementary material
Copyright information
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.