Constraint-based point set denoising using normal voting tensor and restricted quadratic error metrics. (August 2018)

• Record Type: Journal Article
• Authors: Yadav, Sunil Kumar; Reitebuch, Ulrich; Skrodzki, Martin; Zimmermann, Eric; Polthier, Konrad
• Is Part Of: Computers & graphics. Volume 74(2018)
• Page Start: 234
• Page End: 243
• Publication Date: 2018-08
• Subjects: Point set denoising -- Normal voting tensor -- Binary eigenvalues optimization -- Quadratic error metric; Computer graphics -- Periodicals; 006.6
• DOI: 10.1016/j.cag.2018.05.014
• Languages: English
• ISSNs: 0097-8493

Abstract

Graphical abstract: Abstract: In many applications, point set surfaces are acquired by 3D scanners. During this acquisition process, noise and outliers are inevitable. For a high fidelity surface reconstruction from a noisy point set, a feature preserving point set denoising operation has to be performed to remove noise and outliers from the input point set. To suppress these undesired components while preserving features, we introduce an anisotropic point set denoising algorithm in the normal voting tensor framework. The proposed method consists of three different stages that are iteratively applied to the input: in the first stage, noisy vertex normals, are initially computed using principal component analysis, are processed using a vertex-based normal voting tensor and binary eigenvalues optimization. In the second stage, feature points are categorized into corners, edges, and surface patches using a weighted covariance matrix, which is computed based on the processed vertex normals. In the last stage, vertex positions are updated according to the processed vertex normals using restricted quadratic error metrics. For the vertex updates, we add different constraints to the quadratic error metric based on feature (edges and corners) and non-feature (planar) vertices. Finally, we show our method to be robust and comparable to state-of-the-art methods in several experiments.