The square root law requires a linear key
Proceedings of the 11th ACM workshop on Multimedia and security
Estimating the Information Theoretic Optimal Stego Noise
IWDW '09 Proceedings of the 8th International Workshop on Digital Watermarking
The square root law does not require a linear key
Proceedings of the 12th ACM workshop on Multimedia and security
The square root law in stegosystems with imperfect information
IH'10 Proceedings of the 12th international conference on Information hiding
A game-theoretic approach to content-adaptive steganography
IH'12 Proceedings of the 14th international conference on Information Hiding
Digital image steganography using universal distortion
Proceedings of the first ACM workshop on Information hiding and multimedia security
| Hi-index | 0.00 |
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the distributions of genuine covers. The complete distribution cannot be estimated, but with carefully-chosen algorithms and a large corpus we can make local approximations by considering groups of pixels. A simple estimator for the local quadratic term of Kullback-Leibler divergence (Steganographic Fisher Information) is presented, validated on some synthetic images, and computed for a corpus of covers. The results are interesting not so much for their concrete capacity estimates but for the comparisons they provide between different embedding operations, between the information found in differently-sized and -shaped pixel groups, and the results of DC normalization within pixel groups. This work suggests lessons for the future design of spatial-domain steganalysis, and also the optimization of embedding functions.