Robust mesh watermarking based on multiresolution processing

In this paper we propose a new mesh watermarking scheme for triangle meshes, which are widely used in computer graphics systems. Arbitrary meshes lack a natural parameterization for frequency-based signal processing, and thus they are harder to be watermarked. In this paper, we adopt Guskov's multiresolution signal processing method for meshes and use his 3D non-uniform relaxation operator to construct a Burt-Adelson pyramid for the mesh, and then watermark information is embedded into a suitable coarser mesh. Since all the computation and data structures are the same as those used in the multiresolution signal processing, our mesh watermarking algorithm can be integrated naturally with the multiresolution mesh processing toolbox. To detect watermarks, registration and resampling are needed to bring the attacked mesh model back into its original location, orientation, scale, topology and resolution level. Experimental results and attack analysis are given to show that our watermarking algorithm is robust under a variety of attacks, including vertex reordering, noise addition, simplification, filtering and enhancement, cropping, etc. Our main contribution to the field of 3D watermarking is that we propose a generic applicable multiresolution framework in which other proposed techniques may fit in as well.