Home | Gallery | CV | Visit | Publications |

We present on this page some preliminary results on the regularization of digital contours obtained in collaboration with Elie Bretin and Jacques-Olivier Lachaud. All details can be found in our paper Regularization of discrete contour by Willmore energy.

A first 3D example of regularization by the minimization of Willmore energy obtained by E. Bretin

Shapes which minimize their total squared curvature have risen a lot of interest in the mathematics community. In the 2D plane, they are known as Euler elastica, while its 3D variant is the minimization of the Willmore energy

Recently, Kerautret and Lachaud proposed to use these shapes for reconstructing a continuous analog to digital shapes. The idea is to find among all possible euclidean shapes that have the same digitization as the digital shape of interest, the one with smallest total squared curvature. In a sense, due to its smoothness and invariance properties, this euclidean shape is a very natural one with the desired digitization. By this way, they obtain a curvature estimator with many desirable properties (accuracy, stability, robustness to noise). In this context, from two given digital constraints, the problem is to identify the optimal shape solution of

We begin our paper in recalling the optimization method GMC which extracts an approximated solution based on discrete geometry tools and is valid for arbitrary digital object. Then, we describe a first new method for solving previous problem which is limited to convex shapes. In this context, the problem can be reformulated into a convex programming problem with respect to the radius of curvature through the use of the support functions :

under the additional constraints

Optimal curves obtained by the convex approach (first row) and phase field method (second row). The first and third columns present

similar results while the second illustrates the existence of critical curves obtained by the phase field method which are not global minimizer

similar results while the second illustrates the existence of critical curves obtained by the phase field method which are not global minimizer

Our second new method, the more flexible one, is based on relaxation methods obtain by -convergence results. More precisely, we look for an optimal density function which minimizes the energy

for some potential associated to the domains and . We compared numerically the closeness of the curvature fields extracted by the GMC method and the phase field method on various shapes at two different resolutions. See our page of experiments for a complete list of our tests. The error measures are summed up on graphs below. Plots of curvature fields as well as the phase field reconstruction are given. We also included the curvature field of the euclidean shape before digitization. Notice that the euclidean shape is generally not the optimal shape for minimizing Willmore energy. Nevertheless they share many features such as smoothness and number of position of extremal points. Moreover, by definition of the digital constraints those shapes are geometrically close.

Regarding the evaluation of curvature fields obtained from GMC method and the phase field method we first notice that extremal points are consistently localized with respect to the original shape. Curvature fields of both methods are numerically close for disks and ellipses and get closer as the resolution gets finer. On the other hand the curvature field obtained by the phase field approach is far away from the original shape when considering polygons. This bad behavior is related to the fact that the Willmore energy is not relevant for extracting shapes with non smooth curvature field. In this context the GMC algorithm has a more natural output because it has a pre-processing which locates linear parts of the boundary. This avoids spurious inflexion points which have been observed in phase field reconstruction.

Comparison between the GMC and the phase field curvature estimates