UNIGE document Chapitre d'actes
previous document  unige:47936  next document
add to browser collection
Title

Achievable Rate Analysis of Geometrically Robust Data-Hiding Codes In Asymptotic Set-ups

Authors
Published in Proceedings of the 13th European Signal Processing Conference, EUSIPCO 2005. Antalya (Turkey) - Sept. 4-8 - IEEE. 2005, p. 1-4
Abstract 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 informationtheoretic point of view for theoretical set-ups, where lengths of data sequences asymptotically approach infinity
Keywords data encapsulationgeometric codessynchronisation
Full text
Structures
Research groups Computer Vision and Multimedia Laboratory
Multimodal Interaction Group
Stochastic Information Processing Group
Citation
(ISO format)
TOPAK, Emre et al. Achievable Rate Analysis of Geometrically Robust Data-Hiding Codes In Asymptotic Set-ups. In: Proceedings of the 13th European Signal Processing Conference, EUSIPCO 2005. Antalya (Turkey). [s.l.] : IEEE, 2005. p. 1-4. https://archive-ouverte.unige.ch/unige:47936

138 hits

17 downloads

Update

Deposited on : 2015-03-06

Export document
Format :
Citation style :