The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Progressive forest split compression
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Digital watermarking
IEEE Transactions on Visualization and Computer Graphics
Wavelet-based blind watermarking of 3D models
Proceedings of the 2004 workshop on Multimedia and security
A fragile watermarking scheme for 3D meshes
MM&Sec '05 Proceedings of the 7th workshop on Multimedia and security
Robust blind watermarking mechanism for point sampled geometry
Proceedings of the 9th workshop on Multimedia & security
Technologies for 3D mesh compression: A survey
Journal of Visual Communication and Image Representation
Data hiding on 3-D triangle meshes
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
Robust blind watermarking of point-sampled geometry
IEEE Transactions on Information Forensics and Security
| Hi-index | 0.00 |
In this paper, we propose a scheme to enhance the robustness of authentication based watermarking algorithms for 3D models (3D meshes) against compression and decompression. We target different compression techniques such as Compressed Progressive Meshes (CPM) [9], Progressive Forest Split (PFS) compression [11], and Progressive Mesh (PM) [7]. The idea behind the algorithm is to compute those set of vertices that are never used for compression. We have three sets of such vertices that are never used for compression by these techniques. The first set of vertices includes the boundary vertices that are critical for deciding the shape of the 3D model. The second set includes the neighboring vertices to the split vertex. The third set of vertices comprise of edges that do not form simple triangle. After applying the compression algorithms for 3D models, we apply the watermarking algorithm that uses geometric information only. We then watermark the vertices that are obtained from the above three sets. These watermarks are shown to be preserved even after repeated decompression and compression of 3D models. Due to the generic nature of the algorithm, we can apply the above idea to any watermarking algorithm used for other applications such as copyright protection as well.