Mesh Denoising based on Normal Voting Tensor and Binary Optimization

Abstract

This paper presents a tensor multiplication based smoothing algorithm that follows a two step denoising method. Unlike other traditional averaging approaches, our approach uses an element based normal voting tensor to compute smooth surfaces. By introducing a binary optimization on the proposed tensor together with a local binary neighborhood concept, our algorithm better retains sharp features and produces smoother umbilical regions than previous approaches. On top of that, we provide a stochastic analysis on the different kinds of noise based on the average edge length. The quantitative and visual results demonstrate the performance our method is better compared to state of the art smoothing approaches.

13 pages

References in corpus (1)

• A General Framework for Bilateral and Mean Shift Filtering

Cited by in corpus (7)

• DNF-Net: a Deep Normal Filtering Network for Mesh Denoising
• HLO: Half-kernel Laplacian Operator for Surface Smoothing
• Variational Graph Methods for Efficient Point Cloud Sparsification
• Mesh Denoising and Inpainting using the Total Variation of the Normal and a Shape Newton Approach
• Surface Denoising based on Normal Filtering in a Robust Statistics Framework
• Anisotropic Mesh Filtering by Homogeneous MLS Fitting
• Mesh Total Generalized Variation for Denoising