1 / 13

High Capacity Data Hiding for Grayscale Images

High Capacity Data Hiding for Grayscale Images. Author: Chin-Chen Chang, Yung-Chen Chou and The Duc Kieu Speaker: Yung-Chen Chou. Outline. Introduction Zhang and Wang ’ s method The proposed method Experimental result Conclusions. Receiver. Stego-Image. Secret data: 10110101.

jeffreyrobert
Download Presentation

High Capacity Data Hiding for Grayscale Images

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. High Capacity Data Hiding for Grayscale Images Author: Chin-Chen Chang, Yung-Chen Chou and The Duc Kieu Speaker: Yung-Chen Chou

  2. Outline • Introduction • Zhang and Wang’s method • The proposed method • Experimental result • Conclusions Yung-Chen Chou

  3. Receiver Stego-Image Secret data: 10110101 Introduction Sender Stego-Image Host Image Secret data: 10110101 Yung-Chen Chou

  4. Introduction (cont.) • Data hiding: • Spatial domain • Frequency domain • Compression domain • Requirement: • Low distortion • High capacity Yung-Chen Chou

  5. 10112 125 01012 105 Zhang and Wang’s method n=2 Translate binary secret message to (2n+1)-ary notification system image Secret data:101101011… Yung-Chen Chou

  6. f(13,19)=(13+19*2) mod 5 = 1 13 19 13 19 f(11,19)=(11+19*2) mod 5 = 4 11 19 f(12,19)=(12+19*2) mod 5 = 0 12 19 f(12,18)=(12+18*2) mod 5 = 3 12 18 f(12,20)=(12+20*2) mod 5 = 2 12 20 Zhang and Wang’s method (cont.) Extracting function: n=2 image Secret data: 10112 125 Yung-Chen Chou

  7. f(16,21)=(16+21*2) mod 5 = 3 16 21 f(14,21)=(14+21*2) mod 5 = 1 14 21 f(15,21)=(15+21*2) mod 5 = 2 15 21 f(15,20)=(15+20*2) mod 5 = 0 15 20 f(15,22)=(15+22*2) mod 5 = 4 15 22 Zhang and Wang’s method (cont.) n=2 image Low embedding rate Secret data: 10112 125 Yung-Chen Chou

  8. The proposed method • Magic matrix construction Extracting function: f(0,0)=(0+0*2) mod 5 = 0 f(1,0)=(1+0*2) mod 5 = 1 : f(2, 1)=(2+1*2) mod 5 = 4 : f(3,252)=(3+252*2) mod 5 = 2 : f(252,3)=(252+3*2) mod 5 = 3 : Yung-Chen Chou

  9. x1 = 2 x2 = 255-x1 = 253 x1=3 x2=255-x1 = 252 10112 125 01012 105 The proposed method (cont.) 4 Secret data:101101011… image Yung-Chen Chou

  10. f(4, 255-4) = (4+251*2) mod 5 = 1 f(3, 255-3) = (3+252*2) mod 5 = 2 The proposed method (cont.) • Data extraction Stego-image 125=10112 Yung-Chen Chou

  11. Experimental Results • The proposed method embeds two secret bits per pixel • Zhang and Wang’s method using two pixels to embed two secret bits Yung-Chen Chou

  12. Experimental results Original image Stego-image with 524288 bits secret message Yung-Chen Chou

  13. Conclusions • The proposed method embeds one digit into one pixel. • We provide a simple and efficient data embedding method to achieve secret message delivery purpose with high capacity. Yung-Chen Chou

More Related