Digital watermarking
Data hiding on 3-D triangle meshes
IEEE Transactions on Signal Processing
An Oblivious Watermarking for 3-D Polygonal Meshes Using Distribution of Vertex Norms
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
In this paper, we present a watermarking method for 3-D mesh sequences with a fixed connectivity. The main idea is to transform each coordinate of vertex with the identical connectivity index along temporal axis using wavelet transform and modify the distribution of wavelet coefficients in temporally high (or middle)-frequency frames according to watermark bit to be embedded. Due to the use of the distribution, our method can retrieve the hidden watermark without any information about original mesh sequences in the process of watermark detection. To increase the watermark capacity, all vertices are divided into groups, namely bins, using the distribution of scaling coefficients in low-frequency frames. As the vertices with the identical connectivity index over whole frames belong to one bin, their wavelet coefficients are also assigned into the same bin. Then, the watermark is embedded into each axis of the wavelet coefficients. Through simulations we show that the proposed is fairly robust against various attacks that are probably concerned in copyright protection of 3-D mesh sequences.