Tetrahedral mesh improvement using moving mesh smoothing, lazy searching flips, and RBF surface reconstruction

Given a tetrahedral mesh and objective functionals measuring the mesh quality which take into account the shape, size, and orientation of the mesh elements, our aim is to improve the mesh quality as much as possible. In this paper, we combine the moving mesh smoothing, based on the integration of an ordinary differential equation coming from a given functional, with the lazy flip technique, a reversible edge removal algorithm to modify the mesh connectivity. Moreover, we utilize radial basis function (RBF) surface reconstruction to improve tetrahedral meshes with curved boundary surfaces. Numerical tests show that the combination of these techniques into a mesh improvement framework achieves results which are comparable and even better than the previously reported ones.Comment: Revised and improved versio

Geodesic boundary value problems with symmetry

This paper shows how left and right actions of Lie groups on a manifold may be used to complement one another in a variational reformulation of optimal control problems equivalently as geodesic boundary value problems with symmetry. We prove an equivalence theorem to this effect and illustrate it with several examples. In finite-dimensions, we discuss geodesic flows on the Lie groups SO(3) and SE(3) under the left and right actions of their respective Lie algebras. In an infinite-dimensional example, we discuss optimal large-deformation matching of one closed curve to another embedded in the same plane. In the curve-matching example, the manifold \Emb(S^1, \mathbb{R}^2) comprises the space of closed curves $S^1$ embedded in the plane $\mathbb{R}^2$. The diffeomorphic left action \Diff(\mathbb{R}^2) deforms the curve by a smooth invertible time-dependent transformation of the coordinate system in which it is embedded, while leaving the parameterisation of the curve invariant. The diffeomorphic right action \Diff(S^1) corresponds to a smooth invertible reparameterisation of the $S^1$ domain coordinates of the curve. As we show, this right action unlocks an important degree of freedom for geodesically matching the curve shapes using an equivalent fixed boundary value problem, without being constrained to match corresponding points along the template and target curves at the endpoint in time.Comment: First version -- comments welcome

Locally adaptive image denoising by a statistical multiresolution criterion

We demonstrate how one can choose the smoothing parameter in image denoising by a statistical multiresolution criterion, both globally and locally. Using inhomogeneous diffusion and total variation regularization as examples for localized regularization schemes, we present an efficient method for locally adaptive image denoising. As expected, the smoothing parameter serves as an edge detector in this framework. Numerical examples illustrate the usefulness of our approach. We also present an application in confocal microscopy

A Bayesian Approach to Manifold Topology Reconstruction

In this paper, we investigate the problem of statistical reconstruction of piecewise linear manifold topology. Given a noisy, probably undersampled point cloud from a one- or two-manifold, the algorithm reconstructs an approximated most likely mesh in a Bayesian sense from which the sample might have been taken. We incorporate statistical priors on the object geometry to improve the reconstruction quality if additional knowledge about the class of original shapes is available. The priors can be formulated analytically or learned from example geometry with known manifold tessellation. The statistical objective function is approximated by a linear programming / integer programming problem, for which a globally optimal solution is found. We apply the algorithm to a set of 2D and 3D reconstruction examples, demon-strating that a statistics-based manifold reconstruction is feasible, and still yields plausible results in situations where sampling conditions are violated