Blind and robust 3D mesh watermarks

This paper discusses the performance a new robust, spatial, blind watermarking method for hiding encoded data into a geometric structure of the three-dimensional (3D) mesh model. By combining an algorithm for reliable host vertex selection and error correction codes, our watermarking neutralizes negative influence of optimization to watermark resilience. Using geometrical criteria, the algorithm selects mesh vertices with a minimum deletion probability in the optimization process. Selected vertices are then used by a quantizer for embedding the encoded watermark information. The watermark is reconstructed in a two step process involving the blind extraction of selected vertices and decoding of embeded data.