Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
558685 | Digital Signal Processing | 2007 | 18 Pages |
This paper proposes 3D mesh watermarking using the CEGI distribution that is robust against mesh simplification, cropping, vertex randomization, and rotation and does not require the original model for realignment or extracting the watermark. In the proposed algorithm, a 3D mesh model is divided into patches using a distance measure, then the watermark bits are embedded into the normal vector direction of the meshes that are mapped into cells with large complex weights in the patch CEGIs. The watermark can be extracted based on two watermark keys, the known center point of each patch and a rank table of the cells in each patch. In a rotated model, the realignment process is accomplished using the above watermark key instead of the original model before extracting the watermark. Experimental results verified the robustness of the proposed algorithm based on watermark extraction after various types of attack.