A Fast Embedding Technique For Dirty Paper Trellis Watermarking

Abstract : This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate watermarking schemes. Nevertheless, recent researches reveal its security weakness. Previously, we proposed to reinforce its security by using a secret space before the embedding. This secret space requires to compute projections onto secrets carriers. When dealing with high rate watermarking, the CPU cost for those projections is dramatically high. After introducing the watermarking scheme, we then propose two Space Division Multiplexing (SDM) approaches which reduce the complexity. Evaluations are achieved with four different attacks and show that our proposal gives better robustness results with SDM approaches.
Type de document :
Poster
Anthony T.S. Ho and Yun Q. Shi and H.J Kim and Mauro Barni. IWDW'09: International Workshop on Digital Watermarking, Aug 2009, Guildford, United Kingdom. Springer, pp.110-120, 2009, LNCS. 〈http://www.iwdw.org.uk/〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00411704
Contributeur : Hal System <>
Soumis le : jeudi 3 septembre 2009 - 11:15:53
Dernière modification le : jeudi 11 janvier 2018 - 06:14:31
Document(s) archivé(s) le : mardi 15 juin 2010 - 19:24:40

Identifiants

  • HAL Id : lirmm-00411704, version 1

Collections

Citation

Marc Chaumont. A Fast Embedding Technique For Dirty Paper Trellis Watermarking. Anthony T.S. Ho and Yun Q. Shi and H.J Kim and Mauro Barni. IWDW'09: International Workshop on Digital Watermarking, Aug 2009, Guildford, United Kingdom. Springer, pp.110-120, 2009, LNCS. 〈http://www.iwdw.org.uk/〉. 〈lirmm-00411704〉

Partager

Métriques

Consultations de la notice

135

Téléchargements de fichiers

105