A Robust Blind 3-D Mesh Watermarking Technique Based on SCS Quantization and Mesh Saliency for Copyright Protection
Affiliation auteurs | !!!! Error affiliation !!!! |
Titre | A Robust Blind 3-D Mesh Watermarking Technique Based on SCS Quantization and Mesh Saliency for Copyright Protection |
Type de publication | Conference Paper |
Year of Publication | 2019 |
Auteurs | Hamidi M, Chetouani A, Haziti MEl, Hassouni MEl, Cherifi H |
Editor | Renault E, Boumerdassi S, Leghris C, Bouzefrane S |
Conference Name | MOBILE, SECURE, AND PROGRAMMABLE NETWORKING |
Publisher | Univ Paris Saclay, Inst Mines Telecom, Wireless Networks & Multimedia Serv, Dept Telecom SudParis; Conservatoire Natl Arts Metiers |
Conference Location | GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND |
ISBN Number | 978-3-030-22885-9; 978-3-030-22884-2 |
Mots-clés | 3-D mesh watermarking, copyright protection, mesh saliency, Scalar Costa scheme (scs) |
Résumé | Due to the recent demand of 3-D meshes in a wide range of applications such as video games, medical imaging, film special effect making, computer-aided design (CAD), among others, the necessity of implementing 3-D mesh watermarking schemes aiming to protect copyright has increased in the last decade. Nowadays, the majority of robust 3-D watermarking approaches have mainly focused on the robustness against attacks while the imperceptibility of these techniques is still a serious challenge. In this context, a blind robust 3-D mesh watermarking method based on mesh saliency and scalar Costa scheme (SCS) for Copyright protection is proposed. The watermark is embedded by quantifying the vertex norms of the 3-D mesh by SCS scheme using the vertex normal norms as synchronizing primitives. The choice of these vertices is based on 3-D mesh saliency to achieve watermark robustness while ensuring high imperceptibility. The experimental results show that in comparison with the alternative methods, the proposed work can achieve a high imperceptibility performance while ensuring a good robustness against several common attacks including similarity transformations, noise addition, quantization, smoothing, elements reordering, etc. |
DOI | 10.1007/978-3-030-22885-9_19 |