Spectral compression of mesh geometry
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
High-pass quantization for mesh encoding
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Blind Robust Watermarking Schemes for Copyright Protection of 3D Mesh Objects
IEEE Transactions on Visualization and Computer Graphics
Technical Section: Subdivision surface watermarking
Computers and Graphics
A robust spectral approach for blind watermarking of manifold surfaces
Proceedings of the 10th ACM workshop on Multimedia and security
Scalar Costa scheme for information embedding
IEEE Transactions on Signal Processing
An Oblivious Watermarking for 3-D Polygonal Meshes Using Distribution of Vertex Norms
IEEE Transactions on Signal Processing
A Comprehensive Survey on Three-Dimensional Mesh Watermarking
IEEE Transactions on Multimedia
Technical Section: Robust and blind mesh watermarking based on volume moments
Computers and Graphics
A robust high-capacity affine-transformation-invariant scheme for watermarking 3D geometric models
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special Issue on Multimedia Security
Bag of words and local spectral descriptor for 3D partial shape retrieval
EG 3DOR'11 Proceedings of the 4th Eurographics conference on 3D Object Retrieval
| Hi-index | 0.00 |
In this paper, we present a new blind and robust 3-D mesh watermarking scheme that makes use of the recently proposed manifold harmonics analysis. The mesh spectrum coefficient amplitudes obtained by using this analysis are quite robust against various attacks, including connectivity changes. A blind 16-bit watermark is embedded through an iterative scalar Costa quantization of the low frequency coefficient amplitudes. The imperceptibility of the watermark is ensured since the human visual system has been proved insensitive to the mesh low frequency components modification. The embedded watermark is experimentally robust against both geometry and connectivity attacks. Comparison results with two state-ofthe-art methods are provided.