Paper Info
Title
Coding Theorems for Reversible Embedding.
Abstract
We consider embedding of messages (data-hiding) into i.i.d. host sequences. As in Fridrich et al. (2002) we focus on the case where recon- struction of the host sequence from the composite sequence is required. We study the balance between embedding rate and embedding distortion. First we determine the distortion-rate region corresponding to this setup. Then we generalize this result in two directions. (A) The reversible embedding setup is not robust. Therefore we also consider reconstruction based on the output sequence of a discrete memoryless channel whose input is the composite se- quence. We also determine the distortion-rate region for this setup. (B) Then we consider the case where only partial reconstruction of the host sequence is required. We determine the possible trade-ofis here between embedding rate, distortion between source sequence and composite sequence (embedding distortion), and distortion between source sequence and restoration sequence (restoration distortion), i.e. the distortion-rate region. All achievability proofs in this paper are based on the Gelfand-Pinsker (1980) achievability proof. Converses are omitted.
Year
Venue
Keywords
2003
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
data hiding,. data embedding,channels with side information,in- formation theory.
Field
DocType
Citations 
Discrete mathematics,Embedding,Coding (social sciences),Mathematics
Conference
16
PageRank 
References 
Authors
1.42
7
2
Name
Order
Citations
PageRank
Frans M. J. Willems135595.64
Ton Kalker21203140.78