Loading [MathJax]/extensions/MathZoom.js
Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes | IEEE Journals & Magazine | IEEE Xplore

Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes


Abstract:

This paper proposes a complete practical methodology for minimizing additive distortion in steganography with general (nonbinary) embedding operation. Let every possible ...Show More

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.
Published in: IEEE Transactions on Information Forensics and Security ( Volume: 6, Issue: 3, September 2011)
Page(s): 920 - 935
Date of Publication: 05 April 2011

ISSN Information:


References

References is not available for this document.