Abstract
In this paper, we compare Huffman coding and Arithmetic coding with ASCII coding to observe their contribution to steganography. This way is to compress the embedded information first for enhance the payload of a cover image. There are many wonderful coding methods to compress this kind of string, such as Huffman coding and Arithmetic coding. The experiment results indicate that Huffman coding and Arithmetic coding as an important preprocess step of steganography can effectively reduce the amount of secret information with efficient encoding performance. And a theory opinion related to payload calculation is proposed which can be used to describe the relationship among the three parameters of steganography: imperceptibility, information embedding efficiency and payload.
Publisher
Trans Tech Publications, Ltd.
Reference8 articles.
1. Jianhong Sun, Yingjiang Li, Junsheng Li, A Scheme of LSB Steganography Based on Concept of Finding Optimization Pixels Selection, Software Engineering and Knowledge Engineering: Theory and Practice Advances in Intelligent and Soft Computing Volume 115(2012).
2. J. Mielikainen, LSB matching revisited, IEEE Signal Process. Letter, vol. 13, no. 5(2006) pp.285-287.
3. Xiaolong Li, Bin Yang, Daofang Cheng and Tieyong Zeng, A Generalization of LSB Matching, IEEE Signal Process. Letter, vol. 16, NO. 2(2009) p.69~72.
4. R. Crandall, Some notes on steganography, Steganography Mailing List [online]. Available: http: /os. inf. tu-dresden. de/westfeld/crandall. pdf. (1998).
5. Li Xiao-long and Yang Bin, Analysis on Embedding-efficiency of LSB Matching (In Chinese), Journal of Nanjing University of Science and Technology, Vol. 32 No. 4(2008) pp.429-433.