Abstract
In this paper we present a high capacity data hiding method
for 3D meshes. The proposed method is blind and orders selected
vertices from the 3D object’s mesh based on a pseudo random
path. When a vertex is added to the path we embed a part of the
message by displacing its location according to the location of an-
other vertex called reference vertex. We solve the causality issue
by removing certain vertices which would otherwise interfere with
the path of selected vertices, during the message retrieval stage.
Then we fill the resulting holes by remeshing. During the exper-
iments, high bit capacity messages are embedded in several 3D
objects. These messages are hidden under high levels of security
while causing negligible surface distortions
for 3D meshes. The proposed method is blind and orders selected
vertices from the 3D object’s mesh based on a pseudo random
path. When a vertex is added to the path we embed a part of the
message by displacing its location according to the location of an-
other vertex called reference vertex. We solve the causality issue
by removing certain vertices which would otherwise interfere with
the path of selected vertices, during the message retrieval stage.
Then we fill the resulting holes by remeshing. During the exper-
iments, high bit capacity messages are embedded in several 3D
objects. These messages are hidden under high levels of security
while causing negligible surface distortions
| Original language | English |
|---|---|
| Title of host publication | Proc. IS&T Inter. Symposium on Electronic Imaging, Vol. 3D Image Processing, Measurement (3DIPM) |
| Publisher | IS&T |
| Pages | 1-7 |
| Number of pages | 7 |
| DOIs | |
| Publication status | Published - 14 Feb 2016 |