SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Geometry-Based Watermarking of 3D Models
IEEE Computer Graphics and Applications
Blind Robust Watermarking Schemes for Copyright Protection of 3D Mesh Objects
IEEE Transactions on Visualization and Computer Graphics
A high-capacity steganographic approach for 3D polygonal meshes
The Visual Computer: International Journal of Computer Graphics
An adaptive steganographic algorithm for 3D polygonal meshes
The Visual Computer: International Journal of Computer Graphics
A High Capacity 3D Steganography Algorithm
IEEE Transactions on Visualization and Computer Graphics
Digital Watermarking and Steganography
Digital Watermarking and Steganography
Blind robust 3-D mesh watermarking based on oblate spheroidal harmonics
IEEE Transactions on Multimedia
Roughness-adaptive 3-D watermarking based on masking effect of surface roughness
IEEE Transactions on Information Forensics and Security
Data hiding on 3-D triangle meshes
IEEE Transactions on Signal Processing
Hierarchical Watermarking of Semiregular Meshes Based on Wavelet Transform
IEEE Transactions on Information Forensics and Security
Fragile watermarking for authenticating 3-D polygonal meshes
IEEE Transactions on Multimedia
A Comprehensive Survey on Three-Dimensional Mesh Watermarking
IEEE Transactions on Multimedia
Watermarking mesh-based representations of 3-D objects using local moments
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
Most 3D steganographic algorithms emphasize high data capacity, low distortion, and correct data extraction. However, their disadvantage is in the existence of the same embedding capacity for each data-embedded vertex in the 3D models. Embedding the same capacity in the vertex located on the surface with different properties may cause obvious distortion, making it difficult to achieve the initial goal of information-hiding techniques. This study proposes a new and adaptive 3D steganographic algorithm that considers the surface complexity. To increase the accuracy of the complexity estimation for each embedding vertex, the proposed algorithm adopts a vertex decimation process to determine its referencing neighbors. Thereafter, different amounts of the secret messages are embedded according to the surface properties of each vertex. This approach preserves important shape features and produces a more imperceptible result. Experimental results show that the proposed adaptive algorithm can achieve more accurate estimation results with a higher data capacity and acceptable distortion. The proposed technique is feasible in 3D steganography.