Image segmentation is an important task in the domain of computer vision and medical imaging. In natural and medical images, intensity inhomogeneity, i.e. the varying image intensity, occurs often and it poses considerable challenges for image segmentation. In this paper, we propose an efficient variational method for segmenting images with intensity inhomogeneity. The method is inspired by previous works on two-stage segmentation and variational Retinex. Our method consists of two stages. In the first stage, we decouple the image into reflection and illumination parts by solving a convex energy minimization model with either total variation or tight-frame regularisation. In the second stage, we segment the original image by thresholding on the reflection part, and the inhomogeneous intensity is estimated by the smoothly varying illumination part. We adopt a primal dual algorithm to solve the convex model in the first stage, and the convergence is guaranteed. Numerical experiments clearly show that our method is robust and efficient to segment both natural and medical images.

he incompressibility constraint makes Navier-Stokes equations difficult. A reformulation to a better posed problem is needed before solving it numerically. The sequential regularization method (SRM) is a reformulation which combines the penalty method with a stabilization method in the context of constrained dynamical systems and has the benefit of both methods. In the paper, we study the existence and uniqueness for the solution of the SRM and provide a simple proof of the convergence of the solution of the SRM to the solution of the Navier-Stokes equations. We also give error estimates for the time discretized SRM formulation.

We propose a class of simple and efficient numerical scheme for incompressible fluid equations with coordinate symmetry. By introducing a generalized vorticity-stream formulation, the divergence free constraints are automatically satisfied. In addition, with explicit treatment of the nonlinear terms and local vorticity boundary condition, the Navier–Stokes (MHD, respectively) equation essentially decouples into 2 (4, respectively) scalar equation and thus the scheme is very efficient. Moreover, with proper discretization of the nonlinear terms, the scheme preserves both energy and helicity identities numerically. This is achieved by recasting the nonlinear terms (convection, vorticity stretching, geometric source, Lorentz force and electro-motive force) in terms of Jacobians. This conservative property is valid even in the presence of the pole singularity for axisymmetric flows. The exact conservation of energy and helicity has effectively eliminated excessive numerical viscosity. Numerical examples have demonstrated both accuracy and efficiency of the scheme. Finally, local mesh refinement near the boundary can also be easily incorporated into the scheme without extra cost.

Solutions for many problems of interest exhibit singular behaviors at domain corners or points where boundary condition changes type. For this type of problems, direct spectral methods with usual polynomial basis functions do not lead to a satisfactory convergence rate. We develop in this paper a M\"untz-Galerkin method which is based on specially tuned M\"untz polynomials to deal with the singular behaviors of the underlying problems. By exploring the relations between Jacobi polynomials and M\"untz polynomials, we develop efficient implementation procedures for the M\"untz-Galerkin method, and provide optimal error estimates. As examples of applications, we consider the Poisson equation with mixed Dirichlet-Neumann boundary conditions, whose solution behaves like $O(r^{1/2})$ near the singular point, and demonstrate that the M\"untz-Galerkin method greatly improves the rates of convergence of the usual spectral method.

In this paper, we develop and analyze an arbitrary Lagrangian-Eulerian discontinuous Galerkin (ALE-DG) method with a time-dependent approximation space for one dimensional conservation laws, which satisfies the geometric conservation law. For the semi-discrete ALE-DG method, when applied to nonlinear scalar conservation laws, a cell entropy inequality, L2 stability and error estimates are proven. More precisely, we prove the sub-optimal (k+1/2) convergence for monotone fluxes, and optimal (k+1) convergence for an upwind flux, when a piecewise P^k polynomial approximation space is used. For the fully-discrete ALE-DG method, the geometric conservation law and the local maximum principle are proven. Moreover, we state conditions for slope limiters, which ensure total variation stability of the method. Numerical examples show the capability of the method.