Geometry Denoising with Preferred Normal Vectors

We introduce a new paradigm for geometry denoising using prior knowledge about the surface normal vector.

This prior knowledge comes in the form of a set of preferred normal vectors, which we refer to as label vectors.

A segmentation problem is naturally embedded in the denoising process.

The segmentation is based on the similarity of the normal vector to the elements of the set of label vectors.

Regularization is achieved by a total variation term.

We formulate a split Bregman (ADMM) approach to solve the resulting optimization problem.

The vertex update step is based on second-order shape calculus.

We present various examples including the denoising of an eroded medieval gravestone inscription.