Skip to Main content Skip to Navigation
Conference papers

Two Key Estimation Techniques for the Broken-Arrows Watermarking Scheme

Abstract : This paper presents two different key estimation attacks targeted for the image watermarking system proposed for the BOWS-2 contest. Ten thousands images are used in order to estimate the secret key and remove the watermark while minimizing the distortion. Two different techniques are proposed. The first one combines a regression-based denoising process to filter out the component of the original images and a clustering algorithm to compute the different components of the key. The second attack is based on an inline subspace estimation algorithm, which estimates the subspace associated with the secret key without computing eigen decomposition. The key components are then estimated using Independent Component Analysis and a strategy designed to leave efficiently the detection region is presented. On six test images, the two attacks are able to remove the mark with very small distortions (between 41.8 dB and 49 dB).
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Patrick Bas <>
Submitted on : Thursday, May 14, 2009 - 11:15:51 AM
Last modification on : Wednesday, October 7, 2020 - 11:40:14 AM
Long-term archiving on: : Monday, October 15, 2012 - 10:25:32 AM


Explicit agreement for this submission


  • HAL Id : hal-00384058, version 1



Patrick Bas, Andreas Westfeld. Two Key Estimation Techniques for the Broken-Arrows Watermarking Scheme. ACM Multimedia and Security Workshop 2009, Sep 2009, Princeton NJ, United States. pp.1-8. ⟨hal-00384058⟩



Record views


Files downloads