Adaptive (k, F1) interpolation-based hiding scheme
- 111 Downloads
In 2012, Lee et al. proposed an interpolation technique with neighboring pixels (INP) as the base to conceal secret information in predicted pixels. Their method can effectively predict the pixel between two neighboring pixels. However, the different lengths of secret messages caused great distortion when a large secret message was concealed in the predicted value. Therefore, the proposed scheme applies the center folding strategy to fold the secret message for reducing image distortion. Furthermore, the proposed scheme references the variance of the neighboring pixel to determine the length of the secret message for controlling image quality. The parameter pair (k, F1) is used to categorize the variance and determine the size of the secret message hidden in each category. k is the total number of thresholds which computed based on the characteristics of each image for balancing hiding payload and image quality. F1 is the length of the secret message for the smoothest area. The experimental results show that the embedding capacity of the proposed method is 1.5 bpp higher than that of existing methods. For the same hiding payload, the image quality of the proposed method is 1.6 dB higher than that of existing methods.
KeywordsImage interpolation Semi-reversible information hiding Center folding Adaptive thresholds
- 2.Boehm B (2014)StegExpose - a steganalysis tool for detecting LSB steganography in images, [http://arxiv.org/abs/1410.6656]
- 3.Fridrich J, Golijan M, Du R (2001) Reliable detection of LSB steganography in grayscale and color images. Proc ACM Work Multimed Secur 27–30Google Scholar
- 9.Schaefer G, Stich M (2004) UCID - an uncompressed colour image database. Storage Retr Met Appl Multimedia 5037:472–480Google Scholar
- 10.Wittman T (2015) Mathematical techniques for image interpolation, www.math.ucla.edu/~wittman/thesis/Poral2.pdf