240 likes | 378 Views
Adaptive Data Hiding in Edge Areas of Images With Spatial LSB Domain Systems. Adviser: Chih-Hung Lin Speaker : Chia-Wei Chang Date:2009/10/06. Introduce of Author. Author: Cheng-Hsing Yang, Chi-Yao Weng, Shiuh-Jeng Wang and Hung-Min Sun .
E N D
Adaptive Data Hiding in Edge Areas of ImagesWith Spatial LSB Domain Systems Adviser: Chih-Hung Lin Speaker:Chia-Wei Chang Date:2009/10/06
Introduce of Author • Author:Cheng-Hsing Yang, Chi-Yao Weng, Shiuh-Jeng Wangand Hung-Min Sun. • IEEE Transactions on Information Forensics and Security, vol. 3, no. 3, september 2008. • C.-H. Yang is with the Department of Computer Science, National Pingtung University of Education, Pingtung, 900, Taiwan. • C.-Y. Weng and H. M. Sun are with the Department of Computer Science, National Tsing-Hua University, Hsinchu, 300, Taiwan, R.O.C. • S.-J. Wang, corresponding author, is with the Department of Information Management, Central Police University, Taoyuan, 333, Taiwan, R.O.C. • Manuscript received November 1, 2007; revised March 12, 2008. Published August 13, 2008 (projected).
Outline • Introduction • Literature Review • Proposed Method • Embedding Procedure • Data Extraction • Experimental Results • Conclusions
I.Introduction • Embedding = embedding
I.Introduction • In 2003, Wu and Tsai proposed a “PVD”. • In2004, Chang and Tseng proposed a side-match method. • In 2005, Park et al. proposed a steganographic scheme based of neighboring pixels. • In 2005, Wu et al. proposed the pixel-value differencing (PVD) and LSB replacement method.
I.Introduction • LSB techniques • PVD techniques • Side-Match techniques
LSB method Fig.1:Wu et al.’s division of “lower level” and “higher level” (Div=15)
II. Literature Review • Wu et al.’s PVD and LSB
=|56-47|=9 (lower-level) =23>Div=15 =55-48=7 =63, =40 If level≠ level =55, =48 II. Literature Review • Example To embed 111000
III.Proposed Method • 2-3 Division and 3-4-5 Division (a) (b) Fig. 2. Two dividing cases: (a) “lower level” and “higher level” and (b) “lower level,” “middle level,” and “higher level.”
III.Proposed Method • 2-3 Division • 3-4-5 Division
III-1.Embedding steps for l-m-h • Case6.1 =L-level ≠L-level • Case6.2 =M-level =L-level • Case6.3 =M-level =H-level • Csae6.4 =H-level ≠H-level
=|64-47|=17 (middle-level) =42 =|74-48|=26 =10 =74, =58, =32 =48 =M-level =L-level =74, =48 III-1 Embedding Procedure Example To embed 4-bit LSB After the modified LSB substitution is applied
=|74-48|=26 =74, =48 III-2.Data Extraction Example There are 4 bits embedded in and 4 bits embedded in ‘s secret bits ‘s secret bits
IV.Experimental Results • Fig. 3:Two cover images. • Elaine. (b) Baboon.
V.Conclusions • some l-h divisions and l-m-h divisions both yielded higher capacity and higher PSNR. • Embed secret data into gray images without making a perceptible distortion. • Can be analyzed automatically, aiming to capture an adequate - - division satisfying the key requirements in information hiding. • Experimental results show that our approach obtains both larger capacity and higher image quality than that of Wu et al.