Fast Embedding Technique for Dirty Paper Trellis Watermarking

  • Marc Chaumont
Conference paper

DOI: 10.1007/978-3-642-03688-0_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5703)
Cite this paper as:
Chaumont M. (2009) Fast Embedding Technique for Dirty Paper Trellis Watermarking. In: Ho A.T.S., Shi Y.Q., Kim H.J., Barni M. (eds) Digital Watermarking. IWDW 2009. Lecture Notes in Computer Science, vol 5703. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Marc Chaumont
    • 1
    • 2
  1. 1.University of NîmesNîmesFrance
  2. 2.Laboratory LIRMM, UMR CNRS 5506University of Montpellier IIMontpellier cedex 05France

Personalised recommendations