An Effective Message Embedding Scheme for 3D Models

• Autorzy: Li, M-T. , Huang, N-C. , Wu, K-C. , Jan, C-K. , Wang, C-M.
• Języki publikacji: EN

Abstrakty

EN

We present an effective message embedding scheme for 3D models. We propose the unit length as the quantizer to generate an embedding order list and an embedding index list. Our scheme considers every two elements in the embedding order list as the order pair, and we embed 3 bits of 0 or 1 secret message into the index pair associated with the order pair. The message embedding is effective requiring, at most, adding 1 to, or subtracting 1 from, the index pair. This reflects a slight perturbation of a points coordinates where the magnitude of the perturbation is no greater than one unit length. Our algorithm achieves a high embedding capacity, being 4.5 times the number of points in the point cloud models. This amount of capacity allows us to convey a 502x502 resolution of the black-and-white image into a point cloud model consisting of 56,194 points for covert communication. The capacity magnitude is 50%-75%higher than that of the current state-ofthe-art algorithms, yet the model distortion due to the message embedding is smaller than that of our counterparts. Our algorithm is robust against translation, rotation, and uniformly scaling operations. It is fast, simple to implement, and the message can be extracted without referring to the original point cloud model. We believe our scheme is appropriate for most point cloud models.

Słowa kluczowe

EN

message embedding; 3D models; quantization; information hiding; steganography

• Czasopismo: Fundamenta Informaticae
• Rocznik: 2009
• Tom: Vol. 97, nr 1/2
• Strony: 93-109
• Opis fizyczny: Bibliogr. 13 poz., tab., wykr.

Twórcy

autor

Li, M-T.

autor

Huang, N-C.

autor

Wu, K-C.

autor

Jan, C-K.

autor

Wang, C-M.

• Institute of Computer Science and Engineering, National Chung Hsing University, 250, Kuo Kuang Road,402 Taichung , Taiwan,

Bibliografia

• [1] Chen, B., Wornell, G.: Quantization index modulation: a class of provably good methods fordigital watermarking and information embedding, IEEE Transactions on Information Theory, 47(4), 2001, 1423-1443.
• [2] Cheng, Y.-M.,Wang, C.-M., Tsai, Y.-Y.: A data hiding algorithm for point-sampled geometry, Lecture Notes in Computer Science, 3980, 2006, 181-191.
• [3] Gross, M., Pfister, H.: Point-based graphics (The morgan kaufmann series in computer graphics), Morgan Kaufmann Publishers Inc. San Francisco, CA, USA, 2007.
• [4] Johnson, N., Jajodia, S.: Steganography: Seeing the unseen, IEEE Computer, 31(2), 1998, 26-34.
• [5] Kobbelt, L., Botsch, M.: A survey of point-based techniques in computer graphics, Computers & Graphics, 28(6), 2004, 801-814.
• [6] Mielikainen, J.: LSB matching revisited, IEEE Signal Processing Letters, 13(5), 2006, 285-287.
• [7] Petitcolas, F., Anderson, R., Kuhn, M.: Information hiding-a survey, Proceedings of the IEEE, 87(7), 1999, 1062-1078.
• [8] Provos, N., Honeyman, P.: Hide and seek: an introduction to steganography, IEEE Security & Privacy Magazine, 1(3), 2003, 32-44.
• [9] Rencher, A.: Methods of multivariate analysis, Wiley Inter Science, 2003.
• [10] Wang, C.-M., Wang, P.-C.: Data hiding approach for point-sampled geometry, IEICE Transactions on Communications, 88-B(1), 2005, 190-194.
• [11] Wang, C.-M.,Wang, P.-C.: Steganography on point-sampled geometry, Computers & Graphics, 30(2), 2006, 244-254.
• [12] Wang, P.-C., Wang, C.-M.: Reversible data hiding for point-sampled geometry, Journal of Information Science and Engineering, 23(6), 2007, 1889-1900.
• [13] Wang, P.-C., Wu, K.-C., Wang, C.-M.: A reversible steganographic algorithm for point-sampled geometry, Intelligent Systems Design and Applications, 3, 2008, 296-301.