Veysel Aslanta, M Do ru

Transkript

1 Veysel Aslanta, MDoru, Genetik Algoritma (GA) kullanarak (Singular Value Decomposition - SVD) resim Ç (scaling factors - SFs) kullanarak alues - SVs) metotta, maksimum optimize maksimum saydam da S Anahtar Kelimeler Abstract In this paper, a novel fragile image watermarking scheme based on SVD using GA is presented. Watermark of every line is scaled by using multiple SFs. Host image is divided into blocks. Watermarked image is obtained by embedding a different line of watermark to SVs of the every block. In this proposed method, the SFs are optimized using GA to achieve maximum transparency. Experimental results indicate that reached the highest transparency. Fragility detected under various attacks. When an attack does not occur exactly the original embedded watermark is achieved or else the embedded watermark is intensely corrupted. Index Terms Genetic Algorithm, Fragile Image Watermarking, Singular Value Decomposition. I. AYISAL S unun -4]. ; resim ve frekans Bilgisayar T( aslantas@erciyes.edu.tr)., Bilgi, Ankara, T ( mevlut_dogru@milliemlak.gov.tr). 10 Cosine Transform - (Discrete Wavelet Transform - eklenerek [2,5-7]. ; verinin [2]. - n etkilenmemelidir -, olabilmelidir [6,8,9 SVD, damgalama dahil bir teknikleri [10-12], de maliyet fonksiyonu - damgalama [13] - teknikleri de mevcuttur. O damgalama metotlar ve bu makalede e Bu gri seviye resimler rak leri ler Damga ekleme leri en

2 TABLO I METOT VE BAZI METOTLARIN MASI Teknik ve Algoritma Aslantas vd. (2007) Aslantas vd. (2008) GA, PSO, KSA, Diferansiyel Aslantas vd. (2009) SVD - GA Modaghegh vd. (2009) SVD GA II. SVD TABANLI DAMGALAMA SVD ile NxN A matrisi A=USV T olacak NxN U ve V T ortogonal matris, NxN boyutndaki S S matrisi, A [5,6]. A. Orijinal resim (IW NxN ve Mx2M (N>2da Burada, W i i. I (m,n) ise b m. n. 1) Orijinal resim M/2xM/2. 2) (1) (2) 3) S (m,n) B. Damga SVD nde 1) resim, T (m,n) (m,n) (m,n) (6) 2) 3) W * ) elde edilir. III. NIN TEMEL YAPISI 16 uygunluk prazlama ve mutasyon) inden durdurma kriteri, maliyet fonksiyonu ve parametreler da bir dizi, o her bir dizinin uygunluk lendirmesi, maliyet fonksiyonuna Rastgele sretici (7) (8) 4) (3) Seleksiyon = U (m,n) S * (m,n)v T (m,n) (4) 5) I W ) elde edilir. (5) Mutasyon Durdurma kriteri Evet Bitir 1. 11

3 Uygunluk seleksiyon fonksiyonunu yerine getirir. Bireyleri temsil eden dizilerden an sonraki crossover rate - CR) utation rate - eyi temsil Orijinal resim D a m g a k IV. GA VE SVD TABANLI KIRILGAN DAMGALAMA GA, F lere uygulanarak II. damgalanmii. ikili (binary) olanlara 0, 0.5 ve daha olanlara ise 1 atanarak yeniden ikili ve ortalama filtreleme (O corr I ) sayesinde orijinal - BCR) sayesinde de ; W t W * t M W N W, simgesi ise lojik XOR BCR [17]. BCR = (9) Korelasyon ve BCR maliyet fonksiyonu denklem (10 s, Burada t f i ise i. jenerasyondaki maliyet f i = (10) I W I W* Son jenerasyon Evet. V. damga olarak, 3 64 boyutundaki orijinal ikili resmin 32k bloklar mesiyle o ve 3 256x8ik ikili Kaynak resim olarak da 3 resim ve ktedir. Her uygulamadan e de Test ), DN (bilineer: 3 0 ), GG ve OF 500, seleksi mutasyon, mutasyon W 12

4 3. Orijinal damga,. 4. Orijinal BaboonBaboon. 5. Orijinal GemiGemi. TABLO III T SF'LER corr I BCR Baboon GA SF'ler Gemi 1 99,6582 Baboon Gemi Sabit SF'ler , , , , , , , , , , ; jenerasyon sonucunda optimi korelasyon ve BCR resimde corr I BCR esminde de BCR GA ile eld1, 20, 40 sabit II g corr I 1 BCR corr I BCR 6. Baboon Gemien. Baboon Gemi YO DN (c) GG (d) OF 7. TABLO II VE corr I BCR YO DN GG OF Baboon , , , ,8340 Gemi 1 99, , , , ,5664 VI., yeni bir resim damgalama leri ler ekle Deneysel testler, GA ile optimize edilen sabit orijinal resim ile., YO, DN, GG ve O. 13

5 KAYNAKLAR [1] F. Hartung, and M. Kutter Proc. IEEE 1999; 87: [2] V. Potdar, S. Han, and E. Chang survey of digital image watermarking t conference on industrial informatics (INDIN 2005), Perth Western Australia, Aug [3] F. A. P. Petitcolas, R. J. Anderson, and M. G. Kuhn, hiding 78. [4] B. L. Gunjal, and R. R. Manthalkar, An overview of transform domain robust digital image watermarking algorithms, Journal of Emerging Trends in Computing and Information Sciences, vol. 2, no 1, CIS Journal [5] V. Aslantas, An SVD based digital image watermarking using genetic algorithm, International Conference on Information Sciences, Signal Processing and its App., ISSPA2007, Sharjah, U.A.E., [6] V. Aslantas, An optimal robust digital image watermarking based on SVD using differential evolution algorithm, Optics Communications 282, , [7] D. Arya, urvey of frequency and wavelet domain digital watermarking t ntific & Engineering Research, vol. 1, iss. 2, Nov [8] E. Hussein, and M. A. atermarking techniques, applications and attacks applied to digital media: A s International Journal of Engineering Research & Technology (IJERT), ISSN: , vol. 1, no 7, Sep [9] M. H. Hassan, and S. A. M. Gilani emi-fragile watermarking scheme for color image a Engineering and Technology 19, [10] V. Aslantas, S. Ozer, and S. Ozturk, ovel clonal selection algorithm based fragile watermarking m- 369, [11] V. Aslantas, S. Ozer, and S. Ozturk, ovel fragile watermarking based on particle swarm o Multimedia and Expo, Hannover, Germany, , [12] V. Aslantas, S. Ozer, and S. Ozturk, "Improving the performance of -based fragile watermarking using intelligent optimization algorithms" Optics Commun., vol. 282, no 14, , [13] H. Modaghegh, R. H. Khosravi, and M. R. Akbarzadeh-T, adjustable blind w Innovations'09: 6th International Conference on Innovations in Information Technology, Dec [14] watermarking enhancement for satellite images using a Cryptology, Turkey, May [15] based on double density dual-tree discrete wavelet transform in Conference on Information Security & Cryptology, Turkey, May [16] J. H. introductory analysis with applications to biology, control and [17] S. C. Chu, H. C. Huang, Y. Shi, S. Y. Wu, and C. S. Shieh, watermarking for zerotree-based a and Multimedia Security, Circuits Syst Signal Process, 27: , ardiff ya. ru timine. SGK Bilgi n, 14