Data hiding on 3D polygonal meshes

Authors:
Y. Maret;T. Ebrahimi
Affiliations:
Swiss Federal Institute of Technology, Lausanne, Switzerland;Swiss Federal Institute of Technology, Lausanne, Switzerland
Venue:
Proceedings of the 2004 workshop on Multimedia and security
Year:
2004

Citing 6
Cited 8

Row Ordering for a Sparse QR Decomposition

SIAM Journal on Matrix Analysis and Applications
Surface simplification using quadric error metrics

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Robust mesh watermarking

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Robust Watermarking of Polygonal Meshes

GMP '00 Proceedings of the Geometric Modeling and Processing 2000
Watermarking of 3D models using principal component analysis

ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
Data hiding on 3-D triangle meshes

IEEE Transactions on Signal Processing

Technical Section: Subdivision surface watermarking

Computers and Graphics
Technical section: Steganography on point-sampled geometry

Computers and Graphics
A high-capacity data hiding method for polygonal meshes

IH'06 Proceedings of the 8th international conference on Information hiding
Three-dimensional meshes watermarking: review and attack-centric investigation

IH'07 Proceedings of the 9th international conference on Information hiding
A novel data hiding algorithm using normal vectors of 3d model

CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Steganography on 3d models using a spatial subdivision technique

CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Technical Section: A high-capacity data-hiding approach for polygonal meshes using maximum expected level tree

Computers and Graphics
Performance assessment of a fast and accurate scalar optical diffraction field computation algorithm

3D Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a high-capacity method to embed information into the geometry of a 3D polygonal mesh. The method extends a previously reported work, to which several improvements have been brought. By construction, the new embedding algorithm is robust against rotation, scaling and translation attacks. Analysis of the proposed method on different meshes showed that its embedding capacity compares to that of previous high-capacity works. Furthermore, the new technique introduces only negligible amount of distortions to the cover mesh.