Skip to main content

A Data Hiding Algorithm for Point-Sampled Geometry

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3980))

Included in the following conference series:

  • 1150 Accesses

Abstract

We present a data hiding algorithm for point-sampled geometry. The basic idea is to consider every point of a model as a message point. We propose a Virtual Multi-Level Embed Procedure to embed information based on shifting the message point, the order of which is assigned by principal component analysis. We modify the message point by its virtual geometrical property, which leads to a change of the position of the orthogonal projection of the message point on the virtual base, the height of the virtual triangle, and the arc length of the virtual circle. Experimental results show that the proposed technique is efficient and secure, has high capacity and low distortion, and is robust against affine transformations. The technique has proven to be feasible in data hiding.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Johnson, N.F., Jajodia, S.: Exploring Steganography: Seeing the Unseen. IEEE Computer 31(2), 26–34 (1998)

    Google Scholar 

  2. Petitcolas, F.A.P., Anderson, R.J., Kuhn, M.G.: Information Hiding - A Survey. Proc. IEEE Special Issue on Protection of Multimedia Content 87(7), 1062–1078 (1999)

    Google Scholar 

  3. Katzenbeisser, S., Petitcolas, F.A.P.: Information Hiding Techniques for Steganography and Digital Watermarking. Artech House, London (2000)

    Google Scholar 

  4. Pauly, M., Keiser, R., Gross, M.: Multi-Scale Feature Extraction on Point-Sampled Surfaces. Computer Graphics Forum 22(3), 281–289 (2003)

    Article  Google Scholar 

  5. Kobbelt, L., Botsch, M.: A Survey of Point-Based Techniques in Computer Graphics. Computers & Graphics 28(6), 801–814 (2004)

    Article  Google Scholar 

  6. Bayer, P., Widenfors, H.: Information Hiding - Steganographic Content in Streaming Media. M.S. thesis, Deptment of Software Engineering and Computer Science, Blekinge Institute of Technology, Sweden (2002)

    Google Scholar 

  7. Ohbuchi, R., Masuda, H., Aono, M.: Watermarking Three-Dimensional Polygonal Models Through Geometric and Topological Modifications. IEEE Journal on Selected Areas in Communications 16(4), 551–560 (1998)

    Article  Google Scholar 

  8. Praun, E., Hoppe, H., Finkelstein, A.: Robust mesh watermarking. In: Proc. SIGGRAPH, pp. 49–56 (1999)

    Google Scholar 

  9. Ohbuchi, R., Takahashi, S., Miyasawa, T., Mukaiyama, A.: Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain. In: Proc. Graphics Interface, pp. 9–17 (2001)

    Google Scholar 

  10. Ohbuchi, R., Mukaiyama, A., Takahashi, S.: A Frequency-Domain Approach to Watermarking 3D Shapes. Computer Graphics Forum 21(3), 373–382 (2002)

    Article  Google Scholar 

  11. Cayre, F., Macq, B.: Data Hiding on 3-D Triangle Meshes. IEEE Trans. Signal Processing 51(4), 939–949 (2003)

    Article  MathSciNet  Google Scholar 

  12. Cayre, F., Devillers, O., Schmitt, F., Maitre, H.: Watermarking 3D Triangle Meshes for Authentication and Integrity. Rapport de recherche 5223, INRIA (2004)

    Google Scholar 

  13. Wang, C.M., Cheng, Y.M.: An Efficient Information Hiding Algorithm for Polygon Models. Computer Graphics Forum 24(3), 591–600 (2005)

    Article  Google Scholar 

  14. Wang, C.M., Wang, P.C.: Data Hiding Approach for Point-Sampled Geometry. IEICE Transactions on Communications E88-B 1, 190–194 (2005)

    Article  Google Scholar 

  15. Cotting, D., Weyrich, T., Pauly, M., Gross, M.: Robust Watermarking of Point-Sampled Geometry. In: Proc. International Conference on Shape Modeling and Applications, pp. 233–242 (2004)

    Google Scholar 

  16. Ohbuchi, R., Mukaiyama, A., Takahashi, S.: Watermarking a 3D Shape Model Defined as a Point Set. In: Proc. of International Conference on Cyberwords, pp. 392–399 (2004)

    Google Scholar 

  17. Rencher, A.C.: Methods of Multivariate Analysis, 2nd edn. Wiley, New York (2002)

    Book  MATH  Google Scholar 

  18. Cachin, C.: An Information-Theoretic Model for Steganography. In: Proc. of 2nd Information Hiding Workshop, pp. 306–318 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheng, YM., Wang, CM., Tsai, YY. (2006). A Data Hiding Algorithm for Point-Sampled Geometry. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751540_20

Download citation

  • DOI: https://doi.org/10.1007/11751540_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34070-6

  • Online ISBN: 978-3-540-34071-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics