Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Raw reversibility of information hiding on the basis of VQ systems

Abstract

Up to now, the VQ-based steganographic methods are all lossy approaches since they cannot recover the cover images. Prior studies on reversibility in VQ-based steganography only show the ability to recover the quantized cover images. This paper presents a new two-phase steganographic protocol of genuine VQ-based reversibility, referring to the ability of using a VQ codebook to recover a target cover image and to retrieve all hidden data from the stego-images. The protocol consists of two phases. The Phase 1 generates a stego-image of excellent visual quality; the Phase 2 provides high visual quality and high embedding capacity of the stego-image. Both the stego-images used in the two phases can pass Chi-square test. To evaluate the performance of our method, we have conducted several experiments and compared Phase 1 and Phase 2 of the proposed protocol with two prior studies in reversible steganography based on VQ. The results show that Phase 2 achieves significant improvement on both the embedding capacity and the visual quality of the stego-images. On the other hand, Phase 1 achieves the best visual quality and the lowest embedding capacity of the stego-images. Together with the two phases of the proposed protocol, we can achieve genuine recovery of the cover image of Phase 1. This property cannot be achieved by any combination of prior studies since they all provide low embedding capacity of the stego-images and high difference between the cover image and the stego-image.

This is a preview of subscription content, log in to check access.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

References

  1. 1.

    Wang C, Wang Q, Ren K, Cao N, Lou W (2012) Toward secure and dependable storage services in cloud computing. IEEE Trans Serv Comput 5(2):220–232

  2. 2.

    Wang Q, Wang C, Ren K, Lou W, Li J (2011) Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans Parallel Distrib Syst 22(5):847–859

  3. 3.

    Alattar AM (2004) Reversible watermark using the difference expansion of a generalized integer transform. IEEE Trans Image Process 13(8):1147–1156

  4. 4.

    Shen JJ, Ren JM (2010) A robust associative watermarking technique based on vector quantization. Digit Signal Process 20(5):1408–1423

  5. 5.

    Liu F, Wu CK (2011) Robust visual cryptography-based watermarking scheme for multiple cover images and multiple owners. IET Inf Secur 5(2):121–128

  6. 6.

    Phadikar A, Maity SP, Verma B (2011) Region based QIM digital watermarking scheme for image database in DCT domain. Comput Electr Eng 37(3):339–355

  7. 7.

    Guo JM, Liu YF (2010) Hiding multitone watermarks in halftone images. IEEE Multimed 17(1):65

  8. 8.

    Shie SC, Jiang JH (2012) Reversible and high-payload image steganographic scheme based on side-match vector quantization. Signal Process 92(9):2332–2338

  9. 9.

    Yang CH, Wang WJ, Huang CT, Wang SJ (2011) Reversible steganography based on side match and hit pattern for VQ-compressed images. Inf Sci 181(11):2218–2230

  10. 10.

    Zhang L, Wang H, Wu R (2009) A high-capacity steganography scheme for JPEG2000 baseline system. IEEE Trans Image Process 18(8):1797–1803

  11. 11.

    Linde Y, Buzo A, Gray R (1980) An algorithm for vector quantizer design. IEEE Trans Commun 28(1):84–95

  12. 12.

    Kim T (1992) Side match and overlap match vector quantizers for images. IEEE Trans Image Process 1(2):170–185

  13. 13.

    Bender W, Gruhl D, Morimoto N, Lu A (1996) Techniques for data hiding. IBM Syst J 35(3):313–336

  14. 14.

    Wang RZ, Lin CF, Lin JC (2001) Image hiding by optimal LSB substitution and genetic algorithm. Pattern Recognit 34(3):671–683

  15. 15.

    Chung KL, Shen CH, Chang LC (2001) A novel SVD- and VQ-based image hiding scheme. Pattern Recognit Lett 22(9):1051–1058

  16. 16.

    Du WC, Hsu WJ (2003) Adaptive data hiding based on VQ compressed images. IEE Proc Vis Image Signal Process 150(4):233–238

  17. 17.

    Thien CC, Lin JC (2003) A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function. Pattern Recognit 36(12):2875–2881

  18. 18.

    Chan CK, Cheng LM (2004) Hiding data in images by simple LSB substitution. Pattern Recognit 37(3):469–474

  19. 19.

    Luo H, Yu FX, Chen H, Huang ZL, Li H, Wang PH (2011) Reversible data hiding based on block median preservation. Inf Sci 181(2):308–328

  20. 20.

    Wu HC, Wang HC, Tsai CS, Wang CM (2010) Reversible image steganographic scheme via predictive coding. Displays 31(1):35–43

  21. 21.

    Hu Y, Lee HK, Li J (2009) DE-based reversible data hiding with improved overflow location map. IEEE Trans Circuits Syst Video Technol 19(2):250–260

  22. 22.

    Tsai CL, Chiang HF, Fan KC, Chung CD (2005) Reversible data hiding and lossless reconstruction of binary images using pair-wise logical computation mechanism. Pattern Recognit 38(11):1993–2006

  23. 23.

    Yang CH, Wu SC, Huang SC, Lin YK (2011) Huffman-code strategies to improve MFCVQ-based reversible data hiding for VQ indexes. J Syst Softw 84(3):388–396

  24. 24.

    Tsai P (2009) Histogram-based reversible data hiding for vector quantisation-compressed images. IET Image Process 3(2):100–114

  25. 25.

    Chen LS, Lin JC (2010) Steganography scheme based on side match vector quantization. Opt Eng 49(3):0370081–0370087

  26. 26.

    Chang CC, Tai WL, Lin CC (2006) A reversible data hiding scheme based on side match vector quantization. IEEE Trans Circuits Syst Video Technol 16(10):1301–1308

  27. 27.

    Huang CT, Wang WJ, Yang CH, Wang SJ (2013) A scheme of reversible information hiding based on SMVQ. Imaging Sci J 61(2):195–203

  28. 28.

    Chang CC, Chou YC, Kieu TD (2010) Embedding data and sharing original image in two stego images using Sudoku. In: IET International Conference on Frontier Computing, pp 163–168

  29. 29.

    Lee CF, Huang YL (2011) Reversible data hiding scheme based on dual stegano-images using orientation combinations. Telecommun Syst 52(4):2237–2247

  30. 30.

    Chang CC, Kieu TD, Chou YC (2007) Reversible data hiding scheme using two steganographic images. In: IEEE Region 10 Conference TENCON, pp 1–4

  31. 31.

    Yang CH, Tsai MH (2010) Improving histogram-based reversible data hiding by interleaving predictions. IET Image Process 4(4):223–234

  32. 32.

    Lou DC, Chou CL, Tso HK, Chiu CC (2012) Active steganalysis for histogram-shifting based reversible data hiding. Optics Commun 285(10–11):2510–2518

  33. 33.

    Witten IH, Neal RM, Cleary JG (1987) Arithmetic coding for data compression. Commun ACM 30(6):520–540

  34. 34.

    Guillermito (2004) Steganography : a fewtools to discover hidden data. http://guillermito2.net/stegano/tools/index.html

Download references

Acknowledgements

This research was partially supported by the Ministry of Science and Technology of the Republic of China under the Grant MOST 104-2221-E-015-001-, MOST 105-2221-E-008-070-MY2, MOST 105-2221-E-015-002-, MOST 103-2221-E-153-005, NSC 101-2218-E-008-003-, the Software Research Center, National Central University, Taiwan, and the Oriental Institute of Technology under the Grant RD1050025 and 151001-708.

Author information

Correspondence to Shiuh-Jeng Wang.

Appendices

Appendices

In this section, we describe two VQ-based (1, 1) reversibility methods, Chang et al.’s method [26] and Huang et al.’s method [27].

Appendix 1: Chang et al.’s method [26]

In 2006, Chang et al. [26] proposed a SMVQ reversible data hiding scheme which embeds a secret bit into each SMVQ-coded block \(H_{i}\). The output format is a regular image, not index table or codestream. The key point of Chang et al.’s reversible method is used two codewords to extract the secret data correctly and also reverse the original SMVQ index. If the to-be-embedded secret bit is 0, the codeword \(k_{a}\) found by the SMVQ approach is used to replace \(H_{i}\). Otherwise, the to-be-embedded secret bit is 1 and \(H_{i}\) is replaced with \(\left\lfloor {\frac{2\times k_a +1\times k_b }{3}} \right\rfloor \), where codeword \(k_{b}\) is the closest codeword of \(k_{a}\) in the sub-codebook. The detailed embedding algorithm is shown as follows:

  • Input: Cover image H, secret data B, codebook C.

  • Output: Stego-image \(S'.\)

  • Step 1: Partition H into n non-overlapping \(m \times m\) blocks: \(H=H_{0}, H_{1}, {\ldots }, H_{n-1}\).

  • Step 2: Blocks in the first row or the first column are encoded by VQ and do not participate in the embedding phase.

  • Step 3: From left to right and from top to down, process each remained block \(H_{i }\) by executing Step 4 \(\sim \) Step 6.

  • Step 4: The upper block and left block of \(H_{i}\) are used to generate sub-codebook \(K = (k_{0}, k_{1}, {\ldots }, k_{N-1})\) from C, where \(k_{j}\) is the jth codeword and \(j = 0, 1, {\ldots }, N-1\). Find out the closest codeword \(k_{a}\) of \(H_{i }\) from sub-codebook K.

  • Step 5: If to-be-embedded secret bit b is 0, \(S_{i}'\) is set to \(k_{a}\).

  • Step 6: If to-be-embedded secret bit b is 1, \(S_{i}'\) is set to \(\left\lfloor {\frac{2\times k_a +1\times k_b }{3}} \right\rfloor \), where codeword \(k_{b}\) is the closest to \(k_{a}\) in sub-codebook K.

Figure 6 shows the flowchart of processing a non-seed block X in Chang et al.’s method, where the gray blocks of the cover image are seed blocks and are encoded by VQ.

Fig. 6
figure6

Flowchart of Chang et al.’s method

Appendix 2: Huang et al.’s method [27]

In 2012, Huang et al. proposed a new SMVQ reversible data hiding scheme with images as outputs is proposed by improving Chang et al.’s scheme [26]. Compared with Chang et al.’s scheme, Huang et al. adjusted the direction from \(\overline{k_a k_b } \) to \(\overline{k_a H_i } \). The improvement of Huang et al.’s method is to raise the image quality in PSNR and also keep the embedding capacity. Figure 7 shows the concept with Huang et al.’s method. Figure 7a shows the concept of the proposed method, the codeword \(k_{a}\) is the closest codeword to the block \(H_{i}\), and the codeword \(k_{b}\) is the closest codeword to the codeword \(k_{a}\). If codeword \( k_{a}\) is as a center, two spheres are created. The radius of the external sphere is equal to the distance between \(k_{a}\) and \(k_{b}\). The radius of the internal sphere is half of the radius of the external sphere. Codeword \(k_{a}\) is the closest to all of the points in the internal sphere. Figure 7b and c shows the methods to generate the stego-images in Chang et al.’s method and Huang et al.’s method. The stego-image of Huang et al.’s method will closer to cover image H than Chang et al.’s method.

Fig. 7
figure7

The relationships between three key elements, \(H_{i}\), \(k_{a}\), and \(k_{b}\), in different methods [26, 27]. a Three key elements, b Chang et al.’s method [26], c Huang et al.’s method [27]

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Huang, C., Yang, C., Wang, W. et al. Raw reversibility of information hiding on the basis of VQ systems. J Supercomput 74, 3748–3777 (2018). https://doi.org/10.1007/s11227-017-1997-7

Download citation

Keywords

  • Raw reversibility
  • High visual quality
  • Steganography
  • Vector quantization