A Fast Embedding Technique For Dirty Paper Trellis Watermarking - Archive ouverte HAL Access content directly
Conference Poster Year : 2009

A Fast Embedding Technique For Dirty Paper Trellis Watermarking

(1)
1
Marc Chaumont

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.
Fichier principal
Vignette du fichier
IWDW2009_CHAUMONT.pdf (1.08 Mo) Télécharger le fichier
Vignette du fichier
poster_-_IWDW2009.pdf (1.48 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Other

Dates and versions

lirmm-00411704 , version 1 (03-09-2009)

Identifiers

Cite

Marc Chaumont. A Fast Embedding Technique For Dirty Paper Trellis Watermarking. Anthony T.S. Ho; Yun Q. Shi; H.J Kim; Mauro Barni. IWDW: International Workshop on Digital Watermarking, Aug 2009, Guildford, United Kingdom. Springer, 8th International Workshop on Digital Watermarking, LNCS (5703), pp.110-120, 2009, ⟨10.1007/978-3-642-03688-0_12⟩. ⟨lirmm-00411704⟩
104 View
155 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More