Presentation is loading. Please wait.

Presentation is loading. Please wait.

Partial reversible data hiding scheme using (7, 4) hamming code

Similar presentations


Presentation on theme: "Partial reversible data hiding scheme using (7, 4) hamming code"— Presentation transcript:

1 Partial reversible data hiding scheme using (7, 4) hamming code
Source: Multimedia Tools and Applications, Volume 76, Issue 20, October 2017, pp 21691–21706 Author: Biswapati Jana, Debasis Giri, Shyamal Kumar Mondal Speaker: Su Guodong Date:

2 Outline Introduction Related works Proposed scheme Experiments
Conclusions

3 Introduction Secret message: 10101100110…….
Original image Stego image Secret message: ……. Hiding Reversible Extracted Secret message: …….

4 Related Work(1/3)—(7,4) Hamming code-Encoding
Encoded data Encoding d1 d2 d3 d4 r1 r2 d1 r3 d2 d3 d4 1 Data: Data(CW):

5 Related Work(2/3)—(7,4) Hamming code-Error correcting
Received data(RCW): Error data: Corrected data: RCW: RCW: Correct Error position: 6

6 Related Work(3/3)—(7,4) Hamming code-Error correcting
Received data(RCW): Error data: Corrected data: z 001 010 011 100 101 110 111 ei

7 Proposed scheme(1/10)—Embedding
Size: pixels Original image 167 166 163 162 1 LSB

8 Proposed scheme(2/10)— Embedding
Position Number: Position Number: 1 2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 1 2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 Adjust redundant bits using odd parity

9 Proposed scheme(3/10)— Embedding
1/0 or 0/1: Previous value/Changed value for secret position 0/1 or 1/0: Previous value/Changed value for message bits Secret position: k=5 (using key) : Shared secret key Position Number: Embedding position: w=2 (suitable) 1 2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 1 2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 0/1 1/0 Secret message bits: s = 1/0 0/1 0/1 1/0 1/0 0/1 0/1 0/1 Secret position: k=2 (from w of the first row) 0/1 0/1 0/1 0/1 Embedding position: w=4 (suitable)

10 Proposed scheme(4/10)— Embedding
2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 Stego image i : is block number; w : is data embedding position : Changes bits (once)

11 Proposed scheme(5/10)— Extraction
Size: pixels Stego image 167 166 163 162 165 1 LSB

12 Secret position: k=5 (using key)
Proposed scheme(6/10)— Extraction Secret position: k=5 (using key) Position Number: 1 2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 1 2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 1

13 Proposed scheme(7/10)— Extraction
Secret message bits: s =1 ….. Error position: 1 2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 Error position: 2

14 Proposed scheme(8/10)— Extraction
Secret message bits: s =1 1 ….. Error position: 1 2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 1 Error position: 4

15 Proposed scheme(9/10)— Extraction
Secret position k Data embedding position w Secret message s (r1,r2,r3) data 1 2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 1/0 0/1 5 (010)=2 s=1 0/1 1/0 2 (100)=4 s=1 1/0 0/1 4 (110)=6 s=0 Secret message bits: s = 0/1 1/0 6 (010)=2 s=0 1/0 1/0 2 (100)=4 s=1 1/0 1/0 4 (010)=2 s=1 1/0 1/0 2 (110)=6 s=1

16 Proposed scheme(10/10)— Recovery
2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 1 2 3 4 5 6 7 r1 r2 d1 r3 d2 d3 d4 Recovered cover image

17 Experiments(1/6)--- PSNRs of Stego images

18 Experiments(2/6)

19 Experiments(3/6)

20 Experiments(4/6)- RS analysis

21 Experiments(5/6)- Relative entropy

22 Experiments(6/6)- Standard Deviation and Correlation Coefficient

23 Conclusions Introduce shared secret key and modify shared secret key to enhance the security Partial reversible data hiding Achieve visual quality of stego images are better than others.

24 Thanks!


Download ppt "Partial reversible data hiding scheme using (7, 4) hamming code"

Similar presentations


Ads by Google