KEYWORDS: Digital watermarking, Steganography, Data hiding, Multimedia, Symmetric-key encryption, 3D applications, Lawrencium, Multimedia encryption, 3D displays, Televisions
Multimedia protection is one of the main research challenges in computer sciences. We can encrypt the media
in order to make the content unreadable without a secret key of decryption, protect the file with Digital Right
Management (DRM), or embed an hidden message in the file (watermarking and steganography). We are
interested in data hiding applications for 3D mesh. In this domain, there are various problems, of which the
synchronization of the message in the support host. The synchronization is the operation that allows to scan a
mesh with a unique path and by selecting the same areas (vertices, triangles, quadrangles, for example) before
and after the embedding even if the mesh has been noised. In this paper, we propose a new synchronization
approach based on feature point selection in a low resolution of the 3D object. The building of the low resolution
is made by decimation and the feature point selection is based on the discrete curvature computing. We evaluate
the robustness of the synchronization in the low resolution and in the high resolution.
KEYWORDS: 3D modeling, Digital watermarking, Data hiding, Multimedia, 3D image processing, Space reconnaissance, Data modeling, 3D metrology, Lead, Video
Synchronization in 3D data hiding is one of the main problems. We need to know where we can embed information,
and be able to find this space in order to extract the message. Various algorithms propose synchronization
techniques by triangle or vertex path in a 3D mesh. In this paper, we proposed a new synchronization technique
based on Euclidean minimum spanning tree computing (EMST) and the analysis of the displacement of
the vertices without moving the connections in the tree. Based on the analysis of the vertices, we select the
most robust vertices and synchronize these areas by computing a new EMST called "robust EMST". Then, we
analyze the robustness of the technique, i.e. the stability of the most robust vertices selection; and demonstrate
the consistence of the criterion selection with the vertex displacement.
KEYWORDS: Visualization, Digital watermarking, Steganography, Electroluminescence, Data hiding, 3D image processing, Databases, Internet, Multimedia, Clouds
In 3D steganography and watermarking, the synchronization of the hidden data is a major problem. We need
to know where the message is embedded in order to extract the correct information. Various algorithms have
been proposed for the last couple of years and we focused on a method based on Euclidean minimum spanning
tree (EMST) for the mesh vertices. In this paper we analyze the sensitivity of the EMST structure in order
to propose a new method more robust. We present a new theoretical analysis and we propose to visualize the
robustness of the EMST. Moreover, we can apply this analysis to various applications that can be useful in 3D
steganography such fragile area detection and prediction of the 3D object robustness during transmission on a
noisy channel.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.