The square root law of steganographic capacity for Markov covers
暂无分享,去创建一个
[1] Ying Wang,et al. Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions , 2007, IEEE Transactions on Information Theory.
[2] Pedro Comesaña Alfaro,et al. On the capacity of stegosystems , 2007, MM&Sec.
[3] Andrew D. Ker. A Capacity Result for Batch Steganography , 2007, IEEE Signal Processing Letters.
[4] Laurent Mevel,et al. Asymptotical statistics of misspecified hidden Markov models , 2004, IEEE Transactions on Automatic Control.
[5] Tomás Pevný,et al. The square root law of steganographic capacity , 2008, MM&Sec '08.
[6] Tomás Pevný,et al. Statistically undetectable jpeg steganography: dead ends challenges, and opportunities , 2007, MM&Sec.
[7] Pierre Moulin,et al. New results on steganographic capacity , 2004 .
[8] J. Doob. Stochastic processes , 1953 .
[9] TOMAS. FILLER,et al. IMPORTANT PROPERTIES OF NORMALIZED KL DIVERGENCE UNDER THE HMC MODEL , 2008 .
[10] 永井 豊,et al. 海外文献紹介 Proc. of SPIE IS & T Electronic Imaging特集 , 2005 .
[11] Christian Cachin,et al. An information-theoretic model for steganography , 1998, Inf. Comput..
[12] Maxim Sidorov,et al. Hidden Markov models and steganalysis , 2004, MM&Sec '04.
[13] Jessica J. Fridrich,et al. Complete characterization of perfectly secure stego-systems with mutually independent embedding operation , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.
[14] Ross J. Anderson. Stretching the Limits of Steganography , 1996, Information Hiding.