Distance regularization energy terms in level set image segment model: A survey

Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities during its evolution, which may cause numerical errors and eventually destroy the stability of the evolution. Therefore, a numerical remedy, called reinitialization, is typically applied to periodically replace the degraded level set function with a signed distance function. However, the practice of reinitialization not only raises serious problems as when and how it should be performed, but also affects numerical accuracy in an undesirable way. This paper proposes a new variational level set formulation in which the regularity of the level set function is intrinsically maintained during the level set evolution. The level set evolution is derived as the gradient flow that minimizes an energy functional with a distance regularization term and an external energy that drives the motion of the zero level set toward desired locations. The distance regularization term is defined with a potential function such that the derived level set evolution has a unique forward-and-backward (FAB) diffusion effect, which is able to maintain a desired shape of the level set function, particularly a signed distance profile near the zero level set. This yields a new type of level set evolution called distance regularized level set evolution (DRLSE). The distance regularization effect eliminates the need for reinitialization and thereby avoids its induced numerical errors. In contrast to complicated implementations of conventional level set formulations, a simpler and more efficient finite difference scheme can be used to implement the DRLSE formulation. DRLSE also allows the use of more general and efficient initialization of the level set function. In its numerical implementation, relatively large time steps can be used in the finite difference scheme to reduce the number of iterations, while ensuring sufficient numerical accuracy. To demonstrate the effectiveness of the DRLSE formulation, we apply it to an edge-based active contour model for image segmentation, and provide a simple narrowband implementation to greatly reduce computational cost.

In conventional level set methods, the slope of the level set function needs to be well controlled to maintain the numerical stability during the topology optimization process. One common solution is to regularize the level set function to be a signed distance function, which is usually achieved by periodically implementing the so called re-initialization scheme to force the level set function to gain the desired signed distance property. However, the re-initialization scheme will bring some unwanted drawbacks to the optimization process, such as zero level set drifting, time consuming etc. In addition, re-initialization is usually implemented outside the optimization loop, which will cause convergence issues. In this paper, a distance regularization functional is introduced to the structural topology optimization objective functional to ensure the signed distance property of the level set function near the structure boundaries. This functional can also keep the level set function to be constant-value at positions far away from the structural boundaries. The radial basis function (RBF) based parameterization technique together with the mathematical programming are utilized to improve the potential capability of handling multiple constraints for the topology optimization. The combination of these two techniques makes the level set based topology optimization be capable of handling complicated multi-constrained problems with higher numerical efficiency, leaving no compromise to multiple drawbacks. To demonstrate the validity of the proposed scheme, benchmark examples on minimum compliance structural optimization are employed. This type of problem is computed by the conventional level set method with the introduced distance regularization functional, the RBF based parametric level set and at last, the distance regularized RBF based parametric level set separately to demonstrate their differences.

Image segmentation and image denoising are two important and fundamental topics in the field of image processing. Geometric active contour model based on level set method can deal with the problem of image segmentation, but it does not consider the problem of image denoising. In this paper, a new diffusion equation model for noisy image segmentation is proposed by incorporating some classical diffusion equation denoising models into the segmental process. An assumption about the connection between the image intensity and level set function is given firstly. Some classical denoising models are employed to describe the evolution of level set function secondly. The final nonlinear diffusion equation model for noisy image segmentation is built thirdly. Then image segmentation and image denoising are combined in a united framework. The segmental results can be presented by level set function. Experimental results show that the new model has the advantage of noise resistance and is superior to traditional segmentation model.

In traditional image segmentation models based on single level set function, only two regions can be identified because different regions are identified by the signs of single level set function. Though several segmentation models with multiple regions have been proposed, but the largest number of regions that can be identified was limited by the number of embedded level set functions in them. Moreover, the more embedded level set functions, the higher the time cost, usually increasing linearly with the increase of embedded level set functions. In this paper, by introducing the segmentation-measure function, a new model for multi-regions image segmentation based on single level set function is proposed. At the same time, a new initialization function for the level set function is also proposed in order to reduce the time cost of the segmentation model. The experiment results show that the new Image segmentation mode with multiple regions proposed in this paper performs well and dramatically reduces the time cost compared with the popular model for multiple regions proposed by Vese and Chan.

An efficient lithographic source and mask optimization approach is developed based on localized level set methods, which is reformulated as an inverse problem by tracking the evolution of level-set functions (LSFs) embedding the level-set representation of source and mask patterns. A distance regularized level-set (DRLS) term is incorporated into the level-set formulation enabling not only stable LSF evolution and accurate computation by maintaining a signed-distance property, but also a simple and efficient narrow-band implementation. Consequently, optimization dimensionality is significantly reduced by updating the pixels in the vicinity of zero level set (narrow band) instead of all the level sets, effectively reducing computation complexity, resulting in significantly improvements in pattern fidelity convergence in terms of runtime, computation load, Euler time step and caching memory requirement which are merited by numerical simulations.

We use variational level set method and transition region extraction techniques to achieve image segmentation task. The proposed scheme is done by two steps. We first develop a novel algorithm to extract transition region based on the morphological gradient. After this, we integrate the transition region into a variational level set framework and develop a novel geometric active contour model, which include an external energy based on transition region and fractional order edge indicator function. The external energy is used to drive the zero level set toward the desired image features, such as object boundaries. Due to this external energy, the proposed model allows for more flexible initialization. The fractional order edge indicator function is incorporated into the length regularization term to diminish the influence of noise. Moreover, internal energy is added into the proposed model to penalize the deviation of the level set function from a signed distance function. The results evolution of the level set function is the gradient flow that minimizes the overall energy functional. The proposed model has been applied to both synthetic and real images with promising results.

Color image segmentation has been widely applied to diverse fields in the past decades for containing more information than gray ones. The traditional level set algorithm calculates the level set energy function based on the gray value of the gray image. A level set algorithm based on color space is proposed, which is based on weightings of different channels, and the energy function of the level set is rewritten. The k-means algorithm is used to pre-segment, initialize the level set contour curve and the sign distance function, and achieve the unsupervised segmentation of the algorithm. The steps of the algorithm are given. The adaptability and accuracy of different types of color image are solved. Compared to other popular algorithms, it has the competitive performances both on speed and accuracy. The experiments performed on real-world data sets demonstrate the validity of the proposed algorithm.

SummaryThe parametric level set approach is an extension of the conventional level set methods for topology optimization. By parameterizing the level set function, level set methods can be directly coupled with mathematical programming to achieve better numerical robustness and computational efficiency. Moreover, the parametric level set scheme can not only inherit the primary advantages of the conventional level set methods, such as clear boundary representation and the flexibility in handling topological changes, but also alleviate some undesired features from the conventional level set methods, such as the need for reinitialization. However, in the existing radial basis function–based parametric level set method, it is difficult to identify the range of the design variables. Besides, the parametric level set evolution often struggles with large fluctuations during the optimization process. Those issues cause difficulties both in numerical stability and in material property mapping. In this paper, a cardinal basis function is constructed based on the radial basis function partition of unity collocation method to parameterize the level set function. The benefit of using cardinal basis function is that the range of the design variables can now be clearly specified as the value of the level set function. A distance regularization energy functional is also introduced, aiming to maintain the desired signed distance property during the level set evolution. With this desired feature, the level set evolution is stabilized against large fluctuations. In addition, the material properties mapped from the level set function to the finite element model can be more accurate.

Segmentation of stem cells is a challenging process in image processing where level set method is used extensively. This level set criterion with re-initialisation process reduces its wider range of application. Thus re-initialisation is eradicated by a method called distance regularisation in which the signed distance property is maintained near the zero level set via forward and backward (FAB) diffusion effect. A potential function is habituated to sustain the desired shape of the level set function. The initial potential function used in distance regularisation is single-well potential technique that causes excess backward diffusion and oscillation in LSF, so it is succeeded by double-well potential. But this double well technique losses the capability to conserve the regularity at some points. This problem is eliminated by a new novel method called improved diffusion rate with triple-well potential. The proposed diffusion rate can maintain the signed distance property of the level set function (LSF) and overcome the side effect of double-well potential with reduced number of iterations.

A local level set method for unstructured meshes has been implemented by using a finite element method. A least-square weighted residual method was employed for implicit discretization to solve the level set advection equation. By contrast, a direct re-initialization method, which is directly applicable to the local level set method for unstructured meshes, was adopted to re-correct the level set function to become a signed distance function after advection. The proposed algorithm was constructed such that the advection and direct reinitialization steps were conducted only for nodes inside the narrow band around the interface. Therefore, in the advection step, the Gauss–Seidel method was used to update the level set function using a node-by-node solution method. Some benchmark problems were solved by using the present local level set method. Numerical results have shown that the proposed algorithm is accurate and efficient in terms of computational time.

Level set methods are the numerical techniques for tracking interfaces and shapes. They have been successfully used in image segmentation. A new variational level set evolving algorithm without re-initialization is presented in this paper. It consists of an internal energy term that penalizes deviations of the level set function from a signed distance function, and an external energy term that drives the motion of the zero level set toward the desired image feature. This algorithm can be easily implemented using a simple finite difference scheme. Meanwhile, not only can the initial contour can be shown anywhere in the image, but the interior contours can also be automatically detected.

Image segmentation with depth information can be modeled as a minimization problem with Nitzberg–Mumford–Shiota functional, which can be transformed into a tractable variational level set formulation. However, such formulation leads to a series of complicated high-order nonlinear partial differential equations which are difficult to solve efficiently. In this paper, we first propose an equivalently reduced variational level set formulation without using curvatures by taking level set functions as signed distance functions. Then, an alternating direction method of multipliers (ADMM) based on this simplified variational level set formulation is designed by introducing some auxiliary variables, Lagrange multipliers via using alternating optimization strategy. With the proposed ADMM method, the minimization problem for this simplified variational level set formulation is transformed into a series of sub-problems, which can be solved easily via using the Gauss–Seidel iterations, fast Fourier transform and soft thresholding formulas. The level set functions are treated as signed distance functions during computation process via implementing a simple algebraic projection method, which avoids the traditional re-initialization process for conventional variational level set methods. Extensive experiments have been conducted on both synthetic and real images, which validate the proposed approach, and show advantages of the proposed ADMM projection over algorithms based on traditional gradient descent method in terms of computational efficiency.

Distance mapping possessing computational advantage largely decides the effectiveness of level sets for image segmentation. This article presents the impact of several distance mapping and level set methods suggested in the literature and provides an effective way of handling it. Different distance metric schemes such as the Euclidean, city-block and chessboard distances have been very much prevalent in the literature. This article highlights the use of an effective, fast and efficient distance-mapping technique, i.e. distance mapping using scanning and filling technique, proposed by the authors in their earlier work. Further, this article emphasises the need of periodic reinitialisation of the level set function to a signed distance function which makes curvature term become redundant. As the curve evolves, the level set function loses its signed distance property, leading to reduction in the evolution speed. Frequent reinitialisation of the level set to signed distance function overcomes this limitation and increases the speed of evolution.

In this work we discuss variants of a PDE based level set method. Traditionally interfaces are represented by the zero level set of continuous level set functions. We instead use piecewise constant level set functions, and let interfaces be represented by discontinuities. Some of the properties of the standard level set function are preserved in the proposed method. Using the methods for interface problems, we minimize a smooth locally convex functional under a constraint. We show numerical results using the methods for image segmentation.

We propose a new multiphase level set model for image segmentation, using Mumford-Shah techniques in the piecewise-constant case. The proposed model is also a generalization of our active contour model without edges based on a two-phase segmentation. In order to handle multiple individual segments and complex topologies (such as multiple junctions), we propose a new and efficient multiphase representation by level sets: the necessary number of level set functions is considerably reduced (we need only n level set functions to represent 2/sup n/ phases or segments), and in addition we have overcome the problems of vacuum and overlap, naturally arising in multiphase problems. Finally, we show how the model can be used in image segmentation, for synthetic and real (possible noisy) pictures.