- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 369472, 16 pages
Adaptive Regularized Level Set Method for Weak Boundary Object Segmentation
1College of Mathematics and Statistics, Chongqing University, Chongqing 400044, China
2School of Mathematics and Finances, Chongqing University of Arts and Sciences, Yongchuan, Chongqing 402160, China
3College of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing 400067, China
Received 24 August 2011; Revised 31 January 2012; Accepted 3 February 2012
Academic Editor: J. Jiang
Copyright © 2012 Meng Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
An adaptive regularized level set method for image segmentation is proposed. A weighted -Dirichlet integral is presented as a geometric regularization on zero level curve, which is used to diminish the influence of image noise on level set evolution while ensuring the active contours not to pass through weak object boundaries. The idea behind the new energy integral is that the amount of regularization on the zero level curve can be adjusted automatically by the variable exponent to fit the image data. This energy is then incorporated into a level set formulation with an external energy term that drives the motion of the zero level set toward the desired objects boundaries, and a level set function regularization term that is necessary for maintaining stable level set evolution. The proposed model has been applied to a wide range of both real and synthetic images with promising results.
Image segmentation is a key initial step before performing high-level tasks such as objects recognition and tracking [1, 2] in most computer vision applications. Until now, image segmentation is yet a difficult task although it has been studied extensively in past decades. Typical difficulties result from facts that most natural images include noise, low intensity contrast with weak edges, and intensity inhomogeneity. A number of segmentation techniques are developed to overcome these difficulties, in which the level set methods [3–6] have been proved to be a class of efficient techniques.
The level set method, originally introduced by Osher and Sethian , is a general framework for the computation of evolving interfaces using implicit representations. In image processing and computer vision applications, geometric active contours (GAC) [3–5], that is, active contours implemented via level set methods , were first introduced independently by Caselles et al.  and Malladi et al.  for image segmentation. Afterwards, many works constitute very interesting applications of the level set method within the active contour framework [8–10]. The basic idea is to represent an active contour as a zero level set of an implicit function in a higher dimension, called level set function, and to deform the level set function according to an evolution partial differential equation (PDE). They are appealing for the ability to handle topological changes automatically, which is generally impossible in the traditional parametric active contours . The evolution PDE for the level set function can be derived from the related evolution equation of a parameterized contour [4–6]. Alternatively, it can be directly derived from the minimization problem for an energy functional defined on the level set function [8–10, 12]. This type of methods is known as variational level set (VLS) methods. There are several desirable advantages of the VLS methods over classical image segmentation methods, such as thresholding and region grow. First, the VLS methods allow incorporation of various prior knowledge, such as shape and intensity distribution, under a principled energy minimization framework. Second, they can provide closed and continuous contours for further applications, such as image analysis and object tracking. Third, they are amenable to the introduction of constraints on level set function; smoothnesses of level set function are typical constraints. Generally, the constraints within a model can be categorized into two parts: level set function regularization and zero level curve regularization.
In conventional level set methods [3–6], the level set function may develop shocks during the evolution, which cause numerical errors and eventually destroies the stability of the level set evolution. To overcome this difficulty, level set function regularization, commonly known as reinitialization [13, 14], was introduced to restore the regularity of the level set function and maintain stable level set evolution. Although re-initialization as a numerical remedy is able to maintain the regularity of the level set function, there are serious theoretical and practical problems, as pointed out by Gomes and Faugeras . Recently, Li et al. [16, 17] proposed a variational level set formulation with an intrinsic mechanism of maintaining the signed distance property of the level set function.
A problem for GAC models is the extraction of weak boundaries in noise and/or intensity inhomogeneity images. As we know, Gaussian kernel filter is a valid denoising method which smoothes away the isolated points. For example, Zhang et al.  proposed a local image fitting (LIF) energy based on Gaussian filtering for variational level set to regularize the level set function. Wang et al.  proposed a region-based tensor level set model for image segmentation, in which a three-order tensor involving the Gaussian filter bank was introduced to comprehensively depict features of pixels. These models are robust to noise. However, the level set evolution only depending on Gaussian kernel filter cannot achieve an accurate separation between weak objects and noise in complex images since the Gaussian kernel filter often eliminates weak boundaries or details. Some regularity must be imposed on the zero level curve to diminish the influence of image noise on level set evolution.
In this paper, we focus on the issue of zero level curve regularization with variational method. Length regularization [6, 8, 9, 18] is an initially popular choice of the geometric constraint on zero level curve, in the spirit of the Mumford-Shah functional . But it is less robustness to noise. In , two smoother regularizations and were introduced. However, the smoother regularization may cause the active contours to pass through weak objects boundaries. Recently, there were many different choices of regularization in the literature, for example, p-Dirichlet integral regularization  and weighted p-Dirichlet integral regularization . Different value of results in a constrain which is somewhere between length-based and smoother regularization. However, the constant exponent cannot reflect the local property of image, thus the p-regularization do not adapt the exponent to fit the data automatically. This problem has limited their application.
This paper proposes an adaptive variational level set formulation with a weighted -Dirichlet integral, an external energy, and a level set regularization term. The weighted -Dirichlet integral integrating the gradient information is designed as a geometric regularization on zero level curve, which is used to diminish the influence of image noise on level set evolution while ensuring the active contours not to pass through weak object boundaries. To demonstrate the effectiveness of the weighted -Dirichlet integral, we apply it to an edge-based GAC model for image segmentation. So an external energy based on Laplacian of Gaussian (LoG) filter is defined, and then it drives the level set function to deform in opposite direction (up or down) on either side of edge. The level set regularization term makes level set function behave approximately like a signed distance function, which ensures stable level set evolution. The resulting evolution of the level set function is the gradient flow that minimizes the overall energy functional. Due to the image data fitting in the weighted -Dirichlet integral term, intensity information in local regions is extracted to guide the regularization of contours. Thereby our model can extract weak boundaries in noisy and/or intensity inhomogeneity images. An added benefit of the proposed model is that the level set function can be initialized to a constant function. The constant function is more easier to use in practice than the widely used signed distance function or binary step function.
The remainder of this paper is organized as follows. In Section 2, we simply review level set method and some typical regularizations on zero level set curve. The proposed model is introduced in Section 3. Numerical algorithm and experimental results are presented in Section 4. This paper is summarized in Section 5.
2.1. Level Set Method and Level Set Function Regularization
In the level set formulation, a moving curve is represented by the zero level set of a Lipschitz function defined on the entire image domain. The evolution of the curve along its normal direction with speed is described by the following evolution PDE : with the initial condition . For image segmentation, the speed function depends on both image data and the level set function .
The function in (2.1) may develop shocks during the evolution. As a result, some regularities must be imposed on in order to prevent to be too steep or too fat near the zero level curve. A common means is to initialize and periodically reinitialize the level set function to a signed distance function so as to keep steady level set evolution and ensure usable results. The reinitialization equation is where is the function to be re-initialized, and sign is the sign function. Although re-initialization as a numerical remedy is able to maintain the regularity of the level set function, it still remains a fundamental problem as when and how to apply the re-initialization [14, 15].
In , Li et al. introduced an internal energy to keep the regularity of the level set function. It is formulated in a variational framework on the level set function as follows: where is the internal energy and is a certain external energy that would drive the motion of the zero level curve of .
Let be the image domain, the internal energy term is defined as which makes the level set function behave approximately like a signed distance function, and so eliminates the re-initialization step during level set evolution. With this internal energy, level set evolution can be implemented by simple finite difference scheme and is initialized to a binary step function [8, 9, 16–18].
2.2. Some Typical Regularizations on Zero Level Curve
In order to control the smoothness of the zero level curve and further avoid the occurrence of small, isolated regions in the final segmentation, the regularization on zero level curve is very crucial in level set methods. The length regularization [6, 8, 9, 18] is to minimize the following energy functional: where is Heaviside function and is Dirac delta function. The energy functional in (2.5) computes the length of the zero level curve of in the conformal metric . The length regularization imposes a penalty on the length of the curve that smoothes the zero level curve and diminishes some false contours. But the smoothing is only along the tangent direction of each level line, so this regularization is less robustness to noise.
In ,Chung and Veseproposed a smoother regularization: This regularization means isotropic smoothing at every point , so the level lines tend to maintain smoothing and further penalize the false contours in noise image. But the smoother regularization cannot stop the active contours to pass through some weak object boundary.
In ,Zhou and Muproposed a weighted p-Dirichlet integral regularized level set evolution. The geometric regularization has the following form: Different value of results in a tradeoff between length regularization and smoother regularization. However, if the image intensities representing objects are nonuniform or if an image is highly degraded, this regularization may become sensitive to exponent .
3. Weighted -Dirichlet Integral Regularized Level Set Evolution
In this section, we propose a new variational level set formulation for image segmentation, in which a weighted -Dirichlet integral is presented to regularize the zero level curve.
Let be a image domain. For a given image and a level set function , we define an energy functional by where are constants, is the zero level curve regularization term, is a certain external energy that would drive the motion of the zero level curve of , and is the level set function regularization term that controls the smoothness of the level set function during the level set evolution.
3.1. Weighted -Dirichlet Integral
The zero level curve regularization term is defined as follows: where is gradient operator and is the convolution of the image with the Gaussian function with standard deviation . The exponent is a monotonically increasing function with and . A simple example is
The functional (3.2) is in fact a weighted -Dirichlet integral with variable exponent , thus it is called the weighted -Dirichlet integral in this paper.
Remarks. (1) If , the functional is simplified to
It is well known that the energy functional computes the length of the zero level curve of .(2)When is a constant, the functional is the weighted -Dirichlet integral. It is chosen as one of geometric regularization on zero level curve in .
However, the constant exponent is not an intelligent choice. An important reason is that the constant exponent does not reflect the local property of image, and so does not adapts the exponent to fit the image data automatically. We let depend on local intensity information. This way the regularization ensures weak regularization () in regions where the image almost has a constant intensity (i.e., where the intensity gradient almost is zero) to avoid the disappearance of weak boundaries, while it ensures strong regularization () in other regions to force the false contours to vanish in final segmentation. We will show this by a simple experiment in Section 3.4. Therefore, the variable exponent controls the tradeoff between weak regularization and strong regularization automatically.
3.2. External Energy Term
In image segmentation, an external energy depending on image information must be defined to move the zero level curve toward the objects boundaries. The weighted -Dirichlet integral in (3.2) can be used in various applications with different definitions of the external energy . In this subsection, we only provide an application of the weighted -Dirichlet integral to an active contour model using edge-based information in the external energy, as a demonstration of the effectiveness of the weighted -Dirichlet integral formulation.
Next, we define the external energy based on the Laplacian of a Gaussian (LoG) filter as follows, which drives the level set function to deform in opposite direction (up or down) on either side of edge: where is the LoG filter. The LoG filter calculates the second derivative of an image, which is often used for zero crossing edge detectors. It is well known that at the inflection point the second derivative vanishes and changes sign. The LoG response is zero in areas where the image has a constant intensity. In the vicinity of a change in intensity, the LoG response is positive on the darker side and negative on the lighter side. By incorporating the edge-based information (the LoG filter) into the external energy term, the level set function can move up or down on either side of edge and cause the sign of to flip around edges. And the objects boundaries can be extracted at image locations where two opposite directions of flow encounter. In this formulation, the level set function can be initialized to a constant function. Such initialization scheme is quite simple and computationally efficient in practice application.
3.3. The Energy Formulation
In order to keep the regularity of level set function, the energy in (2.4) is adopted in our model. This functional makes our level set formulation that has an intrinsic mechanism of maintaining the desired shape of .
In order to compute the associated Euler-Lagrange equation for the unknown function , we consider slightly regularized versions of the function and , denoted here by and , as . Let be a regularization of , and . In a dynamical scheme via steepest descent, minimizing the energy functional (3.6) with respect to , we obtain the evolution PDE: with the initial condition .
In all numerical experiments, we choose the following functions: for our evolution PDE (3.7).
3.4. Weighted -Dirichlet Integral Effect
In this subsection, we demonstrate the weighted -Dirichlet integral (3.2) effect by a simple experiment, just as shown in Figure 1. We will see that the variable exponent in effectively controls the tradeoff between the weak regularization and the strong regularization automatically. The test images are an aerial image (128 × 128) with cognitive boundaries (i.e., discontinuous boundaries) and a blood vessel image (103 × 131) with intensity inhomogeneity, as shown in Column 1. In this experiment, we take , , . The level set function is initialized to and the level set function evolves according to (3.7) with different exponents . We observe from Figures 1(b) and 1(f) (where , length regularization) that some false contours appear in final segmentation (see the interior of object in Figure 1(b) and the upper left and right corners in Figure 1(f)). We can see from Figures 1(c) and 1(g) (where , weighted -Dirichlet integral regularization) that some weak edges cannot be extracted effectively although the false contours are suppressed (see the middle of Figure 1(c) and the bottom of Figure 1(g)). With the variable exponent (weighted -Dirichlet integral regularization), the proposed model not only successfully extracted the weak boundaries, but also effectively suppressed the false contours, as shown in Figures 1(d) and 1(h).
4. Numerical Algorithm and Experimental Results
4.1. Numerical Algorithm
In this subsection, we briefly present the numerical algorithm and procedure to solve the evolution (3.7). Equation (3.7) can be implemented via a simple explicit finite difference scheme as in [16, 17] rather than a complex upwind scheme as in the traditional level set methods . We consider the 2D case with a time-dependent level set function . The spatial derivatives and in our model are approximated by the central difference, and the temporal partial derivative is discretized as the forward difference.
We recall first the usual notations: let be the time step, be the space step, and be the grid points. Let be an approximation of , with , , the central differences are Set , and start with initial level set function , we first compute according to (3.3). Then, the numerical approximation to (3.7) is given by the following discretization: where This system (4.2) is solved by an iterative method, and we use fixed space step (implies pixel spacing) for computing spatial derivatives. The choice of the time step for this finite different scheme must satisfy the condition for numerical stability, and for more details, we refer the reader to .
It is worth noting that the spatial derivatives in conventional level set formulation are discretized by upwind scheme . Due to the added the level set regularization term in our model, Central difference scheme is valid for the PDE (3.7). all the spatial derivatives in (3.7) can be discretized by central difference scheme, and the corresponding numerical scheme is stable without the need for re-initialization. Moreover, the central difference scheme is more accurate and efficient than the first-order upwind scheme that is commonly used in conventional level set formulation, as pointed out by Li et al. in .
In summary, the main steps of the algorithm (3.7) are as follows.
(1) Initialize the level set function constant, set .
(2) Compute according to (3.3).
(3) Solve the PDE in from (4.2), to obtain .
(4) Check whether the evolution has stationary. If not, and repeat.
4.2. Experimental Results
This section shows the results of the proposed model for both synthetic and real images. The level set function is simply initialized to (nonzero constant); we choose for all experiments. Besides, we use the following default parameter setting for all experiments: , , , . The parameter is not the same in different experiments; we will give the exact value of in each experiment, together with the sign of . For pixels on the borders of the image , we take a mirror reflection in all experiments.
Figure 2 shows the segmentation process of the proposed model on a synthetic image (88 × 85), a T-shaped image (127 × 96), an X-ray image of vessels (176 × 167), and a hysterosalpingography (HSG) image (130 × 96) which are plotted in Column 1 of Figure 2. All of them are typical images with intensity inhomogeneity. In these images, parts of the objects boundaries are quite weak, which make it a nontrivial task to extract the objects from the background. Since the level set function is computed from the initial condition (top to bottom: = 0.5, −0.5, 0.5, and 0.5, resp.), there are no initial contours (zero-level curve) superimposed on the original images. The contours (zero-level curve) evolution processes are shown in Column 2 to Column 5. We see from Column 2 that the contours (zero-level curve) emerge automatically in a single iteration due to the introduction of the external energy term. And then the generated contours evolve toward objects boundaries, as shown in Column 3. Afterwards the evolving curve continues to propagate and the generated false small contours gradually disappear (see Column 4). This shrinking effect can be interpreted as the regularization of the weighted -Dirichlet integral. Finally, the evolving curves convergence to the objects boundaries (see Column 5). These results show that our model, starting with a constant function, can detect weak boundary objects in intensity inhomogeneity images.
Figure 3 shows that our model starting with a constant function can work well for images with multiple weak objects and is compared with the RSF model  and LIF model . The RSF model and the LIF model represent the state of the art of variational level set methods which are able to handle intensity inhomogeneity efficiently and are less sensitive to noise. The codes of the RSF model and the LIF model are cited from http://www.engr.uconn.edu/~cmli/ and http://www4.comp.polyu.edu.hk/~cslzhang/papers.htm, respectively. Two test images, which are shown in Column 1, are a DNA channel image (229 × 168) and a bacteria image (173 × 173). These images intensities representing objects are typical nonuniform. To make fair comparison, we try our best to choose the optimal parameters and initial contours for RSF model. We can see from Column 2 and Column 3 that some unwanted contours were generated in the results of the RSF model and the LIF model. Our level set evolution starts with (top: = 0.5, bottom: = −0.5). Column 4 shows that our model successfully extracts all objects contours from background.
Figure 4 shows the robustness of our model to noise. For this purpose, we create four images by adding Gaussian noise to a synthetic dragon-like image (128 × 128) and a vascular biopsy image (94 × 123), as shown in Row 1. Then, the RSF model, the LIF model, and our model are applied to these original and noisy images. We observe that the three models are able to segment the objects in the original images (see Column 1 and Column 4). But for the noisy images, the contours of the RSF model collapse due to boundary leaks (see Row 2). Although some false contours are generated in the results of the LIF model, it still work by and large (see Row 3). We can see from Row 4 that our method successfully extracts all objects correctly in these noisy images (see Row 4).
Figure 5 shows the comparison of the proposed model with the LIF model on bimodal images. The goal is to show the accuracy of our model. Five test images, which are shown in Row 1, are a synthetic image (84 × 84), wrench image (100 × 100), hand image (108 × 130), plane image (135 × 125), and rice image (128 × 128), respectively. The true objects can be extracted from the original images by a thresholding algorithm (see Row 2). The segmentation results obtained by the LIF model and our model are shown in Rows 3 and 4. It can be observed that the LIF model and our model have achieved similar final results for the first three images by visual comparison. For the plane image, the LIF model incorrectly identifies parts of the plane projection as the objects (see Figure 5(n)). For the rice images, the rice are very close to each other, and the LIF model fails to segment them (see Figure 5(o)). With the constant function initialization ( = 0.5), our method can achieve satisfactory results for the plane and rice images (see Figures 5(s) and 5(t)). We also demonstrate the accuracy of our model by quantitative comparison. The metric adopted in this paper is the dice similarity coefficient (DSC)  as follows: where indicates the number of pixels in the enclosed set, and and represent a given baseline foreground region (e.g., true object) and the foreground region found by the model, respectively. The closer the DSC value to 1, the better the segmentation. Table 1 shows the DSC values of the LIF model and our model. It can be clear that our model achieves more accurate results.
Figure 6 shows the segmentation results of our model for five real images with intensity inhomogeneity. Five medical images in different scenario are chosen to serve as the test images, which are two X-ray vessel images (111 × 110, 132 × 131), a bladder MR image (180 × 107), a brain MR images (120 × 160), and a wrist image (90 × 196), as shown in Row 1. Our level set evolution starts with (left to right: = 0.5, 0.5, −0.5, 0.5 and 0.5, resp.). As can be seen in the second row of Figure 6, our model successfully extracted all objects contours from nonuniform background. This experiment also demonstrates that our model can handle more general images with intensity inhomogeneity.
Figure 7 shows that our model can extract weak objects boundaries from images with complex background (250 × 180). In actual sky-mountain-water conflicts, the background of these real infrared images was quite complex (see Row 1). Moreover, parts of objects (boat, sun) are quite weak. Our level set evolution starts with = 0.5. As can be seen in the second row of Figure 7, our model successfully extracts the desired objects from the complex background.
Figure 8 shows that our model can handle real noisy image with different types of shapes. Five test images, which are shown in Row 1, are two breast cyst images (91 × 92, 157 × 110), an MR image of a human brain (159 × 122), a skin lesion image (180 × 180), and a ultrasonic image (100 × 100). These images are contaminated by texture tissue and clutter noise, thus it is very difficult to segment the objects in such images. Our level set evolution starts with (left to right: = 0.5, 0.5, 0.5, −0.5 and −0.5, resp.). As can be seen in Row 2, our model successfully extracted the desired objects from the noisy images.
We have proposed a novel variational level set formulation for image segmentation based on weighted -Dirichlet integral and LoG filter. By incorporating local intensity information into the weighted -Dirichlet integral, this regularization term preserves the good properties of both length regularization and -Dirichlet integral regularization, as well as a combination of the two. The external energy based on the LoG filter drives the level set function up or down on either side of edge and locates objects edges. Due to the good properties of the weighted -Dirichlet integral term, our model can extract weak edge in noise and/or intensity inhomogeneity images. The proposed model also allows the use of more general initialization of the level set function, that is, constant function. This implies that our model is free of manual initialization. Given its efficiency and accuracy, we expect that the proposed model will be useful for real-time applications. In our future work, we will extend the current model to motion tracking, where motion information can be included in the segmentation process.
The authors are very grateful to the anonymous reviewers for their careful reading and useful suggestions, which greatly improved the presentation of the paper. This work is supported by the Fundamental Research Funds for the Central Universities (CDJXS10100005) and Natural Science Foundation Project of CQ CSTC (cstcjjA40012) and CQ CSTC (cstc2011jjA40029).
- N. A. Goussies, M. E. Mejail, J. Jacobo, and G. Stenborg, “Detection and tracking of coronal mass ejections based on supervised segmentation and level set,” Pattern Recognition Letters, vol. 31, no. 6, pp. 496–501, 2010.
- M. Roh, T. Kim, J. Park, and S. Lee, “Accurate object contour tracking based on boundary edge selection,” Pattern Recognition, vol. 40, no. 3, pp. 931–943, 2007.
- V. Caselles, F. Catte, T. Coll, and F. Dibos, “A geometric model for active contours in image processing,” Numerische Mathematik, vol. 66, no. 1, pp. 1–31, 1993.
- R. Malladi, J. A. Sethian, and B. C. Vemuri, “Shape modeling with front propagation: a level set approach,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 2, pp. 158–175, 1995.
- V. Caselles, R. Kimmel, and G. Sapiro, “Geodesic active contours,” International Journal of Computer Vision, vol. 22, no. 1, pp. 61–79, 1997.
- T. F. Chan and L. A. Vese, “Active contours without edges,” IEEE Transactions on Image Processing, vol. 10, no. 2, pp. 266–277, 2001.
- S. Osher and J. A. Sethian, “Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations,” Journal of Computational Physics, vol. 79, no. 1, pp. 12–49, 1988.
- C. Li, C. Kao, J. C. Gore, and Z. Ding, “Minimization of region-scalable fitting energy for image segmentation,” IEEE Transactions on Image Processing, vol. 17, no. 10, pp. 1940–1949, 2008.
- L. Wang, C. Li, Q. Sun, D. Xia, and C. Y. Kao, “Active contours driven by local and global intensity fitting energy with application to brain MR image segmentation,” Computerized Medical Imaging and Graphics, vol. 33, pp. 520–531, 2009.
- M. Li, C. He, and Y. Zhan, “Tensor diffusion level set method for infrared targets contours extraction,” Infrared Physics and Technology, vol. 55, no. 1, pp. 19–25, 2012.
- M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: active contour models,” International Journal of Computer Vision, vol. 1, no. 4, pp. 321–331, 1987.
- Q. Xin, C. Mu, and M. Li, “The Lee-Seo model with regularization term for bimodal image segmentation,” Mathematics and Computers in Simulation, vol. 81, no. 12, pp. 2608–2616, 2011.
- M. Sussman, P. Smereka, and S. Osher, “A level set approach for computing solutions to incompressible two-phase flow,” Journal of Computational Physics, vol. 114, no. 1, pp. 146–159, 1994.
- S. Osher and R. Fedkiw, Level Set Methods and Dynamic Implicit Surfaces, Springer, New York, NY, USA, 2002.
- J. Gomes and O. Faugeras, “Reconciling distance functions and level sets,” Journal of Visual Communication and Image Representation, vol. 11, no. 2, pp. 209–223, 2000.
- C. Li, C. Xu, C. Gui, and M. D. Fox, “Level set evolution without re-initialization: a new variational formulation,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '05), pp. 430–436, San Diego, Calif, USA, June 2005.
- C. Li, C. Xu, C. Gui, and M. D. Fox, “Distance regularized level set evolution and its application to image segmentation,” IEEE Transactions on Image Processing, vol. 19, no. 12, Article ID 5557813, pp. 3243–3254, 2010.
- K. Zhang, H. Song, and L. Zhang, “Active contours driven by local image fitting energy,” Pattern Recognition, vol. 43, no. 4, pp. 1199–1206, 2010.
- B. Wang, X. Gao, D. Tao, and X. Li, “A unified tensor level set for image segmentation,” IEEE Transactions on Systems, Man, and Cybernetics—Part B, vol. 40, no. 3, pp. 857–867, 2010.
- D. Mumford and J. Shah, “Optimal approximations by piecewise smooth functions and associated variational problems,” Communications on Pure and Applied Mathematics, vol. 42, no. 5, pp. 577–685, 1989.
- G. Chung and L. A. Vese, “Image segmentation using a multilayer level-set approach,” Computing and Visualization in Science, vol. 12, no. 6, pp. 267–285, 2009.
- M. Droske and W. Ring, “A Mumford-shah level-set approach for geometric image registration,” SIAM Journal on Applied Mathematics, vol. 66, no. 6, pp. 2127–2148, 2006.
- B. Zhou and C. Mu, “Level set evolution for boundary extraction based on a p-Laplace equation,” Applied Mathematical Modelling, vol. 34, no. 12, pp. 3910–3916, 2010.
- D. W. Shattuck, S. R. Sandor-Leahy, K. A. Schaper, D. A. Rottenberg, and R. M. Leahy, “Magnetic resonance image tissue classification using a partial volume model,” Neuroimage, vol. 13, no. 5, pp. 856–876, 2001.