Optimum Reversible Data Hiding and Permutation Coding
|Title:||Optimum Reversible Data Hiding and Permutation Coding||Authors:||Balado, Félix||Permanent link:||http://hdl.handle.net/10197/7259||Date:||19-Nov-2015||Abstract:||This paper is mainly devoted to investigating the connection between binary reversible data hiding and permutation coding. We start by undertaking an approximate combinatorial analysis of the embedding capacity of reversible watermarking in the binary Hamming case, which asymptotically shows that optimum reversible watermarking must involve not only 'writing on dirty paper', as in any blind data hiding scenario, but also writing on the dirtiest parts of the paper. The asymptotic analysis leads to the information-theoretical result given by Kalker and Willems more than a decade ago. Furthermore, the novel viewpoint of the problem suggests a near-optimum reversible watermarking algorithm for the low embedding distortion regime based on permutation coding. A practical implementation of permutation coding, previously proposed in the context of maximum-rate perfect steganography of memoryless hosts, can be used to implement the algorithm. The paper concludes with a discussion on the evaluation of the general rate-distortion bound for reversible data hiding.||Funding Details:||University College Dublin||Type of material:||Conference Publication||Publisher:||IEEE||Keywords:||Binary reversible watermarking; Permutation coding||Other versions:||http://www.wifs2015.org/||Language:||en||Status of Item:||Peer reviewed||Conference Details:||7th IEEE International Workshop on Information Forensics and Security (WIFS), Rome, Italy, 16 - 19 November, 2015|
|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.