Multimedia Tools and Applications

, Volume 77, Issue 24, pp 32287–32309 | Cite as

3D mesh watermarking using salient points

  • Nassima MedimeghEmail author
  • Samir Belaid
  • Mohamed Atri
  • Naoufel Werghi


In this paper, we propose a robust and blind watermarking algorithm for 3D mesh models. Firstly, we extract salient feature points using a robust salient point detector based on Auto Diffusion Function (ADF). Afterwards, the mesh is segmented into different regions according to the detected salient points. Finally, we embed the watermark statistically into each region. During watermark embedding, the vertex norms ρ are decomposed into normalized bins. Then, the watermark is embedded by modifying the amplitude ρ depending on the watermark bit and the mean of each bin. In the extraction process, we extract the signature from each re-segmented region. Experiments conducted with a variety of mesh models evidenced the competitive performance of our watermarking scheme, in terms of the robustness and invisibility, when compared to other state of the art methods.


3D watermarking Salient points Mesh segmentation Statistical method 


  1. 1.
    Bors AG, Luo M (2013) Minimal surface distortion function for optimizing 3d watermarking. IEEE Trans Image Process, 1822–1835Google Scholar
  2. 2.
    Cayre F, Rondao-Alface P, Schmitt F, Macq B, Maitre H (2003) Application of spectral decomposition to compression and watermarking of 3D triangle mesh geometry. Signal Process 18:309–319Google Scholar
  3. 3.
    Chen L, Kong X, Weng B, Yao Z, Pan R (2011) A novel robust mesh watermarking based on BNBW. Advances in Signal Processing, pp 1–9Google Scholar
  4. 4.
    Cho JW, Prost R, Jung HY (2007) An oblivious watermarking for 3-D polygonal meshes using distribution of vertex norms. IEEE Trans Signal Process 55:142–155MathSciNetCrossRefGoogle Scholar
  5. 5.
    Chou CM, Tseng DC (2007) Technologies for 3D model watermarking: a survey. IJCSNS International Journal of Computer Science and Network Security 7:328–334Google Scholar
  6. 6.
    Cignoni P, Rocchini C, Scopigno R (1998) Metro: Measuring error on simplied surfaces. Comput Graphics Forum 17:167–174CrossRefGoogle Scholar
  7. 7.
    Eshraghi M, Samavati F (2007) 3D watermarking robust to accessible attacks. In: Proc ImmersComGoogle Scholar
  8. 8.
    Gal R, Cohen-or DL (2006) Salient geometric features for partial shape matching and similarity. ACM Trans Graph 25(1):130–150CrossRefGoogle Scholar
  9. 9.
    Gbal K, Bærentzen JA, Aanæs H, larsen R (2009) Shape analysis usingthe auto diffusion function. Computer Graphics Forum, pp 1405–1413Google Scholar
  10. 10.
    Harte T, Bors A (2002) Watermarking 3d models. Proc of ICIP, Rochester, NY, USA 3:661–664Google Scholar
  11. 11.
    Hoffman DD, Singh M (1997) Salience of visual parts. In: Cognition 63, 1, pp 29–78CrossRefGoogle Scholar
  12. 12.
    Hu R, Alface PR, Macq B (2009) Constrained optimisation of 3d polygonal mesh watermarking by quadratic programming. In: IEEE international conference on acoustics. speech and signal processing, pp 1501–1504Google Scholar
  13. 13.
    Jang HU, Choi HY, Son J et al (2017) Cropping-resilient 3D mesh watermarking based on consistent segmentation and mesh steganalysis. In: Multimedia tools and applications, pp 1–28. CrossRefGoogle Scholar
  14. 14.
    Jing L, Yinghui W, Wenjuan H, Ye L (2014) A new watermarking method of 3D mesh model. TELKOMNIKA Indonesian Journal of Electrical Engineering, pp 1610–1617Google Scholar
  15. 15.
    Kuo CT, Wu DC, Cheng SC (2009) 3D triangular mesh watermarking for copyright protection using Moment-Preserving. In: International conference on intelligent information hiding and multimedia signal processing, pp 136–139Google Scholar
  16. 16.
    Li H, Sun Z, He M, Ma W (2015) A mesh watermarking method based on local roughness analysis. In: 6th IEEE international conference on software engineering and service science (ICSESS)Google Scholar
  17. 17.
    Liu YJ, Xu CX, He Y Constructing Intrinsic Delaunay Triangulations from the Dual of Geodesic Voronoi Diagrams, arXiv:1505.05590[cs.CG]
  18. 18.
    Luo M, Bors AG (2009) Shape watermarking based on minimizing the quadric error metric. In: IEEE international conference on shape modeling and applications (smi)Google Scholar
  19. 19.
    Luo M, Bors AG (2011) Surface-Preserving Robust watermarking of 3-D shapes. IEEE Trans Image Process 10:20MathSciNetzbMATHGoogle Scholar
  20. 20.
    Mao X, Shiba M, Imamiya A (2001) Watermarking 3D geometric models through triangle subdivision. Proceedings of the SPIE 4314:253–260CrossRefGoogle Scholar
  21. 21.
    Medimegh N, Belaid S, Atri M, Werghi N (2017) A novel robust statistical watermarking of 3D meshes, proc. In: Ben Amor B, Chaieb F, Ghorbel F (eds) Representations, analysis and recognition of shape and motion from imaging data. RFMI 2016. Communications in Computer and Information Science, vol 684. Springer, ChamCrossRefGoogle Scholar
  22. 22.
    Medimegh N, Belaid S, Werghi N (2015) A survey of the 3D triangular mesh watermarking techniques. International Journal of Multimedia 1:1Google Scholar
  23. 23.
    Mohamed HH, Belaid S Algorithm BOSS (Bag-Of-Salient local Spectrums) for non-rigid and partial 3D object retrieval, Neurocomputing, CrossRefGoogle Scholar
  24. 24.
    Mun SM, Jang HU, Kim DG, Choi SH, Lee HK (2015) A robust 3D mesh watermarking scheme against cropping. In: International conference on 3d imaging, pp 1–6Google Scholar
  25. 25.
    Ohbuchi R, Masuda H, Aono M (1997) Watermarking Three-Dimensional polygonal models. In: Proceedings of the ACM multimedia, pp 261–272Google Scholar
  26. 26.
    Rolland-Neviere X, Doerr G, Alliez P (2014) Triangle surface mesh watermarking based on a constrained optimization framework. In: IEEE transactions on information forensics and securityGoogle Scholar
  27. 27.
    Sipiran I, Bustos B (2010) A robust 3D interest points detector based on harris operator. In: Eurographics 2010 workshop on 3d object retrieval (3DOR’10), pp 7–14Google Scholar
  28. 28.
    Vallet B, Levy B (2008) Spectral geometry processing with manifold harmonics. Computer Graphics Forum 27, Wiley Online Library:251–260CrossRefGoogle Scholar
  29. 29.
    Wang J, Feng J, Miao Y (2012) A robust confirmable watermarking algorithm for 3D mesh based on manifold harmonics analysis. Vis Comput 28:1049–1062CrossRefGoogle Scholar
  30. 30.
    Wang K, Lavoue G, Denis F, Baskurt A (2008) A comprehensive survey on Three-Dimensional mesh watermarking. IEEE Transactions on Multimedia 10CrossRefGoogle Scholar
  31. 31.
    Wang K, Lavoue G, Denis F, Baskurt A, He Xy (2010) A benchmark for 3d mesh watermarking. In: Shape modeling international conference (SMI), pp 231–235Google Scholar
  32. 32.
    Wang K, Torkhani F, Montanvert A (2012) A fast roughness-based approach to the assessment of 3d mesh visual quality. Comput Graph 36(7):808–818CrossRefGoogle Scholar
  33. 33.
    Yang Y, Ivrissimtzis I (2010) Polygonal mesh watermarking using Laplacian coordinates. Eurographics Symposium on Geometry Processing, 1585–1593Google Scholar
  34. 34.
    Zafeiriou S, Tefas A, Pitas I (2005) Blind robust watermarking schemes for copyright protection of 3D mesh objects. IEEE Trans Vis Comput Graph 11(5):596–607CrossRefGoogle Scholar
  35. 35.
    Zhan YZ, Li YT, Wang XY, Oian Y (2014) A blind watermarking algorithm for 3D mesh models based on vertex curvature. J Zhejiang Univ-Sci C (Comput Electron) 15:351–362CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Microelectronics Laboratory, Faculty of SciencesUniversity of MonastirMonastirTunisia
  2. 2.MARS Research Lab LR17ES05 Higher Institute of Computer Science and Telecom (ISITCom)University of SousseSousseTunisia
  3. 3.Department of Electrical and Computer Engineering, C2PSKhalifa UniversityAbu DhabiUAE

Personalised recommendations