A Novel Data Hiding Algorithm Using Normal Vectors of 3D Model
This paper presents a novel data hiding algorithm for 3D polygonal models whose vertices have given normal vectors. The key idea of our algorithm is to embed messages by adjusting the normal vector of a vertex according to the pivot vector. All vertices in a 3D model can be embedded with multiple-bit payloads by using multiple pivot vectors. The distortion is measured by the angle between the adjusted normal vector and the original normal vector to distortion. A distortion coefficient is also introduced to control the distortion rate during the embedding process. Experimental results demonstrate that our algorithm can achieve high data capacity (up to 12 bits per normal vector), and is robust against rotation, translation, and uniform scaling attacks.
KeywordsNormal Vector Cover Model Data Hiding Distortion Rate Polygonal Mesh
Unable to display preview. Download preview PDF.
- 1.Aspert, N., Drelie, E., Maret, Y., Ebrahimi, T.: Steganography for Three- Dimensional Polygonal Meshes. In: SPIE 47th Annual Meeting, pp. 705–708 (2002)Google Scholar
- 4.Cotting, D., Weyrich, T., Payly, M., Gross, M.: Robust Watermarking of Point-Sampled Geometry. In: Proc. of International Conference on Shape Modeling and Applications 2004, pp. 233–242 (2004)Google Scholar
- 5.Katzenbeisser, S., Petitcolas, F.A.P.: Information Hiding Techniques for Steganography and Digital Watermarking, Artech House London (2000)Google Scholar
- 6.Maret, Y., Ebrahimi, T.: Data Hiding on 3D Polygonal Meshes. In: Proc. of the Multimedia and Security Workshop 2004, pp. 68–74 (2004)Google Scholar
- 8.Petitcolas, F.A.P., Anderson, R.J., Kuhn, M.G.: Information Hiding - A Survey. In: Proc. of the IEEE, vol. 87(7), pp. 1062–1078 (1999); (Special Issue on Protection of Multimedia Content)Google Scholar
- 10.Wang, C.M., Wang, P.C.: Steganography on Point-Sampled Geometry. Computers & Graphics (to appear, 2006)Google Scholar
- 11.Wagner, M.: Robust Watermarking of Polygonal Meshes. In: Proc. of Geometric Modeling and Processing 2000, pp. 201–208 (2000)Google Scholar