ARTSccelerated ray-tracing system
IEEE Computer Graphics and Applications
Object modelling by registration of multiple range images
Image and Vision Computing - Special issue: range image understanding
A signal processing approach to fair surface design
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Opportunities for watermarking standards
Communications of the ACM
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Watermarking 3D Objects for Verification
IEEE Computer Graphics and Applications
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
Nefertiti: a query by content software for three-dimensional models databases management
NRC '97 Proceedings of the International Conference on Recent Advances in 3-D Digital Imaging and Modeling
Watermarking 3D mesh by spherical parameterization
Computers and Graphics
Watermarking three-dimensional polygonal models through geometric and topological modifications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper presents an algorithm for the robust watermarking of 3D polygonal mesh models. The proposed algorithm embeds the watermark into a 2D image extracted from the 3D model, rather than directly embedding it into 3D geometry. The proposed embedding domain, i.e., the 2D image, is devised to be robust against the attacks like mesh simplification which severely modifies the vertices and connectivity while preserving the appearance of the model. The watermark-embedded model is obtained by using a simple vertex perturbation algorithm without iterative optimization. Two exemplary watermark applications using the proposed methods are also presented: one is to embed several bits into 3D models and the other is to detect only the existence of a watermark. The experimental results show that the proposed algorithm is robust against similarity transform, mesh simplification, additive Gaussian noise, quantization of vertex coordinates and mesh smoothing, and that its computational complexity is lower than that of the conventional methods.