1 / 19

New image steganographic methods using run-length approach

New image steganographic methods using run-length approach. Authors : Chin-Chen Chang , Chih-Yang Lin , Yu-Zheng Wang Adviser : Chih-Hung Lin Reporter : Chien-Wen Huang Date :2009.10 .24. Received 29 December 2004; received in revised form 24 January 2006; accepted 3 February 2006.

dorie
Download Presentation

New image steganographic methods using run-length approach

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. New image steganographicmethodsusing run-length approach Authors : Chin-Chen Chang , Chih-Yang Lin , Yu-Zheng Wang Adviser :Chih-Hung Lin Reporter :Chien-WenHuang Date :2009.10 .24 Received 29 December 2004; received in revised form 24 January 2006; accepted 3 February 2006

  2. Outlines • Introduction • Related Work • The Proposed Methods • Hiding bitmap files • Hiding general data files • Experimental Results • Discussion and Conclusions

  3. Introduction • The most well-known steganographic technique-LSB. • RLE (Run-Length Encoding) • Compression standard in fax transmissions and bitmap-file coding. • Two efficient data hiding methods by run-length encoding . • BRL and GRL

  4. Related Work(1) • Wu and Tsai’s steganographic method

  5. Related Work(2) • Chang and Tseng’s steganographic method

  6. The proposed methods(1) • RLE • Example1 : AAAAABBBBAA 5A4B2A • Example2: 111000001111315041

  7. The proposed methods(2) • The host image is partitioned into non-overlapping consecutive two-pixel blocks by zigzag scanning.

  8. The proposed methods(3) • Hiding bitmap files • BRL hides the run value in and the run count in . • The range that the remainder of modulo k falls in – namely from 0 to (k-1) Thus,the definition of sign is as follows:

  9. The proposed methods(4) • The hiding process of BRL is formulated as follows: • The extraction scheme is as follows:

  10. The proposed methods(5) • Example:k=5, hiding secret bits:111000001111 111000001111 315041 (3,1) (5,0) (4,1) (V1, C1) = (12, 8), (V2, C2) = (2, 3), (V3, C3) = (240, 254). [LSB match] • 8 -> 3 =8+x mod k = 3-1 x=-1 or 4 [LSB replace] 2. 12-> 1 =12+1=13 RLE

  11. The proposed methods(6) • Hiding general data files • In GRL, the value of is the number of 1’s in , and the value of is the sequential order of combinations by . • The following mapping function f, where is set to be zero if n is smaller than k :

  12. The proposed methods(7) • the value of can be obtained from using • The recursive function :

  13. The proposed methods(8) • Example: Six secret bits are to be embedded in the pair of original pixels (43, 58). • N(1)=1,N(2)=1,N(3)=2,N(4)=2,N(5)=3

  14. The proposed methods(9) • The extraction process of (45,53) and n=6 • S5S4S3S2S1S0 s0:s5 s5=C(5,3)=10<13’1’ num=13-10=3 s0:s4 s4=C(4,2)=6>3’0’ s0:s3s3=C(3,2)=3≦3’1’ num = 3-3 = 0 s0:s2s2=‘0’ ; s0:s1s1=‘0’, s0=‘1’

  15. Experimental Results(1)

  16. Experimental Results(2)

  17. Experimental Results(3) • Comparison of PSNR and capacities using Lena as the cover image.

  18. Experimental Results(4) • Comparison of PSNR and capacities using Baboon as the cover image.

  19. Discussion and conclusions • No need to refer to the original image during the extraction process. • Probably be extended to embedding secret data in compressed images using VQ or JPEG techniques.

More Related