Skip to Main content Skip to Navigation
Journal articles

Broken Arrows

Teddy Furon 1 Patrick Bas 2
1 TEMICS - Digital image processing, modeling and communication
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
2 GIPSA-C2S - GIPSA - Communication, Signal et Sécurité
GIPSA-DIS - Département Images et Signal
Abstract : This paper makes an account of the design and investigations done for the still image watermarking technique used in the 2nd edition of the BOWS challenge. This technique is named "broken arrows" for some reasons given later on, and abbreviated "BA." This zero-bit algorithm is an implementation of a recent theoretical result by Merhav and Sabbag (2008) with precautions taken with respect to robustness, security, and imperceptibility. A new robustness criterion, based on the nearest border point of a cone, is proposed. The security constraint is taken into account by increasing the diversity of the watermark, sculpturing and randomizing the shape of the detection regions. The imperceptibility and robustness are also provided by adopting proportional embedding in the wavelet domain. The algorithm has been benchmarked using a database of 2000 images. For a probability of false alarm below 3⋅10−6 and a PSNR of 43 dB, the overall robustness regarding various classical image processing seems a promising and strong basis for the challenge.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download
Contributor : Patrick Bas <>
Submitted on : Wednesday, October 29, 2008 - 11:01:51 AM
Last modification on : Wednesday, October 7, 2020 - 11:40:13 AM
Long-term archiving on: : Monday, June 7, 2010 - 6:54:39 PM


Publisher files allowed on an open archive



Teddy Furon, Patrick Bas. Broken Arrows. EURASIP Journal on Information Security, Hindawi/SpringerOpen, 2008, 2008, pp.ID 597040. ⟨10.1155/2008/597040⟩. ⟨hal-00335311⟩



Record views


Files downloads