Blind 3D Mesh Watermarking Based on Sphere-Shape Template

  • Hak-Yeol ChoiEmail author
  • Jeongho Son
  • Han-Ul Jang
  • Heung-Kyu Lee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10082)


In this paper, we propose a novel blind 3D mesh watermarking scheme based on synchronization using a template. The proposed template has a sphere shape with a basis point and scale information for the watermarking. The template is invariant to translation, rotation, and scale. In the extraction process of the template, the post-processing, which sorts out the genuine template vertices from many candidate vertices, greatly increases the extracting accuracy. The proposed watermarking method is designed to extract the watermark from the rest of the region even if part of the mesh information is cropped. According to the experimental results, the proposed method has a higher robustness against not only cropping but also general signal processing attacks than the previous methods.


3D mesh watermarking Template base synchronization Sphere-shape template 



This work was supported by the Institute for Information & communications Technology Promotion (IITP) grant funded by the Korean government (MSIP) (No. R0126-15-1024, Managerial Technology Development and Digital Contents Security of 3D Printing based on Micro Licensing Technology).


  1. 1.
    Wang, K., Lavoue, G., Denis, F., Baskurt, A., He, X.: A benchmark for 3D mesh watermarking. In: SMI 2010 - International Conference on Shape Modeling and Applications, Proceedings, pp. 231–235 (2010)Google Scholar
  2. 2.
    Alface, P.R., Macq, B.: Blind and robust watermarking of 3D models: how to withstand the cropping attack? In: Proceedings of the IEEE International Conference on Image Processing, pp. 465–468 (2007)Google Scholar
  3. 3.
    Wang, K., Lavoue, G., Denis, F., Baskurt, A.: A comprehensive survey on three-dimensional mesh watermarking. IEEE Trans. Multimedia 10, 1513–1527 (2008)CrossRefGoogle Scholar
  4. 4.
    Valette, S., Prost, R.: Wavelet-based multiresolution analysis of irregular surface meshes. IEEE Trans. Visual Comput. Graph. 10, 113–122 (2004)CrossRefGoogle Scholar
  5. 5.
    Wu, J., Kobbelt, L.: Efficient spectral watermarking of large meshes with orthogonal basis functions. Visual Comput. 21, 848–857 (2005)CrossRefGoogle Scholar
  6. 6.
    Li, L., Zhang, D., Pan, Z., Shi, J., Zhou, K., Ye, K.: Watermarking 3D mesh by spherical parameterization. Comput. Graph. 28, 981–989 (2004)CrossRefGoogle Scholar
  7. 7.
    Konstantinides, J.M., Mademlis, A., Daras, P., Mitkas, P.A., Strintzis, M.G.: Blind robust 3-D mesh watermarking based on oblate spheroidal harmonics. IEEE Trans. Multimedia 11, 23–38 (2009)CrossRefGoogle Scholar
  8. 8.
    Ohbuchi, R., Mukaiyama, A., Takahashi, S.: A frequency-domain approach to watermarking 3D shapes. Comput. Graph. Forum 21, 373–382 (2002)CrossRefGoogle Scholar
  9. 9.
    Kim, K.T., Barni, M., Tan, H.Z.: Roughness-adaptive 3-D watermarking based on masking effect of surface roughness. IEEE Trans. Inf. Forensics Secur. 5, 721–733 (2010)CrossRefGoogle Scholar
  10. 10.
    Rolland-Neviere, X., Doerr, G., Alliez, P.: Triangle surface mesh watermarking based on a constrained optimization framework. IEEE Trans. Inf. Forensics Secur. 9, 1491–1501 (2014)CrossRefGoogle Scholar
  11. 11.
    Bors, A.G.: Watermarking mesh-based representations of 3-D objects using local moments. IEEE Trans. Image Process. 15, 687–701 (2006)CrossRefGoogle Scholar
  12. 12.
    Bors, A.G., Luo, M.: Optimized 3D watermarking for minimal surface distortion. IEEE Trans. Image Process. 22, 1822–1835 (2013)CrossRefGoogle Scholar
  13. 13.
    Hou, J.U., Kim, D.G., Choi, S.H., Lee, H.K.: 3D print-scan resilient watermarking using a histogram-based circular shift coding structure. In: Proceedings of the 3rd ACM Workshop on Information Hiding and Multimedia Security - IH&MMSec 2015, pp. 115–121 (2015)Google Scholar
  14. 14.
    Wang, K., Lavoue, G., Denis, F., Baskurt, A.: Robust and blind mesh watermarking based on volume moments. Comput. Graph. 35, 1–19 (2011)CrossRefGoogle Scholar
  15. 15.
    Luo, M., Bors, A.G.: Surface-preserving robust watermarking of 3-D shapes. IEEE Trans. Image Process. 20, 2813–2826 (2011)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Mun, S.M., Jang, H.U., Kim, D.G., Lee, H.K.: A robust 3D mesh watermarking scheme against cropping. In: International Conference on 3D Imaging (2015)Google Scholar
  17. 17.
    Cho, J.W., Prost, R., Jung, H.Y.: An oblivious watermarking for 3-D polygonal meshes using distribution of vertex norms. IEEE Trans. Sig. Process. 55, 142–155 (2007)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Liu, Y., Prabhakaran, B., Guo, X.: Spectral watermarking for parameterized surfaces. IEEE Trans. Inf. Forensics Secur. 7, 1459–1471 (2012)CrossRefGoogle Scholar
  19. 19.
    Gander, W., Golub, G.H., Strebel, R.: Least-squares fitting of circles and ellipses. BIT Numer. Math. 34, 558–578 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Zafeiriou, S., Tefas, A., Pitas, L.: Blind robust watermarking schemes for copyright protection of 3D mesh objects. IEEE Trans. Visual Comput. Graph. 11, 596–607 (2005)CrossRefGoogle Scholar
  21. 21.
    Cignoni, P., Rocchini, C., Scopigno, R.: Metro: measuring error on simplified surfaces. Comput. Graph. Forum 17, 23–38 (2009)Google Scholar
  22. 22.
    Lavoue, G., Gelasca, E.D., Dupont, F., Baskurt, A., Ebrahimi, T.: Perceptually driven 3D distance metrics with application to watermarking. In: Proceedings of the SPIE 6312, Applications of Digital Image Processing XXIX, 6312 (2006)Google Scholar
  23. 23.
    Taubin, G.: A signal processing approach to fair surface design. In: Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, pp. 351–358 (1995)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Hak-Yeol Choi
    • 1
    Email author
  • Jeongho Son
    • 1
  • Han-Ul Jang
    • 1
  • Heung-Kyu Lee
    • 1
  1. 1.School of ComputingKorea Advanced Institute of Science and TechnologyDaejeonRepublic of Korea

Personalised recommendations