Asymptotically Optimum Perfect Universal Steganography of Finite Memoryless Sources

Files in This Item:
File Description SizeFormat 
permutation_codes_tit_final.pdf518.36 kBAdobe PDFDownload
Title: Asymptotically Optimum Perfect Universal Steganography of Finite Memoryless Sources
Authors: Balado, Félix
Haughton, David
Permanent link: http://hdl.handle.net/10197/9301
Date: Feb-2018
Abstract: A solution to the problem of asymptotically optimum perfect universal steganography of finite memoryless sources with a passive warden is provided, which is then extended to contemplate a distortion constraint. The solution rests on the fact that Slepian’s Variant I permutation coding implements firstorder perfect universal steganography of finite host signals with optimum embedding rate. The duality between perfect universal steganography with asymptotically optimum embedding rate and lossless universal source coding with asymptotically optimum compression rate is evinced in practice by showing that permutation coding can be implemented by means of adaptive arithmetic coding. Next, a distortion constraint between the host signal and the information-carrying signal is considered. Such a constraint is essential whenever real-world host signals with memory (e.g., images, audio, or video) are decorrelated to conform to the memoryless assumption. The constrained version of the problem requires trading off embedding rate and distortion. Partitioned permutation coding is shown to be a practical way to implement this trade-off, performing close to an unattainable upper bound on the rate-distortion function of the problem.
Funding Details: Science Foundation Ireland
Type of material: Journal Article
Publisher: IEEE
Copyright (published version): 2017 IEEE
Keywords: Steganography;Source coding;Permutation coding;Arithmetic coding;Rate-distortion
DOI: 10.1109/TIT.2017.2783539
Language: en
Status of Item: Peer reviewed
Appears in Collections:Computer Science Research Collection

Show full item record

Google ScholarTM

Check

Altmetric


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.