Minimizing the Embedding Impact Using Network Flow Algorithms

Abstract:

A novel method of minimizing the embedding impact is proposed in this paper. Optimal embedding is achieved using network flow algorithms by considering the modifications on the cover image as flows of pixels among different states. This method is not an independent steganographic scheme, but rather it minimizes the embedding impact after the embedding process and it’s compatible with the majority of embedding techniques. Due to its dependence on the embedding process, many optimization problems, such as the minimization of a globally interactive distortion function, that are intractable during the embedding process can be solved with relatively low computational cost by rectifying the modifications on the cover image after the embedding process. A distortion function based on Kullback-Leibler divergence is provided as a concrete example to illustrate the basic idea of this method.

• Periodical: Advanced Materials Research (Volumes 341-342)
• Pages: 478-483
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.341-342.478
• Online since: September 2011
• Authors: Wan Qi Li, Heng Wang, Che Nian, Huang Wei, Hong Yao You
• Keywords: Embedding Impact, Network Flow, Penalty Function, Steganography

References

[1] K. Solanki, K. Sullivan, U. Madhow, B. S. Manjunath, and S. Chandrasekaran, in: Proc. ICIP. II–1118–21 (2005).

[2] W Shuo-Zhong, XP Zhang, Z Wei-Ming: Chinese Journal of Computers, 32(7), 1247-1263 (2009).

[3] C. Cachin: LNCS: 2nd Int'l Workshop on Information Hiding, vol. 1525, pp.306-318 (1998).

[4] A. D. Ker: IEEE Signal Processing Letters, 12(6), 441-444, (2005).

[5] J. Harmsen and W. Pearlman, in: Proc. SPIE Security Watermarking Multimedia Contents, vol. 5020, (E. J. Delp III and P.W. Wong, Eds. ), p.131–142 (2003).

[6] N. Provos, P. Honeyman: IEEE Security and Privacy Journal, vol. 1(3), 32-44, May/Jun (2003).

[7] R. Chandramouli, N. Memon, in: Proc. SPIE Electronic Imaging, Santa Clara, CA, Jan (2003).

[8] A. Westfeld, in: Proc. 4th Int'l Workshop Information Hiding, Springer-Verlag, 289-302, (2001).

[9] J. Fridrich, M. Goljan, and D. Hogea, in: Proc. 5th Int'l Workshop Information Hiding, Springer-Verlag, (2002).

[10] J. Fridrich, T. Pevný, and J. Kodovský, in: Proc. 9th ACM Multimedia & Security Workshop (J. Dittmann and J. Fridrich, eds. ), (Dallas, TX), pp.3-14, September 20-21, (2007).

DOI: 10.1145/1288869.1288872

[11] J. Fridrich, T. Filler, in: Proc. SPIE Electronic Imaging, 02-03, Photonics West, January (2007).

[12] T. Filler, J. Judas, J. Fridrich: IEEE Trans. on Info. Forensics and Security, to appear (2011).

[13] T. Filler, J. Fridrich: IEEE Trans. on Info. Forensics and Security, 5(4), 705-720, Sep (2010).

[14] J. Fridrich, in: Proc. ACM MM&S Workshop, Geneva, September 26-27, pp.2-10 (2006).

[15] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993).