Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Steganalysis of JPEG Images: Breaking the F5 Algorithm
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Hide and Seek: An Introduction to Steganography
IEEE Security and Privacy
Statistically undetectable jpeg steganography: dead ends challenges, and opportunities
Proceedings of the 9th workshop on Multimedia & security
Gibbs construction in steganography
IEEE Transactions on Information Forensics and Security
Using high-dimensional image models to perform highly undetectable steganography
IH'10 Proceedings of the 12th international conference on Information hiding
Wet paper codes with improved embedding efficiency
IEEE Transactions on Information Forensics and Security
| Hi-index | 0.00 |
In this article, the interactions of pixel changes are interpreted as flows in a state transition network. By relating the cost of each state transition to detectability, the problem of embedding impact minimization is solved using polynomial-time network flow algorithms. The newly proposed scheme rectifies pixel changes after the embedding process and it's compatible with the majority of existing embedding schemes. The experimental result shows that this method is applicable to the full range of embedding rates.