A robust watermarking based on feature points

Authors:
Xiaoqing Feng;Li Li;Zhigen Pan
Affiliations:
State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China and Institue of Computer Application Techniques, College of Information, Zhejiang University of Finance & Economics, Hangzhou, China;Hangzhou Institute of Electronic Engineering, Hangzhou, China;State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China
Venue:
Edutainment'07 Proceedings of the 2nd international conference on Technologies for e-learning and digital entertainment
Year:
2007

Citing 6
Cited 1

Robust mesh watermarking

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Partitioning 3D Surface Meshes Using Watershed Segmentation

IEEE Transactions on Visualization and Computer Graphics
Geometry-Based Watermarking of 3D Models

IEEE Computer Graphics and Applications
Estimating the tensor of curvature of a surface from a polyhedral approximation

ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Protected interactive 3D graphics via remote rendering

ACM SIGGRAPH 2004 Papers
Watermarking 3D mesh by spherical parameterization

Computers and Graphics

A new approach of mesh watermarking based on maximally stable meshes detection

NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper present a novel watermarking algorithm, which is obtained based on a watershed segmentation, one image watermarking algorithm and the addition property of Fourier transform. Firstly, some feature points of 3D meshes are extracted by using an effective watershed segmentation algorithm. Furthermore, in order to keep the mesh transparency, watermark information is preprocessed by using an image watermarking algorithm. Finally, digital watermarking is embedded into those feature points. During extraction, the target model is registered by principal component analysis. We have applied our method to a number of 3D mesh models of different geometric and topological complexity. Those experimental results prove that the algorithm is robust against a variety of attacks, such as rotation, translation, scaling, combinations of the above and re-sort.