doi: 10.7763/IJMO.2011.V1.3
An High-capacity Steganographic Scheme for 3D Point Cloud Models Using Self-similarity Partition
QI Ke
,
Xie Dong-qing
- School of Computer Science and Education Software, Guangzhou University, Guangzhou 510006, China
Abstract
This paper presents a new steganographic scheme for 3D point cloud models using self-similarity partition. The new scheme partitions the 3D point cloud model to patches using self-similarity measures, and generates the codebook. The representative patches and similar patches are then taken from the codebook for every similar patch chain as the reference patches and the message patches. Finally, every message point in the similar message patches which has the point-to-point correspondence with a certain reference point in the reference patch can embed at least three bits by shifting the message point from current point to the corresponding embedding position using space subdivision. Experimental results show that the proposed technique is secure, has high capacity and low distortion, and is robust against uniform affine transformations such as transformation, rotation, scaling. In addition, a concise shape description and a similarity measures are devoted to improving performance for forming codebook and constructing point traversal. The technique can be considered as a side-match steganography and has proven to be a feasible alternative to other steganographic schemes for 3D point cloud model.
Keywords
- steganography
- 3D point cloud models
- self-similarity patch chain
- spatial domain
How to Cite
QI Ke and Xie Dong-qing, "An High-capacity Steganographic Scheme for 3D Point Cloud Models Using Self-similarity Partition," International Journal of Modeling and Optimization, vol. 1, no. 1, pp. 13-18, 2011. https://doi.org/ 10.7763/IJMO.2011.V1.3
Copyright & License
Copyright © 2011 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).