Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Search articles, authors, keywords, DOl and etc.
Mesh denoising algorithms explore recovering smooth surfaces from 3D meshes that are corrupted with noise. They aim to remove noise while maintaining geometric features. Although existing mesh denoising methods have shown promising results, they typically involve many parameters and settings that can be complex to non-experts. Also, parameter tuning is usually manual and realized through trial and error. To address this, we propose a new fairer benchmark for mesh denoising algorithms. This benchmark consolidates existing algorithms into a single platform, organizes various noisy mesh data, and provides optimal parameter settings for different algorithms. Specifically, we propose a more effective and scientific method for setting parameters by utilizing Bayesian optimization to find optimal parameters. We use the upper confidence bound strategy to balance exploration and exploitation needs. We conduct extensive experiments to compare existing mesh denoising algorithms quantitatively and qualitatively. These experiments show that there does not exist a single method that is optimal for all shapes and noise types. Additionally, we provide all the optimal parameter settings of the state-of-the-art methods that are available to the community.

This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.
The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
To submit a manuscript, please go to https://jcvm.org.
Comments on this article