Efficient and Enhanced Diffusion of Vector Field for Active Contour Model

Liu, Guoqi; Sun, Lin; Liu, Shangwang

doi:https://doi.org/10.1155/2015/343159

Mathematical Problems in Engineering

On this page

Abstract Introduction Experimental Results Conclusion Acknowledgments References Copyright Related Articles

Special Issue

Advanced Techniques for Computational and Information Sciences

View this Special Issue

Research Article | Open Access

Volume 2015 | Article ID 343159 | https://doi.org/10.1155/2015/343159

Efficient and Enhanced Diffusion of Vector Field for Active Contour Model

Guoqi Liu,^1,2,3Lin Sun,^1,2,3and Shangwang Liu^1,2,3

Academic Editor: Chih-Cheng Hung

Received21 Mar 2015

Revised21 Jun 2015

Accepted25 Jun 2015

Published07 Oct 2015

Abstract

Gradient vector flow (GVF) is an important external force field for active contour models. Various vector fields based on GVF have been proposed. However, these vector fields are obtained with many iterations and have difficulty in capturing the whole image area. On the other hand, the ability to converge to deep and complex concavity with these vector fields is also needed to improve. In this paper, by analyzing the diffusion equation of GVF, a normalized set is defined and a dynamically normalized constraint of vector fields is used for efficient diffusion, which makes the edge vector diffusing rapidly to the entire image region. In order to improve the ability to converge to concavity, an enhanced diffusion term is integrated into the original energy functional. With the dynamically normalized constraint and enhanced diffusion term, new vector fields of EDGVF (efficient and enhanced diffusion for GVF) and EDNGVF (efficient and enhanced diffusion of NGVF) are obtained. Experimental results demonstrate that vector fields with proposed method capture the entire image and are obtained with less iterations and computational times. In particular, EDNGVF greatly improves the ability to converge to concavity.

1. Introduction

Active contour model (ACM) is one of the most important methods for boundary extraction. It was firstly presented by Kass et al. [1]. There are two foundational types in active contour model, that is, parametric [1, 2] and geometric active contour models [3]. The former represents curves or surfaces explicitly in their parametric forms, while implicit approaches based on level set [4, 5] are adopted in geometric active contour. Compared with the parametric active contour, geometric active contour has advantages in dealing with complex image content. However, geometric active contour always brings much computational cost since curves in geometric active contour are implicitly represented as a level set of higher dimensional functions. In parametric active contour, curve deforms with the help of internal and external forces. Internal force, which is defined by the curve itself, is used to smooth the curve. External force computing from image data pushes the curves toward target boundary. Thus, external force plays a dominating role in converging to target boundary. In this paper, we focus on the external force fields in parametric active contour model.

In parametric active contour, a curve is represented as . The curve is deformed to the object boundary by minimizing the following energy functional:where and are the first and second derivatives of with respect to arc length parameter ; the parameters and are the weight constants. External energy is derived from an image, which is usually computed as follows:where is a two-dimensional Gaussian function with standard deviation ; . is the gray intensity of an image. If an image is binary and the background of the image is zero-valued, external energy is calculated as follows:Minimizing the energy functional of (1) with calculus of variations [6], the Euler equation is obtained:The first two terms are considered as the internal force, and is viewed as the external force imposing on the deforming curve. Most of methods are concerned with the external force fields in parametric active contour models, such as gradient vector flow (GVF) vector field [7] and its improvements [8–15].

In this paper, based on the analysis of GVF, a dynamical constraint for the magnitude of vectors is performed by defining a special set. The unit difference of vector magnitude between the nonzero vectors and zero vectors makes the vectors rapidly diffuse to entire image region. On the other hand, by incorporating an enhanced diffusion term, the “equilibrium problems” [16–19] are greatly decreased.

2. Problem Analysis

GVF has a relative large capture range and can extract some U-shaped concavities compared with original vector field. However, GVF always fails to diffuse to entire image [15] and has difficulty in extracting deep concavity. Various methods modify the energy function of GVF to obtain new vector fields, such as GVF in the normal direction (NGVF). Unfortunately, these vector fields based on diffusion equation always need too many iterations (usually cost more than iterations) and have difficulty in enlarging to entire image. For example, we take GVF. In GVF, vector field is calculated by minimizing the following energy functional:where is the edge mapping which is computed as . When is small, the energy is dominated by sum of the squares of the partial derivatives of vector field , yielding a slowly varying field. When is large, the second term dominates the integrand, and minimization is carried out by setting . is a regularization parameter governing the tradeoff between the first term and the second term. Using the calculus of variations, GVF is obtained by solving the following Euler equation:

In homogeneous region (), the Laplacian operator () makes the vectors smoothly diffuse to image region. The linear diffusion process [20] of vector field in homogeneous region is represented as follows:The solution is given as follows:where is the Gaussian function with the standard deviation . According to (8), vectors near object boundaries have strong magnitudes, while the magnitudes of vectors gradually decrease to zero when moving away from the boundaries. The diffusion becomes weak with the increase of the number of iterations; it is difficult to capture entire image. An example for the capture ranges of GVF is shown on the left hand of Figure 1; it cannot capture entire image even with iterations. Thus, the efficiency of generating vector field is to be improved. In order to show the efficiency of generating GVF, the capture ranges with the different iterations are shown on the left hand of Figure 2. The capture range of GVF with 40 iterations does not have obvious difference compared with the effect by 20 iterations. Furthermore, there are not enough strong forces which push contour to the concavity; even the critical points which stop the contour convergence to the concavity appear near the concavity, as shown in the first row of Figure 3.

(a)

(b)

(c)

3. Proposed Method

Based on the above section, the diffusion operator makes the vectors smoothly diffused, which stops the vectors diffusion to entire image region. In order to avoid the excessive smoothing, a dynamic constraint normalizing the set of vectors is added in the diffusion equation. On the other hand, in order to decrease the critical points of vector field, a new energy functional term is integrated in the diffusion equation.

3.1. Dynamically Normalized Constraint for Efficient Diffusion

A vector in the normalized function set is defined as follows:Then, a new vector field is obtained by adding a dynamically normalized constraint in GVF:Because of the defined , the unit difference between nonzero vectors and zero vectors makes the gradient vector of edge map fast diffuse to homogeneous region. From the above equation, the defined set is nonsmooth (the magnitude of vectors in is or ), while the Laplacian operator in GVF has excessive smoothing effect. Therefore, Laplacian operator makes the vector field diffuse to other regions until the vector field enlarges the entire image region (the magnitude of every vector in vector field becomes to ). As shown in Figure 2, the capture ranges of GVF and the above proposed vector field with and iterations, respectively, are compared. On the left hand of Figure 2, the capture range of GVF is limited and is not obviously changing from to iterations, while the capture range of vector field with proposed method enlarges nearly entire image (except the corners of the image) with only iterations, as shown on the right hand of Figure 2.

Proposed dynamically normalized constraint method has generality for diffusion equation. Similarly, it can be applied to NGVF. NGVF is obtained based on anisotropic diffusion of , which is computed by the following equation:where is a constant and . and are obtained as follows:Then, a new vector field by adding the dynamically normalized constraint in NGVF is obtained by iterating the following equation:where is the diffusion term; it has a similar effect of the Laplacian operator in GVF.

Unlike the damping diffusion of GVF or NGVF, because of the defined set , edge gradient vectors keep nearly the same velocity diffusion to other regions until the magnitude of all the vectors becomes (i.e., vector field captures entire image region). Meanwhile, the force field generated by concavity can generate enough force to push contour convergence to the concavity, and the ability to converge to boundary concavity is greatly enhanced.

3.2. The Energy Functional Term for Enhanced Diffusion

In order to decrease the critical points of vector field, the diffusion of vectors in homogeneous region should be enhanced. The enhanced diffusion term is defined as follows:The minimization of means the maximization of ; that is, this term makes the magnitude of diffused vector large. This property of enhanced diffusion term can decrease the critical points since the magnitude of critical point is always zero-valued.

Based on the dynamically normalized constraint and enhanced diffusion terms, the energy functional of enhanced diffusion GVF is given:

Minimizing the above energy functional, a new vector field, called EDGVF (efficient and enhanced diffusion for GVF), is obtained by solving the following equation:

According to the above energy functional of equation, the effect of enhanced diffusion is analyzed as follows: the energy of makes the vector diffusion smooth, and the vectors gradually decrease to and the critical points may appear. Meanwhile, the minimization of makes the magnitude of diffused vector large. This property of enhanced diffusion term could decrease the critical points since the magnitude of critical point is always zero-valued.

It has better effect in dealing with concavity when the enhanced diffusion term is integrated with anisotropic diffusion equations. For example, we take NGVF. In fact, Laplacian operator in the normal direction is got by minimizing energy functional [21, 22]. The energy functional is defined as follows:Similar to , is the infinity norm. Then, the enhanced diffusion term and dynamically normalized constraint are integrated with NGVF. Thus, the energy functional of enhanced diffusion for NGVF is defined as follows:Different from NGVF, is not a constant; ; is a constant. Near the boundaries, the anisotropic parameter approaches ; the boundaries are not distorted by diffusion effect.

With calculus of variation, EDNGVF (efficient and enhanced diffusion for NGVF) is calculated as follows:In homogeneous region, approaches and the diffusion of vector field is enhanced. This property improves the ability to extract complex concavity compared with NGVF. The minimization of makes the magnitude of vector nonzero, which enhances the diffusion of vector; meanwhile, the critical points in vector field are greatly decreased. As shown in Figure 3, the vector fields of GVF, NGVF, and EDNGVF at concavity are compared. The critical points appear in GVF and NGVF, which are shown in the first and second rows of Figure 3. Since the enhanced diffusion term improves the diffusion ability of vectors, the vectors generated by the deep concavity could diffuse enough, and the critical points disappear in EDNGVF, as shown in the final row of Figure 3. This property of EDNGVF makes the contour converge to the concavity.

4. Experimental Results

In this section, the performances with several methods and proposed method are compared. The edge map used in snakes is normalized to the range ; and are set for all experiments. For each tested image, the same initialization is employed for all tested methods. The parameter for proposed method is set to in all the experiments unless otherwise stated. The vector field with proposed method can capture entire image region, and the efficiency of generating vector field is improved. Otherwise, the proposed EDNGVF improves the performances in extracting the concavity, which is verified in this section.

4.1. Capture Range and Efficiency of Generating Vector Fields

In GVF force field, isotropic diffusion of GVF keeps the field diffusing smoothly. The anisotropic diffusion in NGVF has better effect in extracting concavity than isotropic diffusion in GVF. However, the diffusion of GVF and NGVF becomes weak as the number of iteration increases. Thus, GVF and NGVF have difficulty in capturing entire image region. As shown in the left column of Figure 4, GVF and NGVF cannot capture entire image region, while the vector fields with proposed method capture the whole image region, which are shown in the right column of Figure 4.

In addition, the proposed method speeds up the diffusion of vector fields; vector fields with proposed methods can be obtained with less iterations and times compared with GVF and NGVF. In order to test the generation efficiencies of force fields, the minimum numbers of iterations and costing times for enlarging the force fields to the same image region are compared. The images in Figures 5 and 6 are tested. As shown in Table 1, EDGVF and EDNGVF need from to iterations in test images. Meanwhile, GVF and NGVF cost more than iterations in each tested image. For example, we take the image in the third row of Figure 5. GVF iterates , while EDNGVF only needs iterations. As shown in Table 1, the proposed vector field is generated with the least iterations. Furthermore, vector fields with proposed method cost the least times compared with GVF and NGVF. Proposed method introduces a normalized set and an enhanced diffusion energy term; these terms bring up some extra computational cost, but they greatly speed up the diffusion of vector field. The computational cost of computing the introduced terms is much lower than the cost of computing the diffusion equation in each iteration. As a whole, vector fields with proposed method cost less times compared with GVF and NGVF. As shown in Table 1, vector fields with proposed method cost less times in each tested image compared with GVF and NGVF.

(a)

(b)

(c)

(a)

(b)

(c)

4.2. Concavity Extracting

Because of the excessive smoothing of Laplacian operator in GVF, it stops the contour convergence to the deep concavity. NGVF and EDNGVF improve the ability to converge to the deep concavity compared with GVF. As shown in the first row of Figure 5(a), the size of image is pixels. The U-shaped concavity is -pixel long and -pixel wide. The contour with GVF snake stops at the entrance of concavity. NGVF only makes the diffusion along the normal direction of the isophotes; the smooth effect is decreased. The performance in dealing with deep concavity with NGVF is shown in the first row of Figure 5(b). EDNGVF is obtained by incorporating the enhanced diffusion term into NGVF; meanwhile, the normalized set is defined to greatly enhance the diffusion effect. The performance with EDNGVF is shown in Figure 5(b). Both NGVF and EDNGVF succeed in converging to the U-shaped concavity.

For some images with complex concavity, the vectors generated by various edges in GVF and NGVF may have conflict components and some critical points appear, which is analyzed in [19]. As shown in Figure 3, GVF and NGVF suffer from “equilibrium problem.” While EDNGVF enhances the anisotropic diffusion, the conflict components in vector fields are greatly decreased. Thus, EDNGVF can be more fit to converge to complex concavity. As shown in Figure 5, the size of image with cross shaped concavity is pixels. Because of the complexity of shape, the diffusion of vectors near concavity may be restrained by other vectors. The evolutions of the contour with GVF and NGVF attain their convergence prematurely, which are shown in the second row of Figures 5(a) and 5(b). While the proposed method enhances its performance, the evolution of contour is shown in the second row of Figure 5(c) and the contour finally converges to the concavity completely.

The images with highly nonconvex boundaries are also tested. One takes, for example, the image with “hand” shape; it has a size of pixels. As shown in the third row of Figure 5(c), the hand is accurately extracted with EDNGVF. The evolutions with GVF and NGVF snakes are shown in the third row of Figures 5(a) and 5(b); both GVF and NGVF failed to extract object boundaries. The images in the first and second rows of Figure 6 are and , respectively. The conflict components in GVF and NGVF stop the contour evolving to the concave region. Local minimum points and large conflict components are always formed in GVF and NGVF, which makes the contour stop at the entrance of concave region, as shown in Figures 6(a) and 6(b). However, the conflict components in EDNGVF force field are avoided by introducing the enhanced diffusion term; the contour succeeds in attaining the deepest concavity with proposed method, which is shown in Figure 6(c). Therefore, for the U-shaped images, NGVF and proposed method have advantages over GVF, while proposed EDNGVF has better performance than NGVF and GVF in converging to some complex concavities, such as cross shaped concavity. The comparisons of GVF, NGVF, and EDNGVF show that proposed EDNGVF can be more fit to extract gray images with concavity.

Some gray images are also tested. Two images and the corresponding initial contours are shown in Figures 7(a) and 8(a); the sizes of these two images are and pixels, respectively. The comparisons of GVF, NGVF, and EDNGVF snakes are given. The same binary edge map is performed for fair comparisons. For Figure 7, the initial contour crosses the object; EDNGVF snake completely extracts the boundary. Both GVF and NGVF suffer from local minimum. As for Figure 8, the initial contour is placed inside the object. Proposed method succeeds in extracting the boundary, as shown in Figure 8(d). Meanwhile, both GVF and NGVF snakes make the contour stop undesired locations, which are shown in Figures 8(b) and 8(c), respectively. These simulations for gray images also show that proposed method has better performances than GVF and NGVF.

(a)

(b)

(c)

(d)

(a)

(b)

(c)

(d)

4.3. Comparisons with the State-of-the-Art Methods

In this section, comparisons with some state-of-the-art methods are given and analyzed. The vector fields, normally biased GVF (NBGVF) and adaptive diffusion flow (ADF), are compared. Based on the diffusion equation, ADF and NBGVF have similar diffusion effect. Both of them could not capture entire image region since the diffusion becomes weak because of the smooth effect of diffusion operator. On the other hand, the performances of converging to concavity are compared. NBGVF, ADF, and proposed method could extract some images with concavity. However, for some complex concavities, proposed method has advantages over NBGVF and ADF. For example, one just takes the first image of Figure 6. As shown in Figure 9, NBGVF and ADF failed to converge to the cross shaped concavity. While the performances of proposed method are shown in Figure 6, the proposed method make the contour succeed in converging to the concavity. Though NBGVF and ADF are obtained based on anisotropic diffusion similar to NGVF, some conflict components of vectors always appear in these vector fields. The enhanced diffusion term is incorporated in the proposed method; the saddle points are greatly decreased in EDNGVF vector field. Therefore, the proposed method has advantages in extracting objects with concavity compared with NBGVF and ADF.

5. Conclusion

In this paper, the efficient and enhanced diffusion terms for vector fields are incorporated in the energy function to obtain new vector fields. The proposed normalized set is used to keep the speed of diffusion to enlarge the capture range of vector field to the whole image region. On the other hand, the enhanced diffusion term is used to decrease critical points when it is integrated with anisotropic diffusion. Experimental results on synthetic and gray images show that proposed method greatly improves the generating efficiency of vector field and the performances in dealing with concavity, especially the highly nonconvex boundaries, such as cross shaped concavity. It is noted that proposed vector fields are also based on boundary information; they still yield unsatisfactory results when dealing with some images with complex content, such as images with low contrast. We expect to construct a vector field based on the region information to deal with the images with low contrast in the next task.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

This work was supported by National Natural Science Foundation of China (Grant nos. 61372142, 61402153, U1404603, and U1304607).

References

M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: active contour models,” International Journal of Computer Vision, vol. 1, no. 4, pp. 321–331, 1988.
View at: Publisher Site | Google Scholar
L. D. Cohen and I. Cohen, “Finite-element methods for active contour models and balloons for 2-D and 3-D images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 15, no. 11, pp. 1131–1147, 1993.
View at: Publisher Site | Google Scholar
V. Caselles, F. Catté, T. Coll, and F. Dibos, “A geometric model for active contours in image processing,” Numerische Mathematik, vol. 66, no. 1, pp. 1–31, 1993.
View at: Publisher Site | Google Scholar | MathSciNet
R. Kimmel, A. Amir, and A. M. Bruckstein, “Finding shortest paths on surfaces using level sets propagation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 6, pp. 635–640, 1995.
View at: Publisher Site | Google Scholar
T. F. Chan and L. A. Vese, “Active contours without edges,” IEEE Transactions on Image Processing, vol. 10, no. 2, pp. 266–277, 2001.
View at: Publisher Site | Google Scholar | Zentralblatt MATH
G. Aubert and P. Kornprobst, Mathematical Problems in Image Processing: Partial Differential Equations and the Calculus of Variations, Springer, New York, NY, USA, 2006.
View at: MathSciNet
C. Xu and J. L. Prince, “Snakes, shapes, and gradient vector flow,” IEEE Transactions on Image Processing, vol. 7, no. 3, pp. 359–369, 1998.
View at: Publisher Site | Google Scholar | MathSciNet
C. Xu and J. L. Prince, “Generalized gradient vector flow external forces for active contours,” Signal Processing, vol. 71, no. 2, pp. 131–139, 1998.
View at: Publisher Site | Google Scholar | Zentralblatt MATH
J. Cheng and S. W. Foo, “Dynamic directional gradient vector flow for snakes,” IEEE Transactions on Image Processing, vol. 15, no. 6, pp. 1563–1571, 2006.
View at: Publisher Site | Google Scholar
B. Li and S. T. Acton, “Active contour external force using vector field convolution for image segmentation,” IEEE Transactions on Image Processing, vol. 16, no. 8, pp. 2096–2106, 2007.
View at: Publisher Site | Google Scholar | MathSciNet
Y. W. Wu, Y. D. Jia, and Y. Q. Wang, “Adaptive diffusion flow for parametric active contours,” in Proceedings of the 20th International Conference on Pattern Recognition (ICPR '10), pp. 2788–2791, IEEE, Istanbul, Turky, August 2010.
View at: Publisher Site | Google Scholar
Y. Wu, Y. Wang, and Y. Jia, “Adaptive diffusion flow active contours for image segmentation,” Computer Vision and Image Understanding, vol. 117, no. 10, pp. 1421–1435, 2013.
View at: Publisher Site | Google Scholar
N. Jifeng, W. Chengke, L. Shigang, and Y. Shuqin, “NGVF: an improved external force field for active contour model,” Pattern Recognition Letters, vol. 28, no. 1, pp. 58–63, 2007.
View at: Publisher Site | Google Scholar
Y. Wang, L. Liu, H. Zhang, Z. Cao, and S. Lu, “Image segmentation using active contours with normally biased GVF external force,” IEEE Signal Processing Letters, vol. 17, no. 10, pp. 875–878, 2010.
View at: Publisher Site | Google Scholar
T. Wang, I. Cheng, and A. Basu, “Fluid vector flow and applications in brain tumor segmentation,” IEEE Transactions on Biomedical Engineering, vol. 56, no. 3, pp. 781–789, 2009.
View at: Publisher Site | Google Scholar
S. L. Xie, D. L. Zeng, Z. H. Zhou, and J. Zhang, “Arranging and interpolating sparse unorganized feature points with geodesic circular arc,” IEEE Transactions on Image Processing, vol. 18, no. 3, pp. 582–595, 2009.
View at: Publisher Site | Google Scholar | MathSciNet
G. Liu, Z. Zhou, S. Xie, and D. Wu, “Dynamically constrained vector field convolution for active contour model,” IEICE Transactions on Information and Systems, vol. E96-D, no. 11, pp. 2500–2503, 2013.
View at: Publisher Site | Google Scholar
X. Xie and M. Mirmehdi, “MAC: magnetostatic active contour model,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 30, no. 4, pp. 632–646, 2008.
View at: Publisher Site | Google Scholar
G. Liu, Z. Zhou, H. Zhong, and S. Xie, “Gradient descent with adaptive momentum for active contour models,” IET Computer Vision, vol. 8, no. 4, pp. 287–298, 2014.
View at: Publisher Site | Google Scholar
Y. Wang and Y. Jia, “External force for active contours: gradient vector convolution,” in PRICAI 2008: Trends in Artificial Intelligence, vol. 5351 of Lecture Notes in Computer Science, pp. 466–472, Springer, Berlin, Germany, 2008.
View at: Publisher Site | Google Scholar
L. Guillot and C. Le Guyader, “Extrapolation of vector fields using the infinity Laplacian and with applications to image segmentation,” in Scale Space and Variational Methods in Computer Vision, pp. 87–99, Springer, Berlin, Germany, 2009.
View at: Publisher Site | Google Scholar
C. Bonamy and C. Le Guyader, “Split Bregman iteration and infinity Laplacian for image decomposition,” Journal of Computational and Applied Mathematics, vol. 240, pp. 99–110, 2013.
View at: Publisher Site | Google Scholar | MathSciNet

Copyright

Copyright © 2015 Guoqi Liu 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.

PDF Download Citation

Download other formats

Order printed copies

Views

970

Downloads

1015

Citations