No abstract uploaded!

In this paper, we propose a novel iterative convolution-thresholding method (ICTM) that is applicable to a range of variational models for image segmentation. A variational model usually minimizes an energy functional consisting of a fidelity term and a regularization term. In the ICTM, the interface between two different segment domains is implicitly represented by their characteristic functions. The fidelity term is usually written as a linear functional of the characteristic functions and the regularized term is approximated by a functional of characteristic functions in terms of heat kernel convolution. This allows us to design an iterative convolution-thresholding method to minimize the approximate energy. The method is simple, efficient and enjoys the energy-decaying property. Numerical experiments show that the method is easy to implement, robust and applicable to various image segmentation models.

In this paper, we develop an energy stable fully discrete discontinuous Galekin (DG) finite element method for the thin film epitaxy problem. Based on the method of lines, we construct and prove the energy stability of the spatial semi-discrete DG scheme firstly. To avoid the strict time step restriction of the explicit time integration method, the first order convex splitting method is used to get an unconditionally stable fully discrete DG method, which is a linearly implicit scheme for this nonlinear problem. The energy stability of the fully discrete convex splitting DG scheme is also proved. To improve the temporal accuracy, spectral deferred correction (SDC) method is adapted to achieve the high order accuracy in both time and space. Combining with the convex splitting method, the SDC method can be linearly solvable, high order accurate and stable in our numerical tests. These advantages ensure that the resulting fully discrete DG scheme is efficient to perform the long time simulation of the thin film epitaxy model. Numerical experiments of the accuracy and long time simulation show the capability and efficiency of the method.

No abstract uploaded!

Surface registration is widely used in machine vision and medical imaging, where 1-1 correspondences between surfaces are computed to study their variations. Surface maps are usually stored as the 3D coordinates each vertex is mapped to, which often requires lots of storage memory. This causes inconvenience in data transmission and data storage, especially when a large set of surfaces are analyzed. To tackle this problem, we propose a novel representation of surface diffeomorphisms using Beltrami coefficients, which are complex-valued functions defined on surfaces with supreme norm less than 1. Fixing any 3 points on a pair of surfaces, there is a 1-1 correspondence between the set of surface diffeomorphisms between them and the set of Beltrami coefficients on the source domain. Hence, every bijective surface map can be represented by a unique Beltrami coefficient. Conversely, given a Beltrami coefficient, we can reconstruct the unique surface map associated to it using the Beltrami Holomorphic flow (BHF) method introduced in this paper. Using this representation, 1/3 of the storage space is saved. We can further reduce the storage requirement by 90% by compressing the Beltrami coefficients using Fourier approximations. We test our algorithm on synthetic data, real human brain and hippocampal surfaces. Our results show high accuracy in the reconstructed data, while the amount of storage is greatly reduced. Our approach is compared with the Fourier compression of the coordinate functions using the same amount of data. The latter approach often shows jaggy results and cannot guarantee to preserve diffeomorphisms.