A signal processing approach to fair surface design
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Watermaking three-dimensional polygonal models
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Multiresolution signal processing for meshes
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Affine Invariant Watermarks for 3D Polygonal and NURBS Based Models
ISW '00 Proceedings of the Third International Workshop on Information Security
Robust Watermarking of Polygonal Meshes
GMP '00 Proceedings of the Geometric Modeling and Processing 2000
Blind Robust Watermarking Schemes for Copyright Protection of 3D Mesh Objects
IEEE Transactions on Visualization and Computer Graphics
Dual Laplacian Editing for Meshes
IEEE Transactions on Visualization and Computer Graphics
Watermarking of 3D models using principal component analysis
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
A watermarking for 3D mesh using the patch CEGIs
Digital Signal Processing
Robust blind watermarking mechanism for point sampled geometry
Proceedings of the 9th workshop on Multimedia & security
4-points congruent sets for robust pairwise surface registration
ACM SIGGRAPH 2008 papers
A robust spectral approach for blind watermarking of manifold surfaces
Proceedings of the 10th ACM workshop on Multimedia and security
A High Capacity 3D Steganography Algorithm
IEEE Transactions on Visualization and Computer Graphics
A New Watermarking Method for 3D Models Based on Integral Invariants
IEEE Transactions on Visualization and Computer Graphics
Watermarking 3D mesh by spherical parameterization
Computers and Graphics
Blind robust 3-D mesh watermarking based on oblate spheroidal harmonics
IEEE Transactions on Multimedia
Blind and robust mesh watermarking using manifold harmonics
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
A novel semi-blind-and-semi-reversible robust watermarking scheme for 3D polygonal models
The Visual Computer: International Journal of Computer Graphics
A highly adaptable capacity and invisibility 3D watermarking based on four-points sets
Proceedings of the 12th ACM workshop on Multimedia and security
Technical Section: Robust and blind mesh watermarking based on volume moments
Computers and Graphics
Watermarking security: a survey
Transactions on Data Hiding and Multimedia Security I
An Oblivious Watermarking for 3-D Polygonal Meshes Using Distribution of Vertex Norms
IEEE Transactions on Signal Processing
Hierarchical Watermarking of Semiregular Meshes Based on Wavelet Transform
IEEE Transactions on Information Forensics and Security
A Comprehensive Survey on Three-Dimensional Mesh Watermarking
IEEE Transactions on Multimedia
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
Technical Section: Topology authentication for CAPD models based on Laplacian coordinates
Computers and Graphics
| Hi-index | 0.00 |
In this article we propose a novel, robust, and high-capacity watermarking method for 3D meshes with arbitrary connectivities in the spatial domain based on affine invariants. Given a 3D mesh model, a watermark is embedded as affine-invariant length ratios of one diagonal segment to the residing diagonal intersected by the other one in a coplanar convex quadrilateral. In the extraction process, a watermark is recovered by combining all the watermark pieces embedded in length ratios through majority voting. Extensive experimental results demonstrate the robustness, high computational efficiency, high capacity, and affine-transformation-invariant characteristics of the proposed approach.