Reversible Information Hiding Techniques and Their Applications in Image Protection

1. Reversible Information Hiding Techniques and Their Applications in Image Protection Advisor： Chin-Chen Chang Student：Thai-Son Nguyen Department of Computer Science and Information Engineering, FengChia University June 29, 2015

2. Outline • Introduction • Reversible Data Hiding Schemes in spatial domain • Scheme 1: A Novel Reversible Data Hiding Scheme Based on Difference-Histogram Modification and Optimal EMD Algorithm • Scheme 2: An Efficient Reversible Data Hiding Scheme Based on Adaptive Rhombus Prediction and Pixel Selection • Reversible Data Hiding Schemes in compressed domain • Scheme 3: Reversible Data Hiding for Indices Based on Histogram Analysis • Scheme 4:Adaptive Lossless Data-Hiding and Compression Scheme for SMVQ Indices Using SOC • Applications of reversible data hiding • Scheme 5Reversible Authentication Scheme for Digital Images with High-Quality Images • Scheme 6:A Blind Reversible Robust Watermarking Scheme for Relational Databases • Conclusions and future works

3. Introduction-Motivation • Encryption: Meaningless • Information Hiding: Hide the secret data into a cover data (meaningful). • Irreversible data hiding • Reversible data hiding • Three domains: spatial domain, compression domain, frequency domain • Basic requirements: visual quality, hiding capacity, reversibility, compression rate, robustness • Cover data: images, videos, audios, written texts, database

4. Introduction-Research Objectives • To propose two RDH schemes in spatial domain with the high embedding capacity while maintaining the good image quality. • To provide two RDH schemes in compressed domain, to improve further embedding capacity, compression rate, as well as embedding efficiency. • To apply RDH for image authentication with high accuracy of tamper detection and high quality. • To develop a reversible watermarking for relational database to protect them from illegal copying and manipulation by malicious attackers.

5. Scheme 1: A Novel Reversible Data Hiding Scheme Based on Difference-Histogram Modification and Optimal EMD Algorithm

6. A Novel Reversible Data Hiding Scheme Based on Difference-Histogram Modification and Optimal EMD Algorithm • Embedding phase

7. A Novel Reversible Data Hiding Scheme Based on Difference-Histogram Modification and Optimal EMD Algorithm • Embedding phase - Generation of Optimal EMD Table Divide the secret data into into sequence S = {s1, s2,… , s|R|/3}, si is 3 bits Histogram of sequences S Sorted histogram of sequences S Embed three bits each time Minimum embedding distortion Optimal EMD table

8. A Novel Reversible Data Hiding Scheme Based on Difference-Histogram Modification and Optimal EMD Algorithm • Embedding phase –Block classification Compute complexity If NV < T, smooth block. Otherwise, complex block

9. A Novel Reversible Data Hiding Scheme Based on Difference-Histogram Modification and Optimal EMD Algorithm • Embedding phase – Embedding procedure Peak = 0 T= 15 NV = 10 Secret data = 001 011 Original block 0 0 1 0 Stego block Optimal EMD table

10. A Novel Reversible Data Hiding Scheme Based on Difference-Histogram Modification and Optimal EMD Algorithm • Extracting phase T =15 0 0 Peak =0 0 0 Stego block Optimal EMD 0 0 Secret data = 001 011 1 0 [Peak -1, Peak +1] Original block

11. A Novel Reversible Data Hiding Scheme Based on Difference-Histogram Modification and Optimal EMD Algorithm • Experimental results [8] X. Li, B. Yang, and T. Zeng, “Efficient reversible watermarking based on adaptive prediction-error expansion and pixel selection,” IEEE Trans. Image Process., vol. 20, no. 12, pp. 3524-3533, Dec. 2011. [12] X. Li, B. Li, B. Yang, and T. Zeng, “General framework to histogram-shifting-based reversible data hiding,” IEEE Trans. on Image Process., vol. 22, no. 6, pp. 2181-2191, Jun. 2013. [19] W. Hong, “Adaptive reversible data hiding method based on error energy control and histogram shifting,” Opt. Commun., vol. 285, no. 2, pp. 101-108, 2012. [20] V. Sachnev, H. J. Kim, J. Nam, S. Suresh, and Y.Q. Shi, “Reversible watermarking algorithm using sorting and prediction,” IEEE Trans. Circuits Syst. Video Technol., vol. 19, no. 7, pp. 989-999, Jul. 2009.

12. A Novel Reversible Data Hiding Scheme Based on Difference-Histogram Modification and Optimal EMD Algorithm • Experimental results

13. A Novel Reversible Data Hiding Scheme Based on Difference-Histogram Modification and Optimal EMD Algorithm • Experimental results Table 2.1 Comparison of PSNR (dB) between the proposed scheme four previous schemes [8, 12, 19, 20] for EC of 10,000 bits

14. A Novel Reversible Data Hiding Scheme Based on Difference-Histogram Modification and Optimal EMD Algorithm • Summary • An optimal EMD table is generated for RDH • Reversibility • High image quality and high embedding capacity

15. Scheme 2: An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection

16. An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection • Embedding phase Rhombus prediction

17. An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection • Embedding phase- Pixel selection Compute local complexity If LVx < TH, select it for embedding data. Then, calculate predicted value

18. An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection • Embedding phase Skip unchanged Prediction errors e = 0 1 0 -1 TH = 5

19. An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection • Embedding phase Peak P Zero Z e= P = 0, Z = 2 W = 0 1 e= 0 2 1 1

20. An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection • Embedding phase e= Stego image

21. An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection • Extracting phase P = 0, Z = 2 Original image 1 W = 0

22. An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection Optimal pair of peak and zero points Embedding capacity L Two possible cases: 1. F(Pl) L, (Pl, Zl) is the first candidate 2. F(Pr) L, (Pr, Zr) is the second candidate 3. Optimal one is selected with the smaller embedding distortion

23. An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection Experimental results

24. An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection Lena Airplane Baboon Peppers

25. An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection Sailboat Boat [12] X. Li, B. Li, B. Yang, and T. Zeng, “General framework to histogram-shifting-based reversible data hiding,” IEEE Trans. on Image Process., vol. 22, no. 6, pp. 2181-2191, Jun. 2013. [13] J. Wang, J. Ni, and Y. Hu, “An efficient reversible data hiding scheme using prediction and optimal side information selection,” J. Vis. Commun. Image Represent., vol. 25, pp. 1425-1431, 2014. [20] V. Sachnev, H. J. Kim, J. Nam, S. Suresh, and Y.Q. Shi, “Reversible watermarking algorithm using sorting and prediction,” IEEE Trans. Circuits Syst. Video Technol., vol. 19, no. 7, pp. 989-999, Jul. 2009. [21] L. Luo, Z. Chen, M. Chen, X. Zeng, and Z. Xiong “Reversible image watermarking using interpolation technique,” IEEE Trans. Inf. Forens. Secur., vol. 5, no. 1, pp. 187-193, 2010.

26. An Efficient RDH Scheme Based on Adaptive Rhombus Prediction and Pixel Selection Summary • Adaptive rhombus prediction and pixel selection techniques are used for RDH • Higher performance in terms of image quality and embedding capacity

27. Scheme 3: Reversible Data Hiding for Indices Based on Histogram Analysis

28. Reversible Data Hiding for Indices Based on Histogram Analysis

29. Reversible Data Hiding for Indices Based on Histogram Analysis Histogram analysis The number of zero frequency is U = 9 The largest mapping bits Sorted histogram [2 0 1], [0 3 0], [3 2 0], and [6 1 0] [3 2 0] Achieve higher embedding capacity Low compression rate as traditional VQ

30. Reversible Data Hiding for Indices Based on Histogram Analysis Embedding phase S = 10 00 11 01 10 Transformed index table IT 8 0 9 7 8 Stego index table

31. Reversible Data Hiding for Indices Based on Histogram Analysis Experimental results Figure 4.11 Compression rate results of our proposed scheme and some previous schemes

32. Reversible Data Hiding for Indices Based on Histogram Analysis Experimental results Figure 4.12 Embedding rate (ER) results of our proposed scheme and some previous schemes

33. Reversible Data Hiding for Indices Based on Histogram Analysis Summary • Preserve image quality and compression rate the same as those of traditional VQ. • Improve embedding rate of previous schemes further [46] Z. M. Lu, J. X Wang, and B. B. Liu, “An improved lossless data hiding scheme based on image VQ-index residual value coding,” Journal of Systems and Software, vol. 82,pp. 1016-1024, 2009. [47] C. H. Yang and Y. C. Lin, “Reversible data hiding of a VQ index table based on referred counts,” J. Vis. Commun. Image Represent., vol. 20, no. 6, pp. 399-407, Aug. 2009. [48] J. X. Wang and Z. M. Lu, “A path optional lossless data hiding scheme based on VQ joint neighboring coding”, Information Sciences, vol. 179, pp. 3332-3348, 2009. [49] C. F. Lee, H. L. Chen, and S. H. Lai, “An adaptive data hiding scheme with high embedding capacity and visual image quality based on SMVQ prediction through classification codebooks,” Image and Vision Computing, vol. 28, no. 8, pp. 1293-1302, 2010. [50]C. C. Chang, T. S. Nguyen, and C. C. Lin, “A novel VQ-based reversible data hiding scheme by using hybrid encoding strategies,” Journal of Systems and Software, vol. 86, pp. 389-402, 2013.

34. Scheme 4: Adaptive Lossless Data-Hiding and Compression Scheme for SMVQ Indices Using SOC

35. Adaptive Lossless Data-Hiding and Compression Scheme for SMVQ Indices Using SOC Figure 5.2 Distribution of indices by using VQ compression and SOC algorithm Figure 5.3 Distribution of indices by using SMVQ compression and SOC algorithm

36. Adaptive Lossless Data-Hiding and Compression Scheme for SMVQ Indices Using SOC Figure 5.5 The main processes of the proposed embedding algorithm

37. Adaptive Lossless Data-Hiding and Compression Scheme for SMVQ Indices Using SOC Table 5.3 Encoding rule of the proposed scheme

38. Adaptive Lossless Data-Hiding and Compression Scheme for SMVQ Indices Using SOC SMVQ index table Secret message 101110 1010 Threshold thr = 8, m1 = 6, m2 = 4 Code steam CS 10||00000100 11||00||0||111 00||101110 01||01||1010

39. Adaptive Lossless Data-Hiding and Compression Scheme for SMVQ Indices Using SOC

40. Adaptive Lossless Data-Hiding and Compression Scheme for SMVQ Indices Using SOC

41. Adaptive Lossless Data-Hiding and Compression Scheme for SMVQ Indices Using SOC Summary • High EC and high EF while guaranteeing a low CR. • Further improve the performance of four previous schemes [63-66] [63] J. D. Lee, Y. H. Chiou, and J. M. Guo, “Lossless data hiding for VQ indices based on neighboring correlation,” Information Sciences, vol. 221, pp. 419-438, Dec. 2013. [64] C. Qin, C. C. Chang, Y. P. Ping, “A novel joint data hiding and compression scheme based on SMVQ and image inpainting,” IEEE Trans. Image Process., vol. 23, no. 3, pp. 969-978, Mar. 2014. [65]Z. B. Pan, X. X. Ma, X. M. Deng, S. Hu, “Low bit-rate information hiding method based on search-order-coding technique,” Journal of Systems and Software, vol. 86, pp. 2863-2869, 2013. [66] L. F. Wang, Z. B. Pan, X. X. Ma, S. Hu, “A novel high-performance reversible data hiding scheme using SMVQ and improved locally adaptive coding method,” J. Vis. Commun. Image Represent., vol. 25, pp. 454-465, 2013.

42. Scheme 5: A Reversible Authentication Scheme for Digital Images with High-Quality Images

43. A Reversible Authentication Scheme for Digital Images with High-Quality Images Figure 6.1 Framework of the proposed authentication scheme

44. A Reversible Authentication Scheme for Digital Images with High-Quality Images Figure 6.2 Example of an image block and its satellite reference pixels

45. A Reversible Authentication Scheme for Digital Images with High-Quality Images dL = L- C = 0 dL’= 2 x 0 + 1 = 1 dR’ = 2 x 1 + 0 = 2 dR = R - C = 1 Original block T* = 2 W = 1 0 Stego block

46. A Reversible Authentication Scheme for Digital Images with High-Quality Images Figure 6.6 Image quality of the embedded images of the proposed scheme

47. A Reversible Authentication Scheme for Digital Images with High-Quality Images Figure 6.9 Tampered images “Lena” of the proposed scheme with various values of T*

48. A Reversible Authentication Scheme for Digital Images with High-Quality Images

49. A Reversible Authentication Scheme for Digital Images with High-Quality Images Table 6.5 Comparison of the proposed scheme and Lo and Hu’s scheme [86] C. C. Lo, Y. C. Hu, “A novel reversible image authentication scheme for digital images,” Signal Process., vol. 98, pp. 174-185, 2014.

50. A Reversible Authentication Scheme for Digital Images with High-Quality Images Summary • Obtain high accuracy of tamper detection and preserve high quality of the stego images. • Achieve reversibility.