Achievable rate analysis of geometrically robust data-hiding codes in asymptotic set-ups

Geometrical transformations bring synchronization problems into the robust digital data-hiding. Previous works on this subject were concentrated on the robustness to particular geometrical transformations. In this paper, the achievable rates of reliable robust data-hiding in channels with geometrica...

Full description

Saved in:
Bibliographic Details
Main Authors: Topak, Emre, Voloshynovskiy, Sviatoslav, Koval, Oleksiy, Pun, Thierry
Format: Conference Proceeding
Language:English
Subjects:
Asymptotic properties
Channels
Decoding
Digital
Encoding
Infinity
Reliability theory
Robustness
Signal processing
Synchronization
Transformations
Upper bound
Watermarking
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Geometrical transformations bring synchronization problems into the robust digital data-hiding. Previous works on this subject were concentrated on the robustness to particular geometrical transformations. In this paper, the achievable rates of reliable robust data-hiding in channels with geometrical transformations are investigated from an information-theoretic point of view for theoretical set-ups, where lengths of data sequences asymptotically approach infinity.