A 3D Steganalytic Algorithm and Steganalysis-Resistant Watermarking

Abstract

Additional information:Use policyThe full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that:• a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders.Please consult the full DRO policy for further details. 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.

Steganalysis of 3D objects using statistics of local feature sets

“…In the following we provide the experimental results of the proposed 3D steganalysis methodology. During the tests we consider detecting the information embedded in 3D objects by three different steganographic methods: the steganalysisresistant 3D watermarking proposed in [18], the mean-based watermarking method from [13], and the high capacity embedding method proposed in [17]. For the experiments we use the Princeton Mesh Segmentation project [38] database, which consists of 354 3D objects represented as meshes.…”

“…During the generation of the stego-objects using the steganalysis-resistant watermarking method proposed in [18], Fig. 7.…”

“…Stego-objects and the visualization of differences in the detection of features used for steganalysis. (a), (f) and (k) are the stego-objects obtained after using the information hiding algorithms described in [18], [13] and [17], respectively; (b), (g) and (l) show the absolute differences of vertex normals φ 11 between those stego-objects and their corresponding cover-object, respectively; (c), (h) and (m) for the curvature ratios φ 13 ; (d), (i) and (n) for the azimuth angle φ 14 ; (e), (j) and (o) for the radial distance φ 16 .…”

Rethinking the high capacity 3D steganography: Increasing its resistance to steganalysis

“…We also compared the proposed steganography, HPQ-R, to several other 3D information hiding algorithms, namely, Multi-Layer Steganography (MLS) [6], the watermarking algorithm that modifies the Mean of the distribution of the vertices' Radial distances in the Spherical coordinate system (MRS) [3], Steganalysis-Resistant Watermarking (SRW) [19], and the original version of HPQ [9], with respect to the resistance to the steganalysis. The number of embedding layers is considered as 10 and the number of intervals is chosen as 10 4 in MLS [6] whose payload rate is nearly 10 BPV.…”

“…The payload embedded in MRS [3] is 64 bits and the watermarking strength is 0.04. The parameter K in SRW [19] is set to 128, while the algorithm's upper bound for the embedding capacity is ⌊(K − 2)/2⌋ bits. The final detection errors of the five information hiding algorithms when using LFS52 for steganalysis are shown in Figure 3.…”