Permutation Codes and Steganography
Files in This Item:
|2013031494809_301746_1011.pdf||434.46 kB||Adobe PDF||Download|
|Title:||Permutation Codes and Steganography||Authors:||Balado, Félix
|Permanent link:||http://hdl.handle.net/10197/4369||Date:||26-May-2013||Abstract:||We show that Slepian’s Variant I permutation codes implement first-order perfect steganography (i.e., histogram-preserving steganography). We give theoretical expressions for the embedding distortion, embedding rate and embedding efficiency of permutation codes in steganography, which demonstrate that these codes conform to prior analyses of the properties of capacity-achieving perfect stegosystems with a passive warden. We also propose a modification of adaptive arithmetic coding that near optimally implements permutation coding with a low complexity, confirming all our theoretical predictions. Finally we discuss how to control the embedding distortion. Permutation coding turns out to be akin to Sallee’s model-based steganography, and to supersede both this method and LSB matching.||Type of material:||Conference Publication||Publisher:||IEEE||Copyright (published version):||2013 IEEE||Keywords:||Permutation coding; Histogram preservation; Arithmetic coding; Model-based steganography; LSB matching||DOI:||10.1109/ICASSP.2013.6638199||Language:||en||Status of Item:||Peer reviewed||Is part of:||2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) [proceedings]||Conference Details:||38th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Vancouver, Canada, May, 2013|
|Appears in Collections:||Computer Science Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.