Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Digital watermarking
Analysis of digital watermarks subjected to optimum linear filtering and additive noise
Signal Processing - Special section on information theoretic aspects of digital watermarking
Computing the Probability of False Watermark Detection
IH '99 Proceedings of the Third International Workshop on Information Hiding
Practical security analysis of dirty paper trellis watermarking
IH'07 Proceedings of the 9th international conference on Information hiding
Watermarking security: theory and practice
IEEE Transactions on Signal Processing - Part II
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources
IEEE Transactions on Information Theory
IEEE Transactions on Image Processing
On-off keying modulation and tardos fingerprinting
Proceedings of the 10th ACM workshop on Multimedia and security
Two key estimation techniques for the broken arrows watermarking scheme
Proceedings of the 11th ACM workshop on Multimedia and security
Spread-spectrum watermarking security
IEEE Transactions on Information Forensics and Security
Estimating the probability of false alarm for a zero-bit watermarking technique
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Asymptotically optimum universal watermark embedding and detection in the high-SNR regime
IEEE Transactions on Information Theory
Towards robust and secure watermarking
Proceedings of the 12th ACM workshop on Multimedia and security
| Hi-index | 0.07 |
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.