On Using LSB Matching Function for Data Hiding in Pixels

• Autorzy: Chan, C-S.
• Języki publikacji: EN

Abstrakty

EN

The proposedmethod in this paper is based on the LSB matching function of Mielikainen for Steganography. However, there is a significant change with respect to Mielikainen’s method in the use of the LSB matching function to compute secret bits. Melikainen extracts secret bits in pixel pairs: the first one is the LSB of the first pixel in a pixel pair and the other is computed by a LSB matching function applied to both pixels. The proposed method does not make any partition, but makes the sequential image processing: the current secret bit is always computed by a LSB matching function where the LSB matching function is modified using only an XOR operation. To make the data extraction compatible with data embedding, the proposed method modifies sparse pixels by adding/subtracting their value to/from one. In the experimental results, the values of embedding efficiency increase while the involved bits increase. Taking test images in the experiments, the numbers of modified pixels in the proposed method are always lower than those in Mielikainen's method.

Słowa kluczowe

EN

information hiding; LSB matching; LSB matching revisited

• Czasopismo: Fundamenta Informaticae
• Rocznik: 2009
• Tom: Vol. 96, nr 1/2
• Strony: 49-59
• Opis fizyczny: Bibliogr. 11 poz., fot., tab., wykr.

Twórcy

autor

Chan, C-S.

• Department of Information Science and Applications, Asia University, Wufeng, Taiwan 41354, R. O. C.,

Bibliografia

• [1] Crandall, R.: Some Notes on Steganography, posted on Steganography Mailing List, http://os.inf.tudresden. de/ westfeld/crandall.pdf, 1998.
• [2] Chan, C. K., Cheng, L. M.: Hiding Data in Images by Simple LSB Substitution, Pattern Recognition, 37(3), 2004, 469-474.
• [3] Chan, C. S., Chang, C. C.: A Survey of Information Hiding Schemes for Digital Images, International Journal of Computer Sciences and Engineering Systems, 1(3), 2007, 187-200.
• [4] Chang, C. C., Hsiao, J. Y., Chan, C. S.: Finding Optimal LSB Substitution in Image Hiding by Dynamic Programming Strategy, Pattern Recognition, 36(7), 2003, 1583-1595.
• [5] Harmsen, J., Pearlman, W. : Steganalysis of Additive-noise Modelable Information Hiding, Proceedings of SPIE Security Watermarking Multimedia Contents V(E. j. Delp,P. W. Wong, Ed.), SPIE, 5020, 2003, 131-142.
• [6] Ker, A.: Improved Detection of LSB Steganography in Grayscale Image, Proceedings of Information Hiding Workshop, 3200, Springer LNCS, 2004, 97-115.
• [7] Mielikainen, J.: LSB Matching Revisited, IEEE Signal Processing Letters, 13(5), 2006, 285-287.
• [8] Westfeld, A.: F5-A Steganographic Algorithm: High Capacity Despite Better Steganalysis, ILNCS 2137, Springer-Verlag, 2137(11), 2001, 289-302.
• [9] Wang, R. Z., Lin, C. F., Lin, J. C.: Hiding by Optimal LSB Substitution and Genetic Algorithm, Pattern Recognition, 34(3), 2001, 671-683.
• [10] Zhang, X., Wang, S.: Efficient Steganographic Embedding by Exploiting Modification Direction, IEEE Communications Letters, 10(11), 2006, 781-783.
• [11] Zhang, W., Wang, S.,Zhang, X.: Improving Embedding Efficiency of Covering Codes for Applications in Steganography, IEEE Communications Letters, 11(8), 2007, 680-682.