3D mesh watermarking using projection onto convex sets

The current paper proposes 3D mesh watermarking using projection onto convex sets. As such, a 3D mesh is iteratively projected onto two constraint convex sets until the convergence condition is satisfied. The sets consist of a robustness set and invisibility set designed to embed the watermark. The watermark can be extracted without the original mesh using the decision values and index that the watermark was embedded with. Experimental results verify that the watermarked mesh is both robust to mesh simplification, cropping, affine transformations, and vertex randomization and invisible.