Options
Optimum Perfect Steganography of Memoryless Sources as a Rate-Distortion Problem
Author(s)
Date Issued
2013-11-20
Date Available
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.
Sponsorship
Science Foundation Ireland
Type of Material
Conference Publication
Publisher
IEEE
Start Page
174
End Page
179
Copyright (Published Version)
2013, IEEE
Language
English
Status of Item
Peer reviewed
Conference Details
IEEE International Workshop on Information Forensics and Security (WIFS), Guangzhou, China, November 18-21, 2013
This item is made available under a Creative Commons License
File(s)
Owning collection
Scopus© citations
2
Acquisition Date
Apr 18, 2024
Apr 18, 2024
Views
1747
Acquisition Date
Apr 18, 2024
Apr 18, 2024
Downloads
602
Last Week
2
2
Last Month
9
9
Acquisition Date
Apr 18, 2024
Apr 18, 2024