Comparison of Mesh Simplification Tools in a 3D Watermarking Framework

Given a to-be-watermarked 3D model, a transformed domain analysis is needed to guarantee a robust embedding without compromising the visual quality of the result. A multiresolution remeshing of the model allows to represent the 3D surface in a transformed domain suitable for embedding a robust and imperceptible watermark signal. Simplification of polygonal meshes is the basic step for a multiresolution remeshing of a 3D model; this step is needed to obtain the model approximation (coarse version) from which a refinement framework (i.e. 3D wavelet analysis, spectral analysis, …) able to represent the model at multiple resolution levels, can be performed. The simplification algorithm should satisfy some requirements to be used in a watermarking system: the repeatability of the simplification, and the robustness of it to noise or, more generally, to slight modifications of the full resolution mesh. The performance of a number of software packages for mesh simplification, including both commercial and academic offerings, are compared in this survey. We defined a benchmark for testing the different software in the watermarking scenario and reported a comprehensive analysis of the software performances based on the geometric distortions measurement of the simplified versions.

[1]  Paolo Cignoni,et al.  A comparison of mesh simplification algorithms , 1998, Comput. Graph..

[2]  Francesca Uccheddu,et al.  Improving on fast and automatic texture mapping of 3D dense models , 2012, 2012 18th International Conference on Virtual Systems and Multimedia.

[3]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[4]  Yary Volpe,et al.  Analysis of deformations induced by manufacturing processes of fine porcelain whiteware , 2017 .

[5]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[6]  Hugues Hoppe,et al.  New quadric metric for simplifying meshes with appearance attributes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[7]  Teodor Petrescu,et al.  An experimental evaluation of 3D mesh decimation techniques , 2011, ISSCS 2011 - International Symposium on Signals, Circuits and Systems.

[8]  Reinhard Klein,et al.  Mesh reduction with error control , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[9]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[10]  Atilla Baskurt,et al.  A Comprehensive Survey on Three-Dimensional Mesh Watermarking , 2008, IEEE Transactions on Multimedia.

[11]  Lapo Governi,et al.  A RGB-D based instant body-scanning solution for compact box installation , 2017 .

[12]  David P. Luebke,et al.  Perceptually-Driven Simplification for Interactive Rendering , 2001, Rendering Techniques.

[13]  Neil A. Dodgson,et al.  Advances in Multiresolution for Geometric Modelling , 2005 .

[14]  Mauro Barni,et al.  Wavelet-based blind watermarking of 3D models , 2004, MM&Sec '04.

[15]  Benoit M. Macq,et al.  Blind watermarking of 3D meshes using robust feature points detection , 2005, IEEE International Conference on Image Processing 2005.

[16]  Marc Alexa,et al.  Mesh simplification by stochastic sampling and topological clustering , 2009, Comput. Graph..

[17]  David P. Luebke,et al.  A Developer's Survey of Polygonal Simplification Algorithms , 2001, IEEE Computer Graphics and Applications.

[18]  Monica Carfagni,et al.  Recent strategies for 3D reconstruction using Reverse Engineering: a bird’s eye view , 2017 .

[19]  Tony DeRose,et al.  Multiresolution analysis for surfaces of arbitrary topological type , 1997, TOGS.

[20]  Touradj Ebrahimi,et al.  MESH: measuring errors between surfaces using the Hausdorff distance , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

[21]  Paul S. Heckbert,et al.  Survey of Polygonal Surface Simplification Algorithms , 1997 .

[22]  Khalid Satori,et al.  Comparative Study of Mesh Simplification Algorithms , 2016 .

[23]  Francesca Uccheddu,et al.  A greedy multiresolution method for quasi automatic texture mapping , 2011, Optical Metrology.