EURASIP Journal on Advances in Signal Processing

Table 4 The attacker's payoffs and the best selection

From: A game-theoretic architecture for visible watermarking system of ACOCOA (adaptive content and contrast aware) technique

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

Note:
(1) The constraint for attacker of acceptable image quality μ = 0.626.
(2) The bold numbers mean the values are large than the constraint.
(3) * means the best selection from attacker's payoffs.

Back to article page