Watermarking of uncompressed and compressed video
Signal Processing
Geometry-Based Watermarking of 3D Models
IEEE Computer Graphics and Applications
Watermarking 3D polygonal meshes in the mesh spectral domain
GRIN'01 No description on Graphics interface 2001
3D polygonal meshes watermarking using normal vector distributions
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 3 (ICME '03) - Volume 03
Watermarking three-dimensional polygonal models through geometric and topological modifications
IEEE Journal on Selected Areas in Communications
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing
A numerically stable fragile watermarking scheme for authenticating 3D models
Computer-Aided Design
From 3D mesh data hiding to 3D shape blind and robust watermarking: a survey
Transactions on data hiding and multimedia security II
Three-dimensional meshes watermarking: review and attack-centric investigation
IH'07 Proceedings of the 9th international conference on Information hiding
Watermarking of 3d irregular meshes based on wavelet multiresolution analysis
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
| Hi-index | 0.00 |
Most watermarking techniques for 3-D mesh models have mainly focused on robustness against various attacks, such as adding noise, smoothing, simplification, re-meshing, clipping, and so on. These attacks perceptually damage the stego model itself. Unlike watermarking of other multimedia data, serious attacks for 3-D meshes includes similarity transform and vertex re-ordering. They can fatally destroy the watermark without any perceptual degradation of the stego model. In this paper, we propose a new watermarking technique for 3-D polygonal mesh model, which modifies the distribution of vertex norms according to watermark bit to be embedded. In particular, the proposed employs blind watermark detection technique, which extracts the watermark without referring to cover meshes. The simulation results show that the proposed is remarkably robust against similarity transform and vertex re-ordering.