Permutation Steganography for Polygonal Meshes Based on Coding Tree

Abstract

We propose a coding tree for permutation steganography in polygonal meshes. Instead of conceptually building a complete binary tree for remaining embedding/extracting primitives to encode/decode bitstream, our method lengthens bitstream by exploiting the coding tree of the primitives, a binary tree which is a little bit skewed. The coding tree has higher levels than the complete binary tree so that as experimental results show, the average capacity of our approach is more about 0.39 bit/vertex than that of Bogomjakov et al. [5], and the improvement of the maximal capacity comes up to 40% of Bogomjakov et al. [5]. Still, our method has the minimal capacity same with Bogomjakov et al. [5], and is simple and easy to implement as well. This ordering is obtained based on the mesh connectivity [14], making our method robust to geometric affine transformations. Also, the primitive rearrangement does not distort the cover media and cause suspicion of the hidden message

Adaptive Unified Data Embedding and Scrambling for Three-Dimensional Mesh Models

“…Available RDH algorithms for 3D mesh models are very few compared to RDH for digital images. To increase the robustness and capacity of steganography for 3D models, various RDH algorithms are proposed from different perspectives [25]- [27]. The existing algorithms can be classified into three categories: 1) 3D RDH in the spatial domain, 2) 3D RDH in the transform domain, and 3) 3D RDH in the compressed domain.…”

A Lossless Watermarking for 3D STL Model Based on Entity Rearrangement and Bit Mapping

“…Although reversible embedding can recover the host to a certain, it still cannot completely resolve the geometric distortion. Recently, entity rearrangement was proposed for data hiding (Artz, 2001;Cheng & Wang, 2006;Tan, Lin, Tai & Chang, 2009;Lin, Chao, Chen, Yu & Hsu, 2013;Luo, Lu & Wang, 2010;Bogomjakov, Gotsman & Isenburg, 2008;Huang, Li & Wang, 2009;Tu, Tai, Isenburg & Chang, 2010;Tu, Hsu & Tai, 2010;Tu & Tai, 2012), which does not introduce geometric distortion. However, there still exists obvious contradiction between capacity and time complexity.…”