А -Е Е Е А Ы Е , Е А ию ь–а 2015 о 15 № 4 ISSN 2226-1494 http://ntv.ifmo.ru/
SCIENTIFIC AND TECHNICAL JOURNAL OF INFORMATION TECHNOLOGIES, MECHANICS AND OPTICS July–August 2015 Vol. 15 No 4 ISSN 2226-1494 http://ntv.ifmo.ru/en
004.056
Ы
JPEG-
Ы
Ы
,
Ы
Ы
. . a
a , - , 197101,
: Batu-vladimir@yandex.ru
06.05.15, 25.05.15 doi:10.17586/2226-1494-2015-15-4-708-715
–
: . . JPEG- ,
// - , . 2015. . 15. № 4.
. 708–715.
.
JPEG-, . .
-,
-.
JPEG. .
, , ,
-, . Elham,
JPEG- . 9
.
, 43 .
,
0,5. :
Elham ;
; .
-,
-. .
, .
,
JPEG- , , . .
-.
, , JPEG, , .
. . ., . .
.
INCREASE OF STABILITY AT JPEG COMPRESSION OF THE DIGITAL
WATERMARKS EMBEDDED IN STILL IMAGES
V.A. Baturaa
a
ITMO University, Saint Petersburg, 197101, Russian Federation Corresponding author: Batu-vladimir@yandex.ru
Article info
Received 06.05.15, accepted 25.05.15 doi:10.17586/2226-1494-2015-15-4-708-715 Article in Russian
For citation: BaturaV.A. Increase of stability at jpeg compression of the digital watermarks embedded in still images. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2015, vol.15, no. 4, pp. 708-715.
Abstract
embeds digital watermark into a still image via modification of frequency coefficients for Hadamard discrete transformation is presented. The choice of frequency coefficients for embedding of a digital watermark is based on existence of sharp change of their values after modification at the maximum compression of JPEG. The choice of blocks of pixels for embedding is based on the value of their entropy. The new algorithm was subjected to the analysis of resistance to an image compression, noising, filtration, change of size, color and histogram equalization. Elham algorithm possessing a good resistance to JPEG compression was chosen for comparative analysis. Nine gray-scale images were selected as objects for protection. Obscurity of the distortions embedded in them was defined on the basis of the peak value of a signal to noise ratio which should be not lower than 43 dB for obscurity of the brought distortions. Resistibility of embedded watermark was determined by the Pearson correlation coefficient, which value should not be below 0.5 for the minimum allowed stability. The algorithm of computing experiment comprises: watermark embedding into each test image by the new algorithm and Elham algorithm; introducing distortions to the object of protection; extracting of embedded information with its subsequent comparison with the original. Parameters of the algorithms were chosen so as to provide approximately the same level of distortions introduced into the images. Main Results. The method of preliminary processing of digital watermark presented in the paper makes it possible to reduce significantly the volume of information embedded in the still image. The results of numerical experiment have shown that the proposed algorithm keeps higher resistance to JPEG compression, noising, Wiener filtering and brightness change. Practical Relevance. The proposed algorithm is applicable for copyright protection on the still images.
Keywords
Hadamard transformation, digital watermarking, JPEG compression, digital watermark, steganography. Acknowledgements
The author expresses gratitude to A.Yu. Tropchenko, D.Sc., Professor of Chair of Computation Technologies, ITMO University, for useful recommendations when carrying out research.
–
, .
( ) ( , -,
).
[1].
,
.
, .
, , JPEG JPEG2000. JPEG,
, , ,
JPEG . JPEG2000
-, JPEG,
-.
.
( ) [2, 3] - [4–6].
( ) [7–14],
- :
1
N
N N N
F A X A
N
, (1)
N – ; AN – ,
1 –1; XN – ; FN –
-.
, . . T
N N
A A .
, .
N = 2n , n – ,
-:
2 2
N N
N N
N N
A A
A A A
A A
,
1 1
1 1
2
A .
. , [7–14],
JPEG- Elham [14],
JPEG .
,
JPEG.
-
. ,
-. .
.
JPEG Q = 0 ( . 1).
. 1. я
JPEG
JPEG- . JPEG
,
cꞌ= round(c / q) × q,
round – , с – , cꞌ –
-, q – .
Q = 0 255.
c/255 0,5,
-.
( . 1).
, , .
,
Q = 0. :
7 7
0 0
( , ) 2 1 2 1
( , ) ( , ) cos cos
4 x y 16 16
c u v x y
D u v f x y u v
,с(u,v) – , 1/2 u=0 v=0
.
( . 1)
JPEG- .
, .
(y, x) 8×8
-: 1,5; 5,1; 1,7; 5,5; 7,1; 3,1; 7,5; 5,7; 1,3; 1,4; 5,3; 7,7; 3,5; 4,1. (y, x): 1,2; 2,1; 3,1; 2,2; 1,3; 1,4; 2,3; 3,2; 4,1; 5,1; 4,2; 3,3; 2,4; 1,5.
щ .
– , . 2.
100 95 90 85 80 75 70 65 60 55 50 45 40 35 30 25 20 15 10 5 0
JPEG 1300
1250
1200
1150
1100
1050
1000
. 2. щ я
.
1. ,
-:
1 1
mod 1 2
y y
N
x x
,
N – ; (y, x) – ; (yꞌ, xꞌ) –
.
2. 90°
-, .
0 1.
3. ,
( ), .
4. ( ),
, . 1.
L/n n≥ 0,39 × x 0,16 × x≤n≤ 0,39 × x n < 0,16 × x
L0 round(0,39 × x) ceil(count/4) – 1 n
L1 round(0,125 × x)
1.
x – ; n – ; L0 – «0» ; L1 –
«1» ; ceil – ; round – .
, .
(
-).
- .
«1». «1» ,
-, .
1. 8×8;
2. 8×8, (E) E1.
[7]
1
exp(1 ) n
i i
i
E p p
,pi – i .
-p [0; 1]. 1.
-p i ,
i [16].
3. (1).
4. .
5. «1»
i
с = ci + sign × α,
sign – α c ci; сi
– .
6. M .
«0» – «1»,
.
M, i, i = 1, 2,
3, ... . ,
-. : M(1,i)
M(2,i) – (y, x) 8×8; M(3,i) M(4,i) – (yc, xc) ; M(5,i) – sign; M(6,i) –
-.
M. :
M(5, i) = –1
1, ( [ (3, ), (4, )] 50),
0, ( [ (3, ), (4, )] 50),
i i i
i i
если с c M i M i
w
если с c M i M i
M(5, i) = 1
1, ( [ (3, ), (4, )] 50),
0, ( [ (3, ), (4, )] 50),
i i i
i i
если с c M i M i
w
если с c M i M i
wi – ; ci – ; сi –
. .
. - ,
90° . :
2 1
mod
1 1
y y
N
x x
,
N – ; (y, x) – ; (yꞌ, xꞌ) –
.
,
:
(JPEG, JPEG2000), , , ,
.
-.
Elham [14],
JPEG.
-, .
.
9 512×512,
.
-- 64×64 ( . 3).
. 3. я
– (PSNR), ( )
2 ,
2 ,
255 10 lg
ˆ
( ( , ) ( , ))
M N
x y
M N PSNR
f x y f x y
,( , )
f x y – ; ˆ ( , )f x y – ; x, y – ; M N –
. , PSNR ≥ 43 .
2
2( ( , ) ) ( ( , ) )
( ( , ) ) ( ( , ) )
m m
c r
m m
c r c r
A c r A B c r B k
A c r A B c r B
,
c, r – ; A(c, r) – ; B(c, r) –
-; Am, Bm – .
–1 1. k = 1
. ,
-, k ≥ 0,5. .
Elham . ( )
-.
.
, 9 , .
( ). ( . 3)
64×64, 54×54, 44×44, 34×34 24×24 105
-. ,
– 0,5.
0,2k<0,5 .
( . 3) 88%
. (
-) 105 0,5.
, . 64×64
0,001% 105
. 24×24
1,275% 105 . ,
,
-.
PSNR 9 43,2218 ,
-. Elham
PSNR, 43,2104 .
, Elham,
JPEG ( . 4, ). 99%
Q. Q, 6 3,
JPEG ( . 1).
Elham JPEG2000 ( . 4, )
1:67.
я
JPEG 100 95 90 85 80 75 70 65 60 55 50 45 40 35 30 25 20 15 10
5 0
Elham 1
0,9
0,8
0,7
0,6
0,5
0,4
0,3
JPEG2000 1 5 9 13 17 21 25 29 33 37 41 45 49 53 57 61 65
Elham 1
0,9
0,8
0,7
0,6
0,5
0,4
Elham . 2.
( )
Elham [11]
( )
0,01 0,8887 0,7157
0,02 0,7082 0,5857
0,03 0,5909 0,5065
0,04 0,5126 0,4506
« » 0,02 0,9452 0,7983
0,06 0,7308 0,5872
0,08 0,6358 0,5217
0,1 0,5627 0,4671
2×2 0,6124 0,5999
3×3 0,8651 0,8495
4×4 0,3979 0,4519
2×2 0,9937 0,8994
3×3 0,9676 0,9420
8×8 0,5416 0,4267
0,8 0,9218 0,6699
1,2 0,9978 0,8106
1,4 0,9020 0,6423
1,6 0,5731 0,5293
50% 0,9296 0,9396
35% 0,5920 0,6414
– 0,5488 0,5518
2. Elham
«
-».
0,07, .
8×8,
75% 160%.
,
Elham.
JPEG- .
-.
,
-, ,
.
-,
-.
,
.
References
1. Gribunin V.G., Okov I.N., Turintsev V.I. Tsifrovaya Steganografiya [Digital Steganography]. Moscow, SOLON-Press Publ., 2002, 272 p.
2. Wu X., Sun W. Robust copyright protection scheme for digital images using overlapping DCT and SVD.
Applied Soft Computing Journal, 2013, vol. 67, no. 2, pp. 1170–1182. doi: 10.1016/j.asoc.2012.09.028 3. Patra J.C., Phua J.E., Bornand C. A novel DCT domain CRT-based watermarking scheme for image
authentication surviving JPEG compression. Digital Signal Processing: A Review Journal, 2010, vol. 20, no. 6, pp. 1597–1611. doi: 10.1016/j.dsp.2010.03.010
4. Bhatnagar G., Jonathan Wu Q.M. A new logo watermarking based on redundant fractional wavelet transform. Mathematical and Computer Modelling, 2013, vol. 58, no. 1–2, pp. 204–218. doi: 10.1016/j.mcm.2012.06.002
6. Maheswari S., Rameshwaran K. Robust blind complex double Haar wavelet transform based watermarking algorithm for digital images. IACSIT International Journal of Engineering and Technology, 2011, vol. 3, no. 6, pp. 638–645.
7. Maity S.P., Kundu M.K. DHT domain digital watermarking with low loss in image informations. AEU – International Journal of Electronics and Communications, 2010, vol. 64, no. 3, pp. 243–257. doi: 10.1016/j.aeue.2008.10.004
8. Maity S.P., Kundu M.K. Perceptually adaptive spread transform image watermarking scheme using Hadamard transform. Information Sciences, 2011, vol. 181, no. 3, pp. 450–465. doi: 10.1016/j.ins.2010.09.029
9. Saryazdi S., Nezamabadi-pour H. A blind digital watermark in Hadamard domain. International Journal of Computer, Information, Systems and Control Engineering, 2007, vol. 1, no. 3, pp. 784–787.
10.Bhatnagar G., Raman B. Robust watermarking in multiresolution Walsh-Hadamard transform. 2009 IEEE International Advance Computing Conference, IACC 2009. Patiala, India, 2009, art. 4809134, pp. 894–899. doi: 10.1109/IADCC.2009.4809134
11.Sarker I.H., Iqbal S. Content-based image retrieval using Haar wavelet transform and color moment. Smart Computing Review, 2013, vol. 3, no. 3, pp. 155–165.
12.Ho A.T.S., Shen J., Tan S.H. A character-embedded watermarking algorithm using the fast Hadamard transform for satellite images. Proceedings of SPIE – The International Society for Optical Engineering, 2002, vol. 4793, pp. 156–167. doi: 10.1117/12.451249
13.Latif A., Rashidi F. A watermarking scheme based on the parametric slant-hadamard transform. Journal of Information Hiding and Multimedia Signal Processing, 2011, vol. 2, no. 4, pp. 377–386.
14.Shabanali Fami E., Samavi S., Rezaee Kaviani H., Molaei Radani Z. Adaptive watermarking in Hadamard transform coefficients of textured image blocks. Proc. 16th International Symposium on Artificial Intelligence
and Signal Processing, AISP 2012. Shiraz, Iran, 2012, vol. 181, pp. 503–507. doi:
10.1109/AISP.2012.6313799
15.Batura V.A., Tropchenko A.Yu. Sravnitel'nyi analiz effektivnosti ispol'zovaniya ortogonal'nykh preobrazovanii v chastotnykh algoritmakh markirovaniya tsifrovykh izobrazhenii [Comparative analysis of application efficiency of orthogonal transformations in frequency algorithms for digital image watermarking]. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2014, no. 6 (94), pp. 106–112.
16.Yavna D.V., Babenko V.V. Psikhofiziologicheski obosnovannyi metod otsenki kolichestva informatsii v izobrazhenii [Psychophysiologically motivated method for estimating the amount of information in an image]. Inzhenernyi Vestnik Dona, 2014, vol. 31, no. 4–1, p. 116.
а а а и и а вич – , , - , 197101,
, Batu-vladimir@yandex.ru
Vladimir A. Batura – Postgraduate, ITMO University, Saint Petersburg, 197101, Russian