Abstract

In this paper, the best achievable tradeoffs between /spl Delta/, R/sub e/ and R/sub c/, that maintain reliable estimation of V is characterized. The attack-free version of the public problem of joint information embedding and entropy coding, where the covertext, the watermark and the stegotext are drawn from finite alphabets. It is possible to attribute a different watermark to each codebook, and thus, the watermark can be correctly retrieved according to the codebook to which the composite sequence belongs. The achievable rate region can also be expressed in terms of the maximum achievable embedding capacity. The watermark by the joint typicality property of the decompressed composite sequence with the source sequence and the watermark are evaluated.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.