Steganography on 3d models using a spatial subdivision technique

Authors:
Yuan-Yu Tsai;Chung-Ming Wang;Yu-Ming Cheng;Chung-Hsien Chang;Peng-Cheng Wang
Affiliations:
Institute of Computer Science, National Chung-Hsing University, Taiwan, China;Institute of Computer Science, National Chung-Hsing University, Taiwan, China;Institute of Computer Science, National Chung-Hsing University, Taiwan, China;Institute of Computer Science, National Chung-Hsing University, Taiwan, China;Institute of Computer Science, National Chung-Hsing University, Taiwan, China
Venue:
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Year:
2006

Citing 9
Cited 0

Watermaking three-dimensional polygonal models

MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Information Hiding Techniques for Steganography and Digital Watermarking

Information Hiding Techniques for Steganography and Digital Watermarking
Geometry-Based Watermarking of 3D Models

IEEE Computer Graphics and Applications
Watermarking 3D polygonal meshes in the mesh spectral domain

GRIN'01 No description on Graphics interface 2001
Robust Watermarking of Polygonal Meshes

GMP '00 Proceedings of the Geometric Modeling and Processing 2000
Robust Watermarking of Point-Sampled Geometry

SMI '04 Proceedings of the Shape Modeling International 2004
Data hiding on 3D polygonal meshes

Proceedings of the 2004 workshop on Multimedia and security
Blind Robust Watermarking Schemes for Copyright Protection of 3D Mesh Objects

IEEE Transactions on Visualization and Computer Graphics
Data hiding on 3-D triangle meshes

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new steganography algorithm for 3D models using a spatial subdivision technique. Our algorithm first decomposes the bounding volume of the cover model into voxels based on a Binary Space Partitioning (BSP) tree. The voxels are then further categorized into eight subspaces, each of which is numbered and represented as three-digit binary characters. In the embedding process, we first traverse the BSP tree, locating a leaf voxel; then we embed every three bits of the payload message into the vertex inside the leaf voxel. This is realized by translating a vertex's current position to the corresponding numbered subspace. This technique is a substitutive blind extraction scheme, where messages embedded can be extracted without the aid of the original cover model. This technique achieves high data capacity, equivalent to at least three times the number of the embedded vertices in the cover model. In addition, the stego model has insignificant visual distortion. Finally, this scheme is robust against similarity transformation attacks.