A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Object modelling by registration of multiple range images
Image and Vision Computing - Special issue: range image understanding
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
Watermarking 3D Objects for Verification
IEEE Computer Graphics and Applications
IDMS '97 Proceedings of the 4th International Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services
Wavelet-based blind watermarking of 3D models
Proceedings of the 2004 workshop on Multimedia and security
Robust principal curvatures on multiple scales
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
A New Watermarking Method for 3D Models Based on Integral Invariants
IEEE Transactions on Visualization and Computer Graphics
Evaluation for small visual difference between conforming meshes on strain field
Journal of Computer Science and Technology
A public fragile watermarking scheme for 3D model authentication
Computer-Aided Design
Watermarking 3D mesh by spherical parameterization
Computers and Graphics
Watermarked 3-D Mesh Quality Assessment
IEEE Transactions on Multimedia
Watermarking three-dimensional polygonal models through geometric and topological modifications
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Image quality assessment: from error visibility to structural similarity
IEEE Transactions on Image Processing
Journal of Systems and Software
Technical Section: Topology authentication for CAPD models based on Laplacian coordinates
Computers and Graphics
Hi-index | 0.00 |
Watermarking algorithms provide a way of hiding or embedding some bits of information in a watermark. In the case of watermarking a 3D model, many algorithms employ a so-called indexed localization scheme. In this paper, we propose an optimization framework with two new steps for such watermarking algorithms to improve their capacity and invisibility. The first step is to find an optimal layout of invariant units to improve capacity. The second step is to rearrange the correspondence between the watermark units and the invariant units to improve invisibility. Experimental tests show that by using this framework, the capacity and invisibility of watermarking algorithms can be greatly improved.