Options
Permutation Codes and Steganography
File(s)
File | Description | Size | Format | |
---|---|---|---|---|
2013031494809_301746_1011.pdf | 434.46 KB |
Author(s)
Date Issued
26 May 2013
Date Available
18T11:49:06Z June 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.
Other Sponsorship
SFI Research Frontiers
Type of Material
Conference Publication
Publisher
IEEE
Copyright (Published Version)
2013 IEEE
Language
English
Status of Item
Peer reviewed
Part of
2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) [proceedings]
Description
38th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Vancouver, Canada, May, 2013
ISSN
1520-6149
This item is made available under a Creative Commons License
Owning collection
Scopus© citations
5
Acquisition Date
Feb 7, 2023
Feb 7, 2023
Views
2129
Last Week
1
1
Last Month
1
1
Acquisition Date
Feb 7, 2023
Feb 7, 2023
Downloads
475
Last Month
229
229
Acquisition Date
Feb 7, 2023
Feb 7, 2023