# Robust Evolution Method of Active Contour Models and Application in Segmentation of Image Sequence

Authors: Guoqi Liu; Haifeng Li
Journal: Journal of Electrical and Computer Engineering
 (2018)

---

## Abstract

Active contour models are widely used in image segmentation. In order to obtain ideal object boundary, researchers utilize various information to define new models for image segmentation. However, the models could not meet all scenes of image. In this paper, we propose a block evolution method to improve the robustness of contour evolution. A block matrix is consisted of contours of former iterations and contours of shape prior, and a nuclear norm of the matrix is a measure of the similarity of these shapes. The constraint of the nuclear norm minimization is imposed on the evolution of active contour models, which could avoid large deformation of the adjacent curves and keep the shape conformability of contour in the evolution. The shape prior can be integrated into the block evolution method, which is effective in dealing with missing features of images and noise. The proposed method can be applied to image sequence segmentation. Experiments demonstrate that the proposed method improves the robust performance of active contour models and can increase the flexibility of applications in image sequence segmentation.


---

## Body

## 1. Introduction

Object extraction and image segmentation [1] are an important and fundamental topics in computer vision and image processing. Snakes or active contour models (ACM) [2] which have shown their great performances are the key methods for image segmentation. The principal idea in snakes is to obtain an optimum by minimizing an energy functional. A contour is evolved by minimizing some certain energies to match the object boundary while preserving the smoothness of the contour. There are broadly two types of active contour models according to the representation of the curve, that is, parametric active contours [2] and implicit active contours [3–5]. The active contour is usually represented by landmarks in parametric active contours and an energy functional was originally introduced by Kass et al. [2], while contours in implicit approaches are represented by level set [3, 5], which offers great flexibility for the curve topology. The numerical computations of evolving level set function can be elegantly performed by using the mature numerical algorithm of partial differential equations (PDE) [6].Contours always evolve to major deviations from true object boundary. One of the reasons is that various models could not meet all scenes, such as noise, inhomogeneous intensity [7, 8], and missing features in images; another one of the reasons is the mode of deformation of contours, and contours may suffer from undesired location and could not escape the local minimization [9, 10] because of improper mode of deformation. In implicit active contour model, contour represented by level sets may extract unnecessary objects. Though the energy functionals of some active contour models are convex [11, 12], some unnecessary components (such as noises) are also extracted. For parametric active contour model, contours can be not smooth or appear as self-crossing because of noise or improper parameters. As shown in Figure 1, the image is polluted by noise. The deformation of contour is shown and evolving contour appear as self-crossing within few iterations, which can cause the contour converge to undesired results.Figure 1
Contour evolves within few iterations; self-crossing of contour appears, which could make the contour suffer from undesired location.To improve the robustness of active contours, the shape prior [13–17] is often used. The prior knowledge of the shape to be segmented is modeled based on a set of manually annotated shapes to guide the segmentation. In recent works, the shape prior was applied by regularizing the distance from the active contour to the template in a level set framework. The shape prior has proven to be a powerful tool in segmentation. However, the shape prior is learnt from a set of annotated data. As pointed by [18], existing shapes in the training set are difficult to model the new instance in the testing images. Recently, the active contour with group similarity (ACGS) is proposed by Zhou et al. [18]. In ACGS, the shape prior is not learnt, the shapes of evolving contour in several frame images are utilized to constrain the evolution of contour. ACGS is a better method to evolve the contour, which is effective in dealing with missing features in images.In this paper, we propose a robust evolution method to keep the similarity among evolving sequence contours for parametric active contours model. The shape consistence of the deforming contour is kept in the evolution. Large deformation of the adjacent curves is avoided. In summary, the contributions of this paper are as follows:(
1
) A block evolution mode is proposed, where a block is consisted by contours of former iterations or contours of shape prior.(
2
) The proposed algorithm has generality, which could be conveniently integrated into active contour models, including the shape prior based active contour model.(
3
) The proposed method also has flexibility, which can be used to image sequence segmentation.The rest of this paper is organized as follows: Section2 introduces the model and algorithm of our method. The proposed algorithm is extended to the active contour model with shape prior in Section 3. Section 4 demonstrates the merits of our method by experiments. Finally, Section 5 concludes the paper with some discussions.


## 2. Proposed Method

In active contour model, an energy functional is usually minimized to segment the objects. For the energy functionalG
(
C
) with respect to C, the curve C is viewed as the object when the energy functional G
(
C
) obtains its minimum. G
(
C
) is minimized as follows:(1)
m
i
n
C
G
C
.The deformation or evolution equation of curve C is obtained with calculus of variations and gradient descent method, that is,(2)
∂
C
∂
t
=
-
ω
∇
G
,where ∇
G is the gradient of function G, t is the time variable, and ω is a parameter. The discrete form of the above equation is as follows:(3)
C
k
+
1
=
C
k
-
Δ
t
ω
∇
G
k
,where C
k represents the kth iterative solution and Δ
t is the time step. The converged curve C
n is viewed as the object boundary through a sequence of evolution C
1
,
…
,
C
n. From (3), C
k
+
1 is determined by C
k and the current gradient vector ∇
G
(
C
k
). Because of influences of noises, parameters and nonconvexity of energy functional, the gradient descent direction of ∇
G
(
C
k
) may have derivation from ideal gradient direction, which causes C
k
+
1 to suffer from a local minimum. Various of methods are proposed to define novel energy functional [19–23] or introduce some optimal methods [24–27] for obtaining robust ideal results. However, to our knowledge, few researchers try to change or improve the evolution mode of contours.


### 2.1. Energy Functional Model

Based on the above analysis, a block evolution method of curve is proposed by imposing a constraint into active contour model. To keep the shape conformability of deforming contours, the following equation is considered:(4)
m
i
n
X
F
X
.Corresponding to the curve C, the set X
=
[
C
1
,
…
,
C
B
] is a block constituted by several curves, and B is the cardinality of X. F is the energy functional of an active contour model to evolve the contour, and F
(
X
)
=
∑
i
=
1
B
F
(
C
i
). Through a sequence of evolution X
1
,
…
,
X
n, the converged contour X
n is viewed as the final result.The goal is to robustly evolve the curve converging to object. Thus, an energy functional keeping the consistence of evolving contours is integrated intoF. A nuclear norm X
∗, that is, the sum of singular values of X is considered. The nuclear norm is a continuous function and convex; some fast algorithms could be utilized. The energy functional of the proposed model is defined as follows:(5)
m
i
n
X
F
X
=
min
X
⁡
G
X
+
λ
X
∗
.Since X is a block including several contours and contour C is represented by parametric curve in the 2
D plane, C
=
[
x
1
,
…
,
x
p
,
y
1
,
…
,
y
p
]
T
∈
R
2
p, p is the number of landmarks, and (
x
i
,
y
i
) is a landmark on the curve. Thus, the size of X is 2
p
×
B. From the above equation, because the constraint of X
∗ is imposed, the shape conformability is kept and the robustness of evolution is improved. G is the energy functional of a general active contour model, such as the parametric C-V model [23]. The parametric C-V model is defined as follows:(6)
G
c
v
C
=
∫
Ω
1
I
x
-
m
1
2
d
x
+
∫
Ω
2
I
x
-
m
2
2
d
x
+
β
l
e
n
g
t
h
C
,where I is the gray intensity, Ω
1 and Ω
2 are the regions inside and outside the contour C, m
1 and m
2 are the mean intensities of Ω
1 and Ω
2, respectively, l
e
n
g
t
h
(
C
) represents the length of contour C, and β is a parameter. G
c
v is usually less sensitive to initialization and has fewer parameters to tune. G makes the contour evolving to object boundary. X
∗ is a tight convex surrogate to the rank operator, which keeps the elements of X similar. With G and nuclear norm X
∗, contour evolves robustly into the object boundary. Similar to (2), the evolution equation of X is computed as follows:(7)
X
k
+
1
=
X
k
-
Δ
t
ω
∇
F
k
,where X
k represents the kth iterative solution and Δ
t is the time step. The converged contour X
n is viewed as the final result through a sequence of evolution X
1
,
…
,
X
n. From the above equation, the current X
k
+
1 is determined by X
k and the gradient ∇
F
k. Since X is block of several contours, the evolution mode is called block evolution method. In a block, the contours of former iterations are utilized to avoid large deformation of evolving contours.Compared with ACGS, temporal sequence relationship inC
1
,
…
,
C
B for dealing with one image with the proposed model existed, while ACGS uses multiple images to evolve contours, respectively, and there is no temporal sequence in evolving contours with ACGS. Thus, the proposed method aims to keep the deformation robustness of contour. Furthermore, the prior information can be flexibly utilized to guide the evolution with the proposed method.


### 2.2. Algorithm

In order to solve (5), a regularized method is considered. G is a differentiable function and X
∗ is a convex function. For the linear combination of G and X
∗, Proximal Gradient (PG) method is always used to solve the problem. The PG uses quadratic approximation to G
(
X
) based on the previous estimate X
k at each iteration.(8)
X
k
+
1
=
a
r
g
m
i
n
X
1
2
X
-
X
k
-
1
μ
∇
G
X
k
F
+
θ
X
∗
,where ·
F denotes the Frobenius norm, μ is a constant, and λ
=
μ
θ. By introducing a variable Z, the above equation becomes(9)
X
k
+
1
=
a
r
g
m
i
n
X
1
2
X
-
Z
F
+
θ
X
∗
,where Z is updated by Z
k
=
X
k
-
(
1
/
μ
)
∇
G
(
X
k
). Therefore, the key problem is to solve (9). For (9), it has been proved that it can be solved by the following expression:(10)
X
k
+
1
=
D
θ
Z
=
D
θ
X
k
-
1
μ
∇
G
X
k
,where D
θ
(
Z
) is the singular value thresholding operator; it is given as follows:(11)
D
θ
Z
=
∑
i
=
1
min
⁡
2
p
,
B
σ
i
-
θ
+
u
i
v
i
T
,where u
i and v
i are the left and right singular vectors of Z, σ
i is the singular value, and (
·
)
+
=
max
⁡
(
·
,
0
).Then the next issue is to find∇
G
(
X
k
)
=
(
∇
G
k
(
C
1
)
,
…
,
∇
G
k
(
C
B
)
). Since there are temporal sequence relationships in C
1
,
…
,
C
B, ∇
G
k
(
C
i
)
,
i
=
1
,
…
,
B should be computed orderly. At each iteration, we evolve the active contours according to the image based forces and then impose the block regularization via singular value thresholding. The overall algorithm is summarized in Algorithm 1.Algorithm 1:Block evolution algorithm.
Input: initial contour C
0, B;
for
k
=
0 to maximum number of iterations do
for
i
=
1 to B
do
C
i
k
=
C
i
-
1
k
-
1
μ
∇
G
(
C
i
-
1
k
)
end for
X
k
+
1
=
D
θ
(
X
k
)
C
0
k
+
1
=
C
B
k
if
X
k
+
1
-
X
k
F
<
δ
then
return
X
k;
end if
end for
Output:
C
B
k;For Algorithm1, it is not necessary to have explicit representation for the energy function G; the gradient ∇
G of energy functional G is utilized from Algorithm 2. Therefore, block evolution method can be integrated into the active contour model based on external force field V [28–32], such as gradient vector field (GVF) [28], vector field convolution (VFC) [30] external forces, and just replacing ∇
G with external force field V according to (8). The proposed algorithm has advantage of evolution robustness, since it utilizes the information of previous several iterations.Algorithm 2:Block evolution algorithm for active contour model with shape prior.
Input:initial contour C
0, B, and shape prior C
s;
for
k
=
0 to maximum number of iterationsdo
for
i
=
1 to B
do
C
i
k
=
C
i
-
1
k
-
1
μ
∇
G
(
C
i
-
1
k
)
end for
Y
k
=
(
X
k
,
C
s
)
X
k
+
1
=
D
θ
(
Y
k
)
C
0
k
+
1
=
C
B
k
if
X
k
+
1
-
Y
k
F
<
δ
then
return
X
k;
end if
end for
Output:
C
B
k;


## 2.1. Energy Functional Model

Based on the above analysis, a block evolution method of curve is proposed by imposing a constraint into active contour model. To keep the shape conformability of deforming contours, the following equation is considered:(4)
m
i
n
X
F
X
.Corresponding to the curve C, the set X
=
[
C
1
,
…
,
C
B
] is a block constituted by several curves, and B is the cardinality of X. F is the energy functional of an active contour model to evolve the contour, and F
(
X
)
=
∑
i
=
1
B
F
(
C
i
). Through a sequence of evolution X
1
,
…
,
X
n, the converged contour X
n is viewed as the final result.The goal is to robustly evolve the curve converging to object. Thus, an energy functional keeping the consistence of evolving contours is integrated intoF. A nuclear norm X
∗, that is, the sum of singular values of X is considered. The nuclear norm is a continuous function and convex; some fast algorithms could be utilized. The energy functional of the proposed model is defined as follows:(5)
m
i
n
X
F
X
=
min
X
⁡
G
X
+
λ
X
∗
.Since X is a block including several contours and contour C is represented by parametric curve in the 2
D plane, C
=
[
x
1
,
…
,
x
p
,
y
1
,
…
,
y
p
]
T
∈
R
2
p, p is the number of landmarks, and (
x
i
,
y
i
) is a landmark on the curve. Thus, the size of X is 2
p
×
B. From the above equation, because the constraint of X
∗ is imposed, the shape conformability is kept and the robustness of evolution is improved. G is the energy functional of a general active contour model, such as the parametric C-V model [23]. The parametric C-V model is defined as follows:(6)
G
c
v
C
=
∫
Ω
1
I
x
-
m
1
2
d
x
+
∫
Ω
2
I
x
-
m
2
2
d
x
+
β
l
e
n
g
t
h
C
,where I is the gray intensity, Ω
1 and Ω
2 are the regions inside and outside the contour C, m
1 and m
2 are the mean intensities of Ω
1 and Ω
2, respectively, l
e
n
g
t
h
(
C
) represents the length of contour C, and β is a parameter. G
c
v is usually less sensitive to initialization and has fewer parameters to tune. G makes the contour evolving to object boundary. X
∗ is a tight convex surrogate to the rank operator, which keeps the elements of X similar. With G and nuclear norm X
∗, contour evolves robustly into the object boundary. Similar to (2), the evolution equation of X is computed as follows:(7)
X
k
+
1
=
X
k
-
Δ
t
ω
∇
F
k
,where X
k represents the kth iterative solution and Δ
t is the time step. The converged contour X
n is viewed as the final result through a sequence of evolution X
1
,
…
,
X
n. From the above equation, the current X
k
+
1 is determined by X
k and the gradient ∇
F
k. Since X is block of several contours, the evolution mode is called block evolution method. In a block, the contours of former iterations are utilized to avoid large deformation of evolving contours.Compared with ACGS, temporal sequence relationship inC
1
,
…
,
C
B for dealing with one image with the proposed model existed, while ACGS uses multiple images to evolve contours, respectively, and there is no temporal sequence in evolving contours with ACGS. Thus, the proposed method aims to keep the deformation robustness of contour. Furthermore, the prior information can be flexibly utilized to guide the evolution with the proposed method.


## 2.2. Algorithm

In order to solve (5), a regularized method is considered. G is a differentiable function and X
∗ is a convex function. For the linear combination of G and X
∗, Proximal Gradient (PG) method is always used to solve the problem. The PG uses quadratic approximation to G
(
X
) based on the previous estimate X
k at each iteration.(8)
X
k
+
1
=
a
r
g
m
i
n
X
1
2
X
-
X
k
-
1
μ
∇
G
X
k
F
+
θ
X
∗
,where ·
F denotes the Frobenius norm, μ is a constant, and λ
=
μ
θ. By introducing a variable Z, the above equation becomes(9)
X
k
+
1
=
a
r
g
m
i
n
X
1
2
X
-
Z
F
+
θ
X
∗
,where Z is updated by Z
k
=
X
k
-
(
1
/
μ
)
∇
G
(
X
k
). Therefore, the key problem is to solve (9). For (9), it has been proved that it can be solved by the following expression:(10)
X
k
+
1
=
D
θ
Z
=
D
θ
X
k
-
1
μ
∇
G
X
k
,where D
θ
(
Z
) is the singular value thresholding operator; it is given as follows:(11)
D
θ
Z
=
∑
i
=
1
min
⁡
2
p
,
B
σ
i
-
θ
+
u
i
v
i
T
,where u
i and v
i are the left and right singular vectors of Z, σ
i is the singular value, and (
·
)
+
=
max
⁡
(
·
,
0
).Then the next issue is to find∇
G
(
X
k
)
=
(
∇
G
k
(
C
1
)
,
…
,
∇
G
k
(
C
B
)
). Since there are temporal sequence relationships in C
1
,
…
,
C
B, ∇
G
k
(
C
i
)
,
i
=
1
,
…
,
B should be computed orderly. At each iteration, we evolve the active contours according to the image based forces and then impose the block regularization via singular value thresholding. The overall algorithm is summarized in Algorithm 1.Algorithm 1:Block evolution algorithm.
Input: initial contour C
0, B;
for
k
=
0 to maximum number of iterations do
for
i
=
1 to B
do
C
i
k
=
C
i
-
1
k
-
1
μ
∇
G
(
C
i
-
1
k
)
end for
X
k
+
1
=
D
θ
(
X
k
)
C
0
k
+
1
=
C
B
k
if
X
k
+
1
-
X
k
F
<
δ
then
return
X
k;
end if
end for
Output:
C
B
k;For Algorithm1, it is not necessary to have explicit representation for the energy function G; the gradient ∇
G of energy functional G is utilized from Algorithm 2. Therefore, block evolution method can be integrated into the active contour model based on external force field V [28–32], such as gradient vector field (GVF) [28], vector field convolution (VFC) [30] external forces, and just replacing ∇
G with external force field V according to (8). The proposed algorithm has advantage of evolution robustness, since it utilizes the information of previous several iterations.Algorithm 2:Block evolution algorithm for active contour model with shape prior.
Input:initial contour C
0, B, and shape prior C
s;
for
k
=
0 to maximum number of iterationsdo
for
i
=
1 to B
do
C
i
k
=
C
i
-
1
k
-
1
μ
∇
G
(
C
i
-
1
k
)
end for
Y
k
=
(
X
k
,
C
s
)
X
k
+
1
=
D
θ
(
Y
k
)
C
0
k
+
1
=
C
B
k
if
X
k
+
1
-
Y
k
F
<
δ
then
return
X
k;
end if
end for
Output:
C
B
k;


## 3. Extension

In the above section, the block evolution method is integrated into active contour model. For the active contour model with shape prior, the block evolution method is also expanded to the active contour model with shape prior. For a shape priorC
s, the energy functional of active contour model with shape prior C
s is usually defined as follows:(12)
m
i
n
C
G
C
+
λ
s
C
-
T
C
s
F
,where T is the linear or affine transform, such as translation, scaling, and rotation. It is necessary to compute the parameters of T at each iteration. The evolution with shape prior is computed by minimizing the above energy functional:(13)
C
k
+
1
=
C
k
-
Δ
t
ω
∇
G
k
+
λ
s
C
k
-
T
k
C
s
.The shape prior gradient C
k
-
T
k
(
C
s
) is integrated to energy gradient descent direction of ∇
G
(
C
k
) to constraint the shape of deforming contour. On the other hand, the above equation can be written as follows:(14)
C
k
+
1
=
1
-
Δ
t
ω
λ
s
C
k
+
Δ
t
ω
λ
s
T
C
s
-
Δ
t
ω
∇
G
k
.The active contour model with shape prior has better performance because of dynamically utilizing the information of C
k and C
s. Thus, the block evolution method is also integrated into active contour model with shape prior C
s by dynamically using the contour information X
k and C
s. Similar to Algorithm 1, the block evolution algorithm for active contour model with shape prior is given as shown in Algorithm 2.In fact, it is easy to extend to the active contour model with prior shapes of multiple contours. Corresponding to the program statementY
k
=
(
X
k
,
C
s
) of Algorithm 2, the extended algorithm for active contour model with prior shapes is obtained by setting statement Y
k
=
(
X
k
,
C
s
1
,
…
,
C
s
m
) of Algorithm 2, where C
s
1
,
…
,
C
s
m are the prior shapes. In order to keep the consistence, we still use C
s representing C
s
=
(
C
s
1
,
…
,
C
s
m
) and Algorithm 1 is extended to the active contour model with prior shape of multiple contours.According to the iterationY
k
=
(
X
k
,
C
s
) and X
k
+
1
=
D
θ
(
Y
k
) in proposed algorithm, the C
k
+
1 is determined by (
X
k
,
C
s
) and not only determined by C
k. In the block of (
X
k
,
C
s
), the C
s in block of (
X
k
,
C
s
) is the shape prior, which has advantages in dealing with missing features of objects and some complex background of image, such as noise. For sequence image segmentation, the segmented objects for several frames can be viewed as the shape prior. Therefore, the extended Algorithm 2 for active contour model with shape prior can be applied to segmentation for sequence image [18, 33] and object tracking [34–37].An example is shown to verify the effectiveness of the proposed method, which is shown in Figure2. Setting the same parameters in Figure 1, active contour model with the block evolution method is used to segment the object. As shown in Figure 2, the parameter B
=
3 is set. The object boundary is extracted with only 3 block iterations. The block evolution method without shape prior is tested, and the nuclear norm is utilized to constraint the shape conformability of evolving contours. The evolution is robust and the object boundary is converged. Compared with the evolution utilizing parametric C-V model, the block evolution method is more robust in the evolution.Figure 2
Contour evolves within few block iterations.


## 4. Experiments and Analysis

To demonstrate the advantages of the block evolution method, we compare the results of the same active contour model before and after applying the proposed constraint. Then, the proposed method is compared with ACGS. If there is no other statement, the region based active contour, that is, the parametric C-V model, is selected as the basic model.


### 4.1. Experimental Results

In this section, several images are synthesized to test the performances of proposed method. A heart shape is the object. There are occlusions or deletions to be added in these images. The task is to extract the heart shapes in all tested images. Our proposed algorithm and the parametric C-V model are tested. As shown in Figure3, the result is obtained with the parametric C-V model. The block evolution method with shape prior is shown in Figure 5, and the block evolution method with 6 shape priors is shown in Figure 4. From the comparisons, the block evolution method with multiple shape prior is robust against the occlusion and deletion. In contrast, the parametric C-V model is sensitive to occlusions and missing features in segmenting images. As shown in Figure 3, the shapes of extracted boundaries with the parametric C-V model are different. In the proposed method, the shape constraint is imposed and the shape consistence of evolving contours is kept. This is the reason why the proposed method is robust to occlusions or missing features of images.Figure 3
The results with the parametric C-V model.Figure 4
The shape prior.Figure 5
The results with the proposed method.The proposed algorithm is especially fit to apply to segmentation of image sequences since the extracted object boundary in the frame is viewed as the prior information in segmenting the next frame. Some image sequences are utilized to test the ability of the proposed method. Two typical image sequences show the performances of the proposed method; there are continuous frames in one image sequence; and there are discontinuous image frames in the other image sequence.In the first image sequence, the continuous ten image frames are selected, which are shown in Figure6, and the size of each image in this sequence is 352
×
240. The results with the proposed method and the parametric C-V model are shown in Figures 8 and 7, respectively. The extracted object boundaries with both methods are compared in Figure 9. The fish in these images is blurry, which is difficult to extract. From the results in Figures 8 and 7, respectively, both of these tested methods roughly converge to the contour of the object. However, there are still some differences between the extracted results. As shown in Figure 9, (a) are the results with the parametric C-V model and (b) are the results with the proposed method. The converged contours are nonsmooth, appear as double-contours and self-crossing, which is clearly shown in Figure 10(a). While the proposed method utilizes the shape information to constrain the evolution of contours, the extracted contour is viewed as the shape prior in the next image frame. Because of the constraint of shapes, the shapes of evolving contour are always smooth in the evolution, which is shown in the second row of Figure 10.Figure 6
The original images.Figure 7
The results of segmentation with the parametric C-V model.Figure 8
The results of segmentation with proposed block evolution method.Figure 9
The compared results of segmentation. (a) are the results with the parametric C-V model, and (b) are the results with proposed method.
(a)
(b)Figure 10
The enlarged results for clear comparison.
(a)
(b)Because of the nuclear norm to constrain the evolving contours, the shapes of the deforming contour keep consistence throughout evolution of contours. Therefore, the converged contour is always smooth, as shown in the second row of Figure10. On the other hand, since utilizing the shape information and nuclear norm, the proposed algorithm is robust and the accuracy of extracted results with proposed method is more precious compared with the typical active contour model. According to Figure 10, the enlarged results are shown; it seems that the proposed method obtains better object boundaries compared with the tested method. In order to evaluate the performances and accuracies of tested methods effectively, the quantitative results are given. For each tested algorithm, the traditional F-measure score [38] is the weighted, harmonic mean of precision and recall values; it is usually used to evaluate the quantitative results. It is given as follows:(15)
F
=
2
·
p
r
e
c
i
s
i
o
n
·
r
e
c
a
l
l
p
r
e
c
i
s
i
o
n
+
r
e
c
a
l
l
.The average F-measure score (mean ± standard deviation) for each algorithm is the following: the tested method: 0.82 ± 0.08 and proposed method: 0.93
±
0.05. According to F score, the proposed method outperforms the parametric C-V model in extracting object boundary.


### 4.2. Comparison with ACGS in Sequence Image Segmentation

In this part, the proposed algorithm and ACGS are tested and compared. As analyzed in the Section3, because of integrating prior information, the proposed method has better flexibility in segmentation of image sequence. Eight images are continuously selected to form an image sequence to test algorithms, as shown in Figure 11. The object in these images is a ball and the locations of ball in each image frame are different; the shapes of objects in these images are the same. ACGS offers an effective way to image sequence segmentation. In ACGS, the contours must be simultaneously initialized in every tested sequence images. Thus, the location information of objects in the current images is useless in the following images. Once the initialization of contours is undesired, the results with ACGS is always unsatisfactory. As shown in the Figure 12(a), ACGS failed to extract the objects in some images. A typical example is the first image of second row in Figure 12(a), and the contour is completely outside the object. As shown in Figure 12(b), ACGS with careful initialization obtains better results compared with Figure 12(a). By contrast, the proposed method obtains better results, which is shown in Figure 12(c). The proposed method allows the final result in current frame acting initial contour in the next frame. Therefore, the proposed method always obtains better accuracy of extracting objects compared with ACGS.Figure 11
The tested image sequence.Figure 12
The results of object tracking (including eight images) with ACGS and the proposed method. (a) is the result with ACGS, (b) is the result with ACGS through careful initialization, and (c) is the result with the proposed method.
(a)
(b)
(c)


## 4.1. Experimental Results

In this section, several images are synthesized to test the performances of proposed method. A heart shape is the object. There are occlusions or deletions to be added in these images. The task is to extract the heart shapes in all tested images. Our proposed algorithm and the parametric C-V model are tested. As shown in Figure3, the result is obtained with the parametric C-V model. The block evolution method with shape prior is shown in Figure 5, and the block evolution method with 6 shape priors is shown in Figure 4. From the comparisons, the block evolution method with multiple shape prior is robust against the occlusion and deletion. In contrast, the parametric C-V model is sensitive to occlusions and missing features in segmenting images. As shown in Figure 3, the shapes of extracted boundaries with the parametric C-V model are different. In the proposed method, the shape constraint is imposed and the shape consistence of evolving contours is kept. This is the reason why the proposed method is robust to occlusions or missing features of images.Figure 3
The results with the parametric C-V model.Figure 4
The shape prior.Figure 5
The results with the proposed method.The proposed algorithm is especially fit to apply to segmentation of image sequences since the extracted object boundary in the frame is viewed as the prior information in segmenting the next frame. Some image sequences are utilized to test the ability of the proposed method. Two typical image sequences show the performances of the proposed method; there are continuous frames in one image sequence; and there are discontinuous image frames in the other image sequence.In the first image sequence, the continuous ten image frames are selected, which are shown in Figure6, and the size of each image in this sequence is 352
×
240. The results with the proposed method and the parametric C-V model are shown in Figures 8 and 7, respectively. The extracted object boundaries with both methods are compared in Figure 9. The fish in these images is blurry, which is difficult to extract. From the results in Figures 8 and 7, respectively, both of these tested methods roughly converge to the contour of the object. However, there are still some differences between the extracted results. As shown in Figure 9, (a) are the results with the parametric C-V model and (b) are the results with the proposed method. The converged contours are nonsmooth, appear as double-contours and self-crossing, which is clearly shown in Figure 10(a). While the proposed method utilizes the shape information to constrain the evolution of contours, the extracted contour is viewed as the shape prior in the next image frame. Because of the constraint of shapes, the shapes of evolving contour are always smooth in the evolution, which is shown in the second row of Figure 10.Figure 6
The original images.Figure 7
The results of segmentation with the parametric C-V model.Figure 8
The results of segmentation with proposed block evolution method.Figure 9
The compared results of segmentation. (a) are the results with the parametric C-V model, and (b) are the results with proposed method.
(a)
(b)Figure 10
The enlarged results for clear comparison.
(a)
(b)Because of the nuclear norm to constrain the evolving contours, the shapes of the deforming contour keep consistence throughout evolution of contours. Therefore, the converged contour is always smooth, as shown in the second row of Figure10. On the other hand, since utilizing the shape information and nuclear norm, the proposed algorithm is robust and the accuracy of extracted results with proposed method is more precious compared with the typical active contour model. According to Figure 10, the enlarged results are shown; it seems that the proposed method obtains better object boundaries compared with the tested method. In order to evaluate the performances and accuracies of tested methods effectively, the quantitative results are given. For each tested algorithm, the traditional F-measure score [38] is the weighted, harmonic mean of precision and recall values; it is usually used to evaluate the quantitative results. It is given as follows:(15)
F
=
2
·
p
r
e
c
i
s
i
o
n
·
r
e
c
a
l
l
p
r
e
c
i
s
i
o
n
+
r
e
c
a
l
l
.The average F-measure score (mean ± standard deviation) for each algorithm is the following: the tested method: 0.82 ± 0.08 and proposed method: 0.93
±
0.05. According to F score, the proposed method outperforms the parametric C-V model in extracting object boundary.


## 4.2. Comparison with ACGS in Sequence Image Segmentation

In this part, the proposed algorithm and ACGS are tested and compared. As analyzed in the Section3, because of integrating prior information, the proposed method has better flexibility in segmentation of image sequence. Eight images are continuously selected to form an image sequence to test algorithms, as shown in Figure 11. The object in these images is a ball and the locations of ball in each image frame are different; the shapes of objects in these images are the same. ACGS offers an effective way to image sequence segmentation. In ACGS, the contours must be simultaneously initialized in every tested sequence images. Thus, the location information of objects in the current images is useless in the following images. Once the initialization of contours is undesired, the results with ACGS is always unsatisfactory. As shown in the Figure 12(a), ACGS failed to extract the objects in some images. A typical example is the first image of second row in Figure 12(a), and the contour is completely outside the object. As shown in Figure 12(b), ACGS with careful initialization obtains better results compared with Figure 12(a). By contrast, the proposed method obtains better results, which is shown in Figure 12(c). The proposed method allows the final result in current frame acting initial contour in the next frame. Therefore, the proposed method always obtains better accuracy of extracting objects compared with ACGS.Figure 11
The tested image sequence.Figure 12
The results of object tracking (including eight images) with ACGS and the proposed method. (a) is the result with ACGS, (b) is the result with ACGS through careful initialization, and (c) is the result with the proposed method.
(a)
(b)
(c)


## 5. Conclusion

In this paper, a method of active contour with block evolution method is proposed. In the proposed method, the shape prior can be integrated, and the shapes similarity of evolving contours are kept. On the other hand, evolving contour deforms robustly with the proposed method because of utilizing the contour’s evolution result of the previous iteration steps. Simulations show that the proposed method has the robust performances in segmenting objects. Compared with the state-of-the-art method (ACGS), the proposed method has shown flexibility of application in segmentation of image sequence.



---

*Source: 3493070-2018-03-14.xml*