Skip to main content
Log in

An efficient 3D information hiding algorithm based on sampling concepts

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

This study proposes an efficient 3D information hiding algorithm based on sampling concepts. The total embedding capacity depends on the number of feature points obtained from an auxiliary polygonal model, instead of model complexity. We use sampling concepts to derive the feature points directly on each polygon of the auxiliary polygonal model. A stego model can be efficiently generated by slightly adjusting the position of each feature point with the help of the secret message and the embedding parameter. This approach has four characteristics. First, it preserves the features of high embedding capacity and flexibility. Second, this approach resolves the shortcomings of the holed effects and the dummy points in previous algorithm. Third, this approach is efficient with the time complexity O(n), where n is the number of feature points. Finally, the proposed algorithm supports point geometries as auxiliary models by adopting a surface reconstruction scheme. The above characteristics demonstrate the feasibility of the proposed algorithm.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Bernardini F, Mittleman J, Rushmeier H, Silva C, Taubin G (1999) The ball-pivoting algorithm for surface reconstruction. IEEE Trans Vis Comput Graph 5(4):349–359

    Article  Google Scholar 

  2. Bogomjakov A, Gotsman C, Isenburg M (2008) Distortion-free steganography for polygonal meshes. Comput Graphics Forum 27(2):637–642

    Article  Google Scholar 

  3. Chao MW, Lin CH, Yu CW, Lee TY (2009) A high capacity 3D steganography algorithm. IEEE Trans Vis Comput Graph 15(2):274–284

    Article  Google Scholar 

  4. Cox IJ, Miller ML, Bloom JA, Fridrich J, Kalker T (2008) Digital watermarking and steganography, 2nd edn. Morgan Kaufmann, Burlington

    Google Scholar 

  5. Feng X, Zhang W, Liu Y (2014) Double watermarks of 3D mesh model based on feature segmentation and redundancy information. Multimedia Tools Appl 68(3):497–515

    Article  Google Scholar 

  6. Huang NC, Li MT, Wang CM (2009) Toward optimal embedding capacity for permutation steganography. IEEE Signal Process Lett 16(9):802–805

    Article  Google Scholar 

  7. Kaveh H, Moin M-S (2015) A high-capacity and low-distortion 3D polygonal mesh steganography using surfacelet transform. Secur Commun Netw 8(2):159–167

    Article  Google Scholar 

  8. Li MT, Huang NC, Wang CM (2011) A novel high capacity 3D steganographic algorithm. Int J Innov Comput Inf Control 7(3):1055–1074

    MathSciNet  Google Scholar 

  9. Lin CH, Chao MW, Chen JY, Yu CW, Hsu WY (2013) A high-capacity distortion-free information hiding algorithm for 3D polygon models. Int J Innov Comput Inf Control 9(3):1321–1335

    Google Scholar 

  10. Ohbuchi R, Mukaiyama A, Takahashi S (2002) A frequency-domain approach to watermarking 3D shapes. Comput Graphics Forum 21(3):373–382

    Article  Google Scholar 

  11. Rencher AC (2002) Methods of multivariate analysis, 2nd edn. Wiley, New York

    Book  MATH  Google Scholar 

  12. Tsai YY (2014) An adaptive steganographic algorithm for 3D polygonal models using vertex decimation. Multimedia Tools Appl 69(3):859–876

    Article  Google Scholar 

  13. Tu SC, Tai WK (2012) A high-capacity data-hiding approach for polygonal meshes using maximum expected level tree. Comput Graph 36(6):767–775

    Article  Google Scholar 

  14. Turk G (1990) Generating random points in triangles, Graphics gems. Academic Press, pp. 24–28

  15. Wang CM, Cheng YM (2005) An efficient information hiding algorithm for polygon models. Comput Graphics Forum 24(3):591–600

    Article  Google Scholar 

  16. Wang K, Lavoué G, Denis F, Baskurt A (2008) A comprehensive survey on three-dimensional mesh watermarking. IEEE Trans Multimedia 10(8):1513–1527

    Article  Google Scholar 

  17. Wang K, Lavoué G, Denis F, Baskurt A (2008) Hierarchical watermarking of semiregular meshes based on wavelet transform. IEEE Trans Inf Forensics Secur 3(4):620–634

    Article  Google Scholar 

  18. Wang CM, Wang PC (2006) Steganography on point-sampled geometry. Comput Graph 30(2):244–254

    Article  Google Scholar 

  19. Yang Y, Ivrissimtzis I (2014) Mesh discriminative features for 3D steganalysis. ACM Trans Multimed Comput Commun Appl 10(3):27, 1–27:13

    Article  Google Scholar 

  20. Yang Y, Pintus R, Rushmeier H, Ivrissimtzis I (2014) A steganalytic algorithm for 3D polygonal meshes, Proceedings of IEEE International Conference on Image Processing, pp. 4782–4786

  21. Zwicker M, Pauly M, Knoll O, Gross M (2002) Pointshop3D: an interactive system for point-based surface editing. Proc ACM SIGGRAPH, pp. 322–329

Download references

Acknowledgments

The authors would like to thank the anonymous reviewers for their constructive comments. This work was supported by the National Science Council of Taiwan under the grant number NSC 100-2221-E-468-023.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuan-Yu Tsai.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tsai, YY. An efficient 3D information hiding algorithm based on sampling concepts. Multimed Tools Appl 75, 7891–7907 (2016). https://doi.org/10.1007/s11042-015-2707-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-015-2707-1

Keywords

Navigation