Abstract
This paper presents a 3D watermarking model based on the nearest distance between two vertices in mesh, where the embedding path moves as deep as possible until the embedding data is completed. The proposed algorithm achieved good results according to invisibility and robustness. The visibility was measured in termof Root Mean Square Error (RMSE) and Hausdroff Distance (HD), which obtained good results. As related to robustness, the proposed method showed resistance to geometrical attack (translation, scaling and rotation) as well as acceptable resistance to signal processing attacks like noise addition and simplification.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have