Abstract
This paper presents a robust mesh-watermarking algorithm that modifies low-frequency components of the mesh's shape for watermarking. The watermarking algorithm described in this paper tries to alleviates two weaknesses of our previous mesh-watermarking algorithm1), that are, (1) the weakness of the watermarks against vertex connectivity changes, due, for example, to mesh simplification, and (2) the high computational cost of the algorithm that prohibits processing of larger meshes. We added resiliency against vertex connectivity changes by recreating the connectivity of the original mesh on the watermarked and possibly attacked mesh by means of mesh resampling. We reduced the computational cost by watermarking disjunct subsets of the mesh. As with our previous watermarks, our new watermarks resist mesh smoothing, cropping, and additive random noise. Furthermore, our watermarks resist a wider class of attacks, including, for example, an attack that combines mesh simplification, similarity transformation, and cropping. In addition, our new algorithm is capable of watermarking larger meshes having tens of thousands of vertices. For example, a watermark embedded in a mesh having 66K polygons survived an attack that combines a mesh simplification down to a half of the original polygon counts followed by a cropping and a similarity transformation.
