Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes
Top Cited Papers
- 5 April 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 6 (3) , 920-935
- https://doi.org/10.1109/tifs.2011.2134094
Abstract
This paper proposes a complete practical methodology for minimizing additive distortion in steganography with general (nonbinary) embedding operation. Let every possible value of every stego element be assigned a scalar expressing the distortion of an embedding change done by replacing the cover element by this value. The total distortion is assumed to be a sum of per-element distortions. Both the payload-limited sender (minimizing the total distortion while embedding a fixed payload) and the distortion-limited sender (maximizing the payload while introducing a fixed total distortion) are considered. Without any loss of performance, the nonbinary case is decomposed into several binary cases by replacing individual bits in cover elements. The binary case is approached using a novel syndrome-coding scheme based on dual convolutional codes equipped with the Viterbi algorithm. This fast and very versatile solution achieves state-of-the-art results in steganographic applications while having linear time and space complexity w.r.t. the number of cover elements. We report extensive experimental results for a large set of relative payloads and for different distortion profiles, including the wet paper channel. Practical merit of this approach is validated by constructing and testing adaptive embedding schemes for digital images in raster and transform domains. Most current coding schemes used in steganography (matrix embedding, wet paper codes, etc.) and many new ones can be implemented using this framework.Keywords
This publication has 29 references indexed in Scilit:
- Polar Codes are Optimal for Lossy Source CodingIEEE Transactions on Information Theory, 2010
- Steganalysis by subtractive pixel adjacency matrixPublished by Association for Computing Machinery (ACM) ,2009
- Calibration revisitedPublished by Association for Computing Machinery (ACM) ,2009
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009
- Asymptotic Behavior of the ZZW Embedding ConstructionIEEE Transactions on Information Forensics and Security, 2009
- Improving Embedding Efficiency of Covering Codes for Applications in SteganographyIEEE Communications Letters, 2007
- Efficient double-layered steganographic embeddingElectronics Letters, 2007
- Embedding with syndrome coding based on BCH codesPublished by Association for Computing Machinery (ACM) ,2006
- Matrix Embedding for Large PayloadsIEEE Transactions on Information Forensics and Security, 2006
- Wet Paper Codes With Improved Embedding EfficiencyIEEE Transactions on Information Forensics and Security, 2006