A variant of the level set method and applications to image segmentation

In this paper we propose a variant of the level set formulation for identifying curves separating regions into different phases. In classical level set approaches, the sign of level set functions are utilized to identify up to phases. The novelty in our approach is to introduce a piecewise constant level set function and use each constant value to represent a unique phase. If phases should be identified, the level set function must approach predetermined constants. We just need one level set function to represent unique phases, and this gains in storage capacity. Further, the reinitializing procedure requested in classical level set methods is superfluous using our approach. The minimization functional for our approach is locally convex and differentiable and thus avoids some of the problems with the nondifferentiability of the Delta and Heaviside functions. Numerical examples are given, and we also compare our method with related approaches.

     

Using a level set approach for image segmentation under interpolation conditions

In this paper, we propose a new 2D segmentation model including geometric constraints, namely interpolation conditions, to detect objects in a given image. We propose to apply the deformable models to an explicit function using the level set approach (Osher and Sethian [24]); so, we avoid the classical problem of parameterization of both segmentation representation and interpolation conditions. Furthermore, we allow this representation to have topological changes. A problem of energy minimization on a closed subspace of a Hilbert space is defined and introducing Lagrange multipliers enables us to formulate the corresponding variational problem with interpolation conditions. Thus the explicit function evolves, while minimizing the energy and it stops evolving when the desired outlines of the object to detect are reached. The stopping term, as in the classical deformable models, is related to the gradient of the image. Numerical results are given. AMS subject classification 74G65, 46-xx, 92C55     

On a nonlocal model of image segmentation

We understand an image as binary grey ‘alloy’ of a black and a white component and use a nonlocal phase separation model to describe image segmentation. The model consists in a degenerate nonlinear parabolic equation with a nonlocal drift term additionally to the familiar Perona-Malik model. We formulate conditions for the model parameters to guarantee global existence of a unique solution that tends exponentially in time to a unique steady state. This steady state is solution of a nonlocal nonlinear elliptic boundary value problem and allows a variational characterization. Numerical examples demonstrate the properties of the model.Dedicated to Klaus Kirchgässner on the occasion of his 70th birthdayReceived: November 12, 2002; revised: April 8, 2003     

Statistical shape priors for level set segmentation

Starting in the early 1990's level set methods have become a popular mathematical framework for variational image segmentation. In many applications of segmentation, however, cost functionals which merely take into account the intensity information of the input image will not give rise to the desired segmentation results. To cope with missing or misleading image information, researchers have proposed to impose statistical shape priors into the segmentation process. Such shape priors favor the evolving embedding function to remain similar to embedding functions associated with a collection of training shapes. As a consequence, one can obtain shape-consistent segmentation despite large amounts of noise, background clutter and partial occlusion of the object of interest. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Image segmentation by level set evolution with region consistency constraint

Image segmentation is a key and fundamental problem in image processing, computer graphics, and computer vision. Level set based method for image segmentation is used widely for its topology flexibility and proper mathematical formulation. However, poor performance of existing level set models on noisy images and weak boundary limit its application in image segmentation. In this paper, we present a region consistency constraint term to measure the regional consistency on both sides of the boundary, this term defines the boundary of the image within a range, and hence increases the stability of the level set model. The term can make existing level set models significantly improve the efficiency of the algorithms on segmenting images with noise and weak boundary. Furthermore, this constraint term can make edge-based level set model overcome the defect of sensitivity to the initial contour. The experimental results show that our algorithm is efficient for image segmentation and outperform the existing state-of-art methods regarding images with noise and weak boundary.     

An adaptive level set method for shock-driven fluid-structure interaction

The fluid-structure interaction simulation of shock- and detonation-loaded structures requires numerical methods that can cope with large deformations as well as local topology changes. A robust, level-set-based shock-capturing fluid solver is described that allows coupling to any solid mechanics solver. As computational example, the elastic response of a thin steel panel, modeled with both shell and beam theory, to a shock wave in air is considered. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

基于小波域的多尺度非参数图像分割方法

主要介绍了一种基于信息熵理论及图像多尺度信息来对图像进行非参数主动轮廓模型分割的有效方法.由于小波多分辨率特性的引入,可以最大程度地利用图像多尺度信息以确保分割的准确性和完整性.又由于小波变换的特性,低频信息的使用更是进一步降低了噪声影响.文中把图像分割问题定义为在分割区域边缘长度满足一定约束条件下,图像标记场与各个尺度图像像素值之间的互信息熵最大化过程.该方法可以有效地降低噪声对于分割的影响,及确保分割的准确性和完整性.     

Generalized fast marching method: applications to image segmentation

In this paper, we propose a segmentation method based on the generalized fast marching method (GFMM) developed by Carlini et al. (submitted). The classical fast marching method (FMM) is a very efficient method for front evolution problems with normal velocity (see also Epstein and Gage, The curve shortening flow. In: Chorin, A., Majda, A. (eds.) Wave Motion: Theory, Modelling and Computation, 1997) of constant sign. The GFMM is an extension of the FMM and removes this sign constraint by authorizing time-dependent velocity with no restriction on the sign. In our modelling, the velocity is borrowed from the Chan–Vese model for segmentation (Chan and Vese, IEEE Trans Image Process 10(2):266–277, 2001). The algorithm is presented and analyzed and some numerical experiments are given, showing in particular that the constraints in the initialization stage can be weakened and that the GFMM offers a powerful and computationally efficient algorithm.     

Viable set computation for hybrid systems

In this paper, we revisit the problem of computing viability sets for hybrid systems with nonlinear continuous dynamics and competing inputs. As usual in the literature, an iterative algorithm, based on the alternating application of a continuous and a discrete operator, is employed. Different cases, depending on whether the continuous evolution and the number of discrete transitions are finite or infinite, are considered. A complete characterization of the reach-avoid computation (involved in the continuous time calculation) is provided based on dynamic programming. Moreover, for a certain class of automata, we show convergence of the iterative process by using a constructive version of Tarski’s fixed point theorem, to determine the maximal fixed point of a monotone operator on a complete lattice of closed sets. The viability algorithm is applied to a benchmark example and to the problem of voltage stability for a single machine-load system in case of a line fault.     

A level set based method for fixing overhangs in 3D printing

3D printers based on the additive manufacturing technology create objects layer-by-layer dropping fused material. As a consequence, strong overhangs cannot be printed because the new-come material does not find a suitable support over the last deposed layer. In these cases, one can add support structures (scaffolds) which make the object printable, to be removed at the end. In this paper, we propose a level set based method to create object-dependent support structures, specifically conceived to reduce both the amount of additional material and the printing time. We also review some open problems about 3D printing which can be of interests for the mathematical community.     

Shape-topology optimization for Navier–Stokes problem using variational level set method

We consider the shape-topology optimization of the Navier–Stokes problem. A new algorithm is proposed based on the variational level set method. By this algorithm, a relatively smooth evolution can be maintained without re-initialization and drastic topology change can be handled easily. Finally, the promising features of the proposed method are illustrated by two benchmark examples.     

A level set method for Laplacian eigenvalue optimization subject to geometric constraints

Computational Optimization and Applications - We consider to solve numerically the shape optimization problems of Dirichlet Laplace eigenvalues subject to volume and perimeter constraints. By...     

A fast level set model of multi‐atlas labels fusion for 3D MRI tissues segmentation with application of split Bregman method

In this paper, we propose a new fast level set model of multi‐atlas labels fusion for 3D magnetic resonance imaging (MRI) tissues segmentation. The proposed model is aimed at segmenting regions of interest in MR images, especially the tissues such as the amygdala, the caudate, the hippocampus, the pallidum, the putamen, and the thalamus. We first define a new energy functional by taking full advantage of an image data term, a length term, and a label fusion term. Different from using the region‐scalable fitting image data term and length term directly, we define a new image data term and a new length term, which is also incorporated with an edge detect function. By introducing a spatially weight function into the label fusion term, segmentation sensitivity to warped images can be largely improved. Furthermore, the special structure of the new energy functional ensures the application of the split Bregman method, which is a significant highlight and can improve segmentation efficiency of the proposed model. Because of these promotions, several good characters, such as accuracy, efficiency, and robustness have been exhibited in experimental results. Quantitative and qualitative comparisons with other methods have demonstrated the superior advantages of the proposed model.     

A novel variational model for image segmentation

In this paper, we propose a new variational model for image segmentation. Our model is inspired by the complex Ginzburg-Landau model and the semi-norm defined by us. This new model can detect both the convex and concave parts of images. Moreover, it can also detect non-closed edges as well as quadruple junctions. Compared with other methods, the initialization is completely automatic and the segmented images obtained by using our new model could keep fine structures and edges of the original images very effectively. Finally, numerical results show the effectiveness of our model.     

Color image segmentation for Bladder Cancer Diagnosis

In this paper, a new color image segmentation method is proposed to extract the region of bladder tumor from a color bladder image. In the past, the diagnosis of bladder tumors mainly relies upon cystoscopic examination with an in vivo staining technique. This manner heavily depends on the interpreter's experience and often results in errors in diagnosis. Instead of previous method, we use methylene blue in vivo staining combined with color segmentation techniques to improve the accuracy of the diagnosis of bladder tumors. The segmentation task can be decomposed into two stages. First, cluster detection combined with probabilistic relaxation is used to extract the clusters of specified colors from the HLS color space. Then, in order to refine the chromatic properties, the Bayesian algorithm is employed to reject the false region from the clusters obtained in the first stage. Experimental results show that the proposed method can segment the bladder tumor successfully. The technique could serve as an auxiliary tool for doctors or researchers in the diagnosis of bladder tumors.     

An isogeometric boundary element approach for topology optimization using the level set method

Among the various types of structural optimization, topology has been occupying a prominent place over the last decades. It is considered the most versatile because it allows structural geometry to be determined taking into account only loading and fixing constraints. This technique is extremely useful in the design phase, which requires increasingly complex computational modeling. Modern geometric modeling techniques are increasingly focused on the use of NURBS basis functions. Consequently, it seems natural that topology optimization techniques also use this basis in order to improve computational performance. In this paper, we propose a way to integrate the isogeometric boundary techniques to topology optimization through the level set function. The proposed coupling occurs by describing the normal velocity field from the level set equation as a function of the normal shape sensitivity. This process is not well behaved in general, so some regularization technique needs to be specified. Limiting to plane linear elasticity cases, the numerical investigations proposed in this study indicate that this type of coupling allows to obtain results congruent with the current literature. Moreover, the additional computational costs are small compared to classical techniques, which makes their advantage for optimization purposes evident, particularly for boundary element method practitioners.