Optimum Perfect Steganography of Memoryless Sources as a Rate-Distortion Problem
Files in This Item:
|permutation_codes_wifs13_submitted_camera_ready.pdf||297.34 kB||Adobe PDF||Download|
|Title:||Optimum Perfect Steganography of Memoryless Sources as a Rate-Distortion Problem||Authors:||Balado, Félix
|Permanent link:||http://hdl.handle.net/10197/5065||Date:||20-Nov-2013||Online since:||2013-11-29T10:02:41Z||Abstract:||Slepian’s variant I permutation coding has been recently shown to be a fundamental steganographic tool, as it implements optimum perfect steganography of memoryless sources. Although real host signals are not memoryless, a decorrelating energy-preserving transform can always be applied before a method that assumes a memoryless source, as is usually done in the dual problem of source coding. A further constraint is needed in practice: the information-carrying signal must be close to the host, according to some distance measure. Thus steganography of memoryless sources using permutation coding is a rate-distortion problem. Here we delve deeper in the study of the embedding distortion of permutation coding, and we show that the rate-distortion tradeoff for partitioned permutation coding is nearoptimum according to the Gel’fand and Pinsker capacity formula.||Funding Details:||Science Foundation Ireland||Type of material:||Conference Publication||Publisher:||IEEE||Start page:||174||End page:||179||Copyright (published version):||2013, IEEE||Keywords:||Steganography; Decorrelation; Distortion; Memoryless systems; Rate distortion theory; Source coding||DOI:||10.1109/WIFS.2013.6707814||Language:||en||Status of Item:||Peer reviewed||Conference Details:||IEEE International Workshop on Information Forensics and Security (WIFS), Guangzhou, China, November 18-21, 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.