Skip to content
naulon
Not checkedNot checked for notices yet.

High Order Mesh Denoising via <inline-formula> <tex-math notation="LaTeX">$\ell_{P}$ </tex-math></inline-formula>-<inline-formula> <tex-math notation="LaTeX">$\ell_{1}$ </tex-math></inline-formula> Minimization

Zheng Liu, Mingqiang Guo, Zhong Xie and 2 more

IEEE Access · 2019

doi:10.1109/access.2019.2939362 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Mesh denoising is crucial for improving the quality of meshes required by scanning devices. The main challenge is to maximally preserve geometric features while removing different kinds of noise. In this paper, we propose a novel normal filtering model that incorporates a high order <inline-formula> <tex-math notation="LaTeX">$\ell_{p}$ </tex-math></inline-formula> regularization term and an <inline-formula> <tex-math notation="LaTeX">$\ell_{1}$ </tex-math></inline-formula> fidelity term. Then, vertex positions of the mesh can be reconstructed according to the filtered face normals. Thanking to the proposed <inline-formula> <tex-math notation="LaTeX">$\ell_{p}$ </tex-math></inline-formula>-<inline-formula> <tex-math notation="LaTeX">$\ell_{1}$ </tex-math></inline-formula> normal filtering model, our method has crucial advantage in preserving geometric features and simultaneously is robust against different kinds of noise. Numerically, we develop an efficient algorithm based on iteratively reweighted <inline-formula> <tex-math notation="LaTeX">$\ell_{1}$ </tex-math></inline-formula> minimization and augmented Lagrangian method to solve the problem. We testify effectiveness of our mesh denoising method on synthetic meshes and a broad variety of scanning data produced by the laser scanner and Kinect sensors. We compare our method to state-of-the-art methods and demonstrate the superiority of our method in various cases.

Abstract licence: CC BY-NC-ND

References37

    37 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.