An improvement of EMD embedding method for large payloads by pixel segmentation strategy
Image and Vision Computing
Bzier and Splines in Image Processing and Machine Vision
Bzier and Splines in Image Processing and Machine Vision
Asymptotic behavior of the ZZW embedding construction
IEEE Transactions on Information Forensics and Security
Generalization of the ZZW embedding construction for steganography
IEEE Transactions on Information Forensics and Security
Batch steganography and pooled steganalysis
IH'06 Proceedings of the 8th international conference on Information hiding
Constructing good covering codes for applications in steganography
Transactions on data hiding and multimedia security III
Near-optimal codes for information embedding in gray-scale signals
IEEE Transactions on Information Theory
Generalization and analysis of the paper folding method for steganography
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Signal Processing - Part II
Wet paper codes with improved embedding efficiency
IEEE Transactions on Information Forensics and Security
Matrix embedding for large payloads
IEEE Transactions on Information Forensics and Security
Grid Colorings in Steganography
IEEE Transactions on Information Theory
Hi-index | 0.08 |
Many high performance steganographic schemes work at a limited or sparsely distributed set of embedding rates. We have shown that some steganographic changes will be wasted as these schemes are utilized individually for messages of various lengths. To measure the wasted changes and compare different schemes in this respect, we have built a framework based on two new criteria: the Relative Change Waste (RCW) and the Expected Changes per Pixel (ECP). To decrease the wasted changes a systematic combination of schemes is introduced and proved to be equivalent to nonlinear interpolation of points in a two-dimensional space. We have proved that a special case which leads to a linear interpolation - named Scheme Interpolation - is the most efficient combination. The Convex Hull Point Selection and the Waste Aware Interpolation algorithms are then proposed to construct optimally efficient scheme interpolations for any given level of RCW. Examples of the combined schemes are simulated and proved to outperform the well-known schemes presented so far in terms of ECP, RCW, PSNR and efficiency. Practical usage of scheme interpolation, the performance of the more general cases - called multi-scheme interpolation - and achieving the lower bounds of ECP and RCW are fully discussed.