Yang, Ying and Pintus, Ruggero and Rushmeier, Holly and Ivrissimtzis, Ioannis (2017) 'A 3D steganalytic algorithm and steganalysis-resistant watermarking.', IEEE transactions on visualization and computer graphics., 23 (2). pp. 1002-2626.
We propose a simple yet efficient steganalytic algorithm for watermarks embedded by two state-of-the-art 3D watermarking algorithms by Cho et al. The main observation is that while in a clean model the means/variances of Cho et al.’s normalized histogram bins are expected to follow a Gaussian distribution, in a marked model their distribution will be bimodal. The proposed algorithm estimates the number of bins through an exhaustive search and then the presence of a watermark is decided by a tailor made normality test or a t-test. We also propose a modification of Cho et al.’s watermarking algorithms with the watermark embedded by changing the histogram of the radial coordinates of the vertices. Rather than targeting a continuous statistics such as the mean or variance of the values in a bin, the proposed watermarking modifies a discrete statistic, which here is the height of the histogram bin, to achieve watermark embedding. Experimental results demonstrate that the modified algorithm offers not only better resistance against the steganalytic attack we developed, but also an improved robustness/capacity trade-off.
|Full text:||(AM) Accepted Manuscript|
Download PDF (3955Kb)
|Publisher Web site:||https://doi.org/10.1109/TVCG.2016.2525771|
|Publisher statement:||© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.|
|Date accepted:||24 January 2016|
|Date deposited:||29 February 2016|
|Date of first online publication:||04 February 2016|
|Date first made open access:||29 February 2016|
Save or Share this output
|Look up in GoogleScholar|