# Unsupervised Texture Segmentation Using Active Contour Model and Oscillating Information

Authors: Guodong Wang; Zhenkuan Pan; Qian Dong; Ximei Zhao; Zhimei Zhang; Jinming Duan
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

Textures often occur in real-world images and may cause considerable difficulties in image segmentation. In order to segment texture images, we propose a new segmentation model that combines image decomposition model and active contour model. The former model is capable of decomposing structural and oscillating components separately from texture image, and the latter model can be used to provide smooth segmentation contour. In detail, we just replace the data term of piecewise constant/smooth approximation in CCV (convex Chan-Vese) model with that of image decomposition model-VO (Vese-Osher). Therefore, our proposed model can estimate both structural and oscillating components of texture images as well as segment textures simultaneously. In addition, we design fast Split-Bregman algorithm for our proposed model. Finally, the performance of our method is demonstrated by segmenting some synthetic and real texture images.


---

## Body

## 1. Introduction

Unsupervised texture segmentation is a popular topic in image processing. It is an important technique for image analysis and understanding. Texture images are difficult to be segmented as the texture on an object is very similar to its boundary. The strong contrast of the texture always leads to wrong segmentation result.Active contour models provide a very good framework for variational image segmentation. Some active contour models use the gradient information of the image to detect edge but may lead to unclear boundaries between two textures. For instance, some active contour models based on edge stopping function are mentioned in [1–9]. However, edge-based segmentation methods are limited in many applications where the objects have no clear edges such as in medical images. To deal with this problem, many features such as mean value, variance, and probability density function (pdf) have been incorporated into the segmentation models. Chan-Vese model [10] is one of the variational image segmentation models based on estimation of different means of different regions. Other statistical features such as the variance and pdf estimator are used to carry out the segmentation task in [11]. Zhu in [12] and Paragios et al. in [13, 14] used mixture of Gaussian models to approximate the pdf. Herbulot et al. in [15–17] carried out the segmentation task by updating the pdf of the object and the background at every step of the iteration. The aforementioned models are not suitable for general texture segmentation because they use some specific features and some prior estimation models which are not suitable for textures.Most active contour models for texture segmentation contain two steps. Firstly, different features of different textures are analyzed and modeled. Secondly, different modeled features are adopted into a general framework of active contour models. Statistical models are often used by the assumption that statistics features of each texture are often stationary [18, 19]. These methods can only deal with regular textures, and they often fail in real textural cases. In many cases, the original image must be transformed to meet the real demand. Doretto et al. [20] used Gauss-Markov model to process the relationships among pixels in different regions. They also proposed that nonparametric statistics and higher order statistics models can be used for feature space classification.Different filters are used for assisting texture segmentations. The commonly used types of filters are Gabor and Wavelet which can decompose the image into a set of different subbands [6, 21–23]. The responses of Gabor or Wavelet are different in different textures in different scales or orientations. The summation of the filter responses can synthesize a new image without texture which is the basic idea of the texture segmentation using filter theory. In the filtering process, the edges are also blurred, so such type of active contour models must search for help from the edge detecting methods. The texture segmentation results also rely on the effect of edge detection methods. Usually, filters based texture segmentation methods are very time consuming because many assisting images are generated by different filters with different scales and orientations.Some sophisticated feature descriptors are also used in texture segmentation. Bigun et al. in [24] dealt with texture segmentation by making use of the structure tensors [25] which form a matrix composed of partial derivatives smoothed by a Gaussian kernel. The structure tensors contain the information of scalar value and texture orientation which are good properties of texture discrimination.Recently, LBP (local binary pattern) method which is an excellent operator for texture analysis was used in active contour models for texture segmentation [26–28]. The LBP features achieve higher classification accuracy and need lower computational burden than Gabor and Wavelet features [29–31]. LBP guided active contour models [26–28] use regional information of LBP distributions which is estimated by means of the log-likelihood statistics.All the segmentation methods mentioned above enable us to find local minimizers of the segmentation problem. It means that the quality of the segmentation results depends on the choice of the initial condition. To solve the problem of local minimization, authors of [32, 33] reformulated the Chan-Vese model as a convex one which can be called CCV (convex Chan-Vese) model which leads to global minimizer. Fast methods such as dual method and splitting technology are also designed for accelerating the process of the segmentation such as unsupervised segmentation method based on the Kullback-Leibler distance and nonparametric estimation of pdf [34]. The Split-Bregman algorithm [35, 36] was proposed for solving L1 norm and also introduced in convexified active contour model which is faster than [32]. The Split-Bregman algorithm which is equivalent to the augmented Lagrangian method [37, 38] is superior over Graph Cut method in accuracy and efficiency. In this paper, we also use the Split-Bregman algorithm for accelerating the minimization of our proposed method.All the methods mentioned above for texture segmentation mainly use statistical or filter theory. In this paper, we propose a new method for texture segmentation which does not need additional filter or statistical steps. This is the main difference between our model and many other models for texture segmentation. In our model, we only use the structural and oscillating components’ information of the image which can be estimated via variational image decomposition model [39]. The texture is considered as oscillating component and the structure part is considered as piecewise constant/smooth image component; these two features are used to distinguish features of different regions in the textural segmentation. The active contour model proposed in this paper does not use the gradient to detect boundaries because the variational decomposition model incorporates the edge information.The main contribution of the paper is shown as follows. First, we propose a new active contour model coupling image decomposition. In other words, our textural segmentation method uses the information of oscillating and structural components. Because the active contour model and image decomposition method are all on a basis of variational methods, they can be combined together by nature. Second, for the sake of implementation, the fast and easy Split-Bregman method is applied for solving the model.The outline of the paper is demonstrated as follows. The next section introduces the VO model for image decomposition. In Section3, we will propose our new active contour model coupling image decomposition. Then, we design the Split-Bregman algorithms. Section 4 demonstrates the effectiveness of the proposed new model for texture segmentation on a variety of synthetic and real textured images. The last section is conclusion.


## 2. Image Decomposition and VO Model

Many papers [39–44] are devoted to the variational models of decomposing an image into the structural component and textural component; that is, an image f can be decomposed into two components u and v. u is well-structured component, which is the main part of the image and includes the main information of geometric features. The component v contains the oscillating patterns (both textures and noise). Meyer [40] established the oscillation function modeling theory of the textured image based on the ROF model [45], using the space of oscillation functions (space G) as the function space of textured image. As Meyer mentioned, space G is essentially the dual space of the space of functions of bounded variation (BV) [41]. BMO [42] is a bounded mean oscillation space. But Meyer did not give the reliable method in [40]. Le and Vese [42] proposed Besov space B
p
,
q
s
(
-
2
<
s
<
0
,
1
≤
p
,
q
≤
∞
) to describe the oscillation part of the image by extending B
-
1
,
∞
∞ space. Aujol et al. [43] defined the energy functional on BV
(
Ω
)
×
G
(
Ω
) by improving the ROF model and Meyer’s theory. Vese and Osher [39] proposed a VO model which approximates Meyer’s theoretical model; they gave an L
p approximation to the norm ∥
·
∥
G, the corresponding Euler-Lagrange equations, and numerical methods, but the speed of computation is slow. Osher et al. (OSV) [44] extended VO model and presented a variational model for image decomposition which is based on the total variation and the norm H
-
1. The authors show that this new model was simpler than VO model; however, a new fourth-order nonlinear PDE arose from the Euler-Lagrange equations; its difference format was complex and computational efficiency was not high. In this paper, we couple VO model with our active contour model because VO model has the ability of large texture decomposition.In [40], the Banach space G
(
R
2
) proposed by Meyer is defined as
(1)
G
=
{
τ
∣
τ
=
∂
x
g
1
(
x
,
y
)
+
∂
y
g
2
(
x
,
y
)
,
g
1
,
g
2
∈
L
∞
(
Ω
)
}
,
induced by the norm
(2)
∥
τ
∥
*
=
inf
⁡
g
=
(
g
1
,
g
2
)
{
∥
g
1
2
+
g
2
2
∥
L
∞
∣
τ
=
∂
x
g
1
+
∂
y
g
2
}
.
Here, Ω is an open and bounded domain. Given an image function f defined on Ω, Meyer’s decomposition model is as follows:
(3)
min
⁡
u
{
E
(
u
)
=
∫
Ω
|
∇
u
|
+
λ
∥
τ
∥
*
,
f
=
u
+
τ
}
.
In this model, u is structural component of the image and τ is oscillating component constituted by texture or noise information, but, in practice, model (3) is difficult to implement due to the nature of the norm ∥
∥
*. Osher et al. [44] were the first to overcome this difficulty by proposing an L
p approximation to the norm ∥
∥
* in the following energy:
(4)
min
⁡
u
,
g
1
,
g
2
{
G
p
(
u
,
g
1
,
g
2
)
[
∫
Ω
(
g
1
2
+
g
2
2
)
p
d
x
d
y
]
1
/
p
h
h
h
h
h
h
=
∫
Ω
|
∇
u
|
d
x
d
y
h
h
h
h
h
h
h
h
+
λ
∫
Ω
|
f
-
u
-
∇
·
g
→
|
2
d
x
d
y
h
h
h
h
h
h
h
h
+
μ
[
∫
Ω
(
g
1
2
+
g
2
2
)
p
d
x
d
y
]
1
/
p
}
,
where g
→
=
(
g
1
,
g
2
), |
g
→
|
=
g
1
2
+
g
2
2, τ
(
x
,
y
)
=
∂
x
g
1
(
x
,
y
)
+
∂
y
g
2
(
x
,
y
), g
1
,
g
2
∈
L
∞
(
R
2
). g
→ is the oscillating component of the image. In their paper, the authors use the value p
=
1 and they claim that there is no any obvious difference for different values of p, with 1
≤
p
≤
10. In this paper, we also set p
=
1 for convenience.


## 3. Active Contour Model Coupling Image Decomposition

The oscillating and structural components decomposed from original textural image are important information for image analysis. They are the main features between different textural parts. The VO model contains edge and oscillating information, so we incorporated it into active contour model for textural segmentation. The new model coupling image decomposition with active contour model is(5)
arg
min
⁡
ϕ
∈
[
0,1
]
{
∫
Ω
|
∇
ϕ
|
d
x
d
y
E
(
ϕ
,
u
1
,
u
2
,
g
→
1
,
g
→
2
)
h
h
h
h
h
h
h
=
∫
Ω
|
∇
ϕ
|
d
x
d
y
hhhhhhhhh
+
∫
Ω
(
(
α
1
|
f
-
u
1
-
∇
·
g
→
1
|
2

+
β
1
|
∇
u
1
|

+
γ
1
|
g
→
1
|
)
ϕ
hhhhhhhhhhhhh
+

(
α
2
|
f
-
u
2
-
∇
·
g
→
2
|
2

+
β
2
|
∇
u
2
|

+
γ
2
|
g
→
2
|
)
hhhhhhhhhhhhh
∫
Ω
|
∇
ϕ
|
d
x
d
y
(
α
1
|
f
-
u
1
-
∇
·
g
→
1
|
2
+
β
1
|
∇
u
1
|
+
γ
1
|
g
→
1
|
)

×
(
1
-
ϕ
)
)
d
x
d
y
}
,
where Ω is the image domain, α
1, β
1, γ
1, α
2, β
2, γ
2 are the positive parameters, f is the original texture image, u
1 and u
2 are the structural parts, g
→
1
,
g
→
2 are the oscillating components of different classes, and ϕ is a standard level set function. The oscillating components suffice to discriminate textures. This is a global minimization problem due to convex set ϕ
∈
[
0,1
]. Chan et al. [33] transformed the original active contour model to a convex minimization problem by relaxing ϕ
∈
{
0,1
} to ϕ
∈
[
0,1
] and showed that the characteristic function 1
Ω
c
(
μ
)
=
{
x
:
ϕ
(
x
)
>
th
}
(
x
) is the global minimizer for every th
∈
[
0,1
]. We mainly use the form of (5) because the texture in different areas is not always the same. This is a natural extension of CV [10] and VC [46] model for piecewise constant or smooth model.Equation (5) can be divided into the following three subproblems of minimization.u
2, ϕ are fixed; for solving u
1, the energy function about u
1 is
(6)
min
⁡
u
1
{
E
(
u
1
)
=
∫
Ω
(
α
1
|
f
-
u
1
-
∇
·
g
→
1
|
2
h
h
h
h
h
h
h
h
h
h
h
h
h
l
∫
Ω
α
1
|
f
-
u
1
-
∇
·
g
→
1
|
2
+
β
1
|
∇
u
1
|
+
γ
1
|
g
→
1
|
)
ϕ
d
x
d
y
}
;
u
1, ϕ are fixed; for solving u
2, the energy function about u
2 is
(7)
min
⁡
u
2
{
E
(
u
2
)
=
∫
Ω
(
α
2
|
f
-
u
2
-
∇
·
g
→
2
|
2
+
β
2
|
∇
u
2
|
+
γ
2
|
g
→
2
|
)
h
h
h
h
h
h
h
h
h
h
h
h
h
∫
Ω
|
∇
ϕ
|
d
x
d
y
×
(
1
-
ϕ
)
d
x
d
y
}
;
u
1, u
2 are fixed; for solving ϕ, the energy function about ϕ is
(8)
arg
min
⁡
ϕ
∈
[
0,1
]
{
E
(
ϕ
)
=
∫
Ω
|
∇
ϕ
|
d
x
d
y
h
h
h
h
h
h
h
h
h
h
h
h
h
h
+
∫
Ω
R
(
u
1
,
u
2
,
g
→
1
,
g
→
2
)
ϕ
d
x
d
y
}
.
In (8), R can be expressed by
(9)
R
(
u
1
,
u
2
,
g
→
1
,
g
→
2
)
=
(
α
1
|
f
-
u
1
-
∇
·
g
→
1
|
2
+
β
1
|
∇
u
1
|
+
γ
1
|
g
→
1
|
)
-
(
α
2
|
f
-
u
2
-
∇
·
g
→
2
|
2
+
β
2
|
∇
u
2
|
+
γ
2
|
g
→
2
|
)
.
In what follows, we will solve (6), (7), and (8) using the Split-Bregman method.The Split-Bregman method [37] is used to solve (6) by introducing auxiliary vector variable ω
→
1
k and Bregman iterative parameter b
→
1 and transforming (6) into the equivalent minimization problem:
(10)
b
→
1
k
+
1
=
b
→
1
k
+
∇
u
1
k
-
ω
→
1
k
,
(11)
(
u
1
k
+
1
,
ω
⃑
1
k
+
1
,
g
→
1
k
+
1
)
=
arg
min
⁡
ω
1
⃑
,
u
1
,
g
→
1
{
∫
Ω
(
β
1
|
ω
⃑
1
|
d
x
d
y
(
ω
1
⃑
-
∇
u
1
-
b
1
⃑
k
+
1
)
2
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
+
α
1
|
f
-
u
1
-
∇
·
g
→
1
|
2
+
γ
1
|
g
→
1
|
+
μ
1
2
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
∫
Ω
(
β
1
|
ω
⃑
1
|
d
x
d
y
×
(
ω
⃑
1
-
∇
u
1
-
b
⃑
1
k
+
1
)
2
)
ϕ
d
x
d
y
}
.
In the above equation, g
→
1
=
(
g
11
g
12
)
T.Alternative optimization of (11) results in
(12)
u
1
k
+
1
=
u
1
k
-
μ
1
∇
·
(
(
ω
⃑
1
k
-
∇
u
1
k
-
b
⃑
1
k
+
1
)
ϕ
k
)
+
2
α
1
(
f
-
u
1
k
-
∇
·
g
→
1
k
)
ϕ
k
.
We can explicitly solve the minimization problem for ω
⃑
1
k
+
1 using a generalized shrinkage formula [36]:
(13)
ω
⃑
1
k
+
1
=
max
⁡
(
|
∇
u
1
k
+
1
+
b
⃑
1
k
+
1
|
-
β
1
μ
1
,
0
)
∇
u
1
k
+
1
+
b
⃑
1
k
+
1
|
∇
u
1
k
+
1
+
b
⃑
1
k
+
1
|
;
g
11 and g
12 are solved separately as follows:
(14)
γ
1
g
11
g
11
2
+
g
12
2
=
2
α
1
[
∂
(
u
1
k
-
f
)
∂
x
+
∂
x
x
2
g
11
k
+
∂
x
y
2
g
12
k
]
,
γ
1
g
12
g
11
2
+
g
12
2
=
2
α
1
[
∂
(
u
1
k
-
f
)
∂
y
+
∂
y
x
2
g
11
k
+
∂
y
y
2
g
12
k
]
.
For solving u
2, the procedure is the same as for solving u
1.Equation (8) has the same form as (6), so it can be solved using the same algorithm (see (10)–(14)). In what follows, we will solve (8) using Split-Bregman method. Equation (6) can be cast to the following minimization problem:
(15)
d
→
k
+
1
=
d
→
k
+
∇
ϕ
k
-
v
→
k
,
(16)
(
ϕ
k
+
1
,
v
→
k
+
1
)
=
arg
min
⁡
v
→
,
ϕ
∈
[
0,1
]
{
∫
Ω
|
v
→
|
d
x
d
y
h
h
h
h
h
h
h
h
h
h
+
∫
Ω
(
R
(
u
1
,
u
2
,
g
→
1
,
g
→
2
)
ϕ
d
x
d
y
λ
2
(
v
→
-
∇
ϕ
-
d
→
k
+
1
)
2
h
h
h
h
h
h
h
h
h
h
h
l
h
h
h
h
h
∫
Ω
|
v
→
|
d
x
d
y
+
λ
2
(
v
→
-
∇
ϕ
-
d
→
k
+
1
)
2
d
x
d
y
)
}
.
Alternative optimization of (16) results in the following procedures.Fixv
→ to solve ϕ:
(17)
ϕ
=
arg
min
⁡
ϕ
∈
[
0,1
]
{
∫
Ω
(
R
(
u
1
,
u
2
,
g
→
1
,
g
→
2
)
ϕ
d
x
d
y
λ
2
(
v
→
-
∇
ϕ
-
d
→
k
+
1
)
2
h
h
h
h
h
h
h
h
h
h
h
∫
Ω
(
R
(
u
1
,
u
2
,
g
→
1
,
g
→
2
)
ϕ
d
x
d
y
λ
2
(
v
→
-
∇
ϕ
-
d
→
k
+
1
)
2
+
λ
2
(
v
→
-
∇
ϕ
-
d
→
k
+
1
)
2
d
x
d
y
)
}
.
By variational method, the Euler-Lagrange equations of (17) are
(18)
λ
(
Δ
ϕ
+
∇
·
d
→
k
+
1
-
∇
·
v
→
)
-
R
(
u
1
,
u
2
,
g
→
1
,
g
→
2
)
=
0
.
Using gradient descent method, we can get ϕ:
(19)
ϕ
k
+
1
=
(
1
1
+
4
λ
t
)
t
×
(
λ
(
ϕ
i
,
j
-
1
k
+
ϕ
i
,
j
+
1
k
+
ϕ
i
-
1
,
j
k
+
ϕ
i
+
1
,
j
k
+
∇
·
d
→
k
+
1
h
h
h
h
h
-
∇
·
v
→
k
d
→
k
+
1
)
-
R
(
u
1
,
u
2
,
g
→
1
,
g
→
2
)
d
→
k
+
1
)
.
t is the time step and, in the whole paper, we set t
=
1. Then, we construct ϕ by projecting it on [
0,1
]; that is,
(20)
ϕ
k
+
1
=
min
⁡
(
max
⁡
(
ϕ
k
+
1
,
0
)
,
1
)
.
Fix ϕ to solve v
→:
(21)
v
→
=
arg
min
⁡
v
→
{
∫
Ω
|
v
→
|
d
x
d
y
+
λ
2
∫
Ω
(
v
→
-
∇
ϕ
-
d
→
k
+
1
)
2
d
x
d
y
}
.
The Euler-Lagrange equations of (21) are
(22)
v
→
k
+
1
=
∇
ϕ
k
+
1
+
d
⃑
k
+
1
-
1
λ
v
→
k
+
1
|
v
→
k
+
1
|
;
v
⃑
k
+
1 is also gotten using a generalized shrinkage formula [36]:
(23)
v
→
k
+
1
=
max
⁡
(
|
∇
ϕ
k
+
1
+
d
⃑
k
+
1
|
-
1
λ
,
0
)
∇
ϕ
k
+
1
+
d
⃑
k
+
1
|
∇
ϕ
k
+
1
+
d
→
k
+
1
|
.
The initialization is also important; we set u
1
=
f, u
1
=
0, ω
⃑
1
=
ω
⃑
2
=
0, g
→
1
=
g
→
2
=
0, b
→
1
=
0, b
→
2
=
0, v
→
=
0, d
⃑
=
0, ϕ
=
0.In the end of calculation, we set(24)
ϕ
(
x
)
=
{
0
ϕ
(
x
)
≥
th
1
ϕ
(
x
)
<
th
.
Thus, the texture and the background can be separated. Due to ϕ
∈
[
0,1
], our new model is also globally convex. That is to say, the position of ϕ need not be initialized.


## 4. Numerical Experiments

To verify the effect of the proposed method, we test our method on a variety of synthetic and real textured images. Figure1 is the simplest synthetic textured image, and the texture in the whole image is the same. Figure 1(a) is the origin texture image; Figures 1(b) and 1(c) are the structure and texture parts got by VO model. Figure 1 demonstrates that the initial textured image is easy to be segmented when the texture is removed. Our model does not do segmentation after decomposition; however, these two processes are coupled together.Image for segmentation: (a) original image, (b) the structure part of the image using VO model, (c) the texture part of the image, and (d) the segmentation result.
(a)
(b)
(c)
(d)Figure2 is an image of a “chirp-like” brick-wall background and a Brodatz texture object, and the textures in different areas are different. The texture of background is not uniform along the gradient; the object is another texture mode. The algorithm gives the good result although in the upright and in several parts there are concave down. These two synthetic images demonstrate the goodness of our proposed segmentation method. To further verify the effectiveness of our method, we also use real-world images for comparison of the segmentation performance.An image of a “chirp-like” brick-wall background and a Brodatz texture object. (a) Original image and (b) the segmentation result.
(a)
(b)The next two examples are of two zebra images often used for texture segmentation test. The texture is very typical; there are small or large textures in different places and the direction is various. It is a powerful proof for evaluating the segmentation algorithm. We use Figure3 to demonstrate how the contour evolved from start to end of the process. Figure 3(a) is the original image, Figures 3(b), 3(c), 3(d), and 3(e) are the intermediate results of steps 20, 40, 60, and 80, and Figure 3(f) is the final result. Figure 3(g) is the texture part and Figure 3(h) is the structural part of zebra. From Figure 3(g), we can see that the texture part is a natural feature of the image. Figure 3(h) is the structural part of zebra, which controls the contour move to the general place. Figure 4 is another zebra image; the image is different from Figure 3. In some places, the gap between the stripes is very large. The algorithm is also successful for the result. In order to further demonstrate the superiority of the proposed technique, a number of comparison experiments are shown in Figure 5 using the images from the well-known Berkeley Segmentation Dataset (BSDS) [47]. In Figure 5, we compare our method with the state-of-the-art methods in [22, 34]. The comparison results in Figure 5 demonstrate that our method achieves the best accuracy for the examples.Image for segmentation: (a) original zebra image; (b) the intermediate result of step 20; (c) the intermediate result of step 40; (d) the intermediate result of step 60; (e) the intermediate result of step 80; (f) the final segmentation result; (g) the textural part of the zebra; (h) the structural part of zebra.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)Image for segmentation: (a) original zebra image; (b) the segmentation result; (c) the textural part of the image; (d) the structural part of image.
(a)
(b)
(c)
(d)Comparison results between our method and state-of-the-art methods in [22, 34]: (a) shows the original natural textural images; (b) shows the results using methods in [34]; (c) shows the results using methods in [22]; (d) shows the results of our method.
(a)
(b)
(c)
(d)In Figure6, we also give the quantitative evaluations and comparisons with the state-of-the-art methods on the textural image. The methods contain JSEG algorithm [48], a standard color-texture segmentation benchmark, NCut [49], CTM algorithm [50], and the MAP-ML estimations algorithm [51]. The quantitative comparison contains three segmentation performance measures, F-measure [52], probabilistic rand index (PRI) [53], and variation of information (VoI) [54]. These three measures are often used in performance comparison of image segmentation. The values of F-measure and PRI fall in [
0,1
], and larger value corresponds to better results. The value of VoI is in [
0
,
1
), and smaller value corresponds to better results. From the results we can see that our method gets the best performance in most of the cases. The methods we compared are all based on the color and texture information; however, our method does not use color information. We only use the oscillating and structural information of the images.Segmentation results of some texture images with PRI, VoI, andF-measure values presented in parenthesis: (a) is the results by JSEG method, (b) is the results by NCut method, (c) is the results by MAP-ML method, (d) is the results by CTM method, and (e) is the results by our proposed method.
(a)
(b)
(c)
(d)
(e)To evaluate the enhancement obtained by adopting the Split-Bregman algorithm, we give the time consumption comparison result of Figure6 in Table 1. All experiments are performed using Matlab 2010b on a Windows 7 platform with an Intel CPU at 3.2 GHz and 16 G memory. In Table 1, first, second, third, fourth, and fifth corresponding the image column number of Figure 6. In every step of iteration, the Split-Bregman method can get higher efficiency than traditional gradient descent method in energy minimization by using simple soft threshold. The total time consumed by using the Split-Bregman method is much less than using traditional gradient descent method because the Split-Bregman method gets convergence much more quickly than traditional method.Table 1
Time consumption comparison of the Split-Bregman method with traditional gradient descent method.
Methods
CPU time of every step (s)
Total CPU time (s)
Iteration number
First
Second
Third
Fourth
Fifth
First
Second
Third
Fourth
Fifth
First
Second
Third
Fourth
Fifth
Traditional gradient descent
3.107
2.954
3.077
3.094
3.102
372.86
147.73
153.80
495.12
465.28
120
50
50
160
150
Split-Bregman method
2.446
2.181
2.223
2.289
2.314
122.38
43.64
45.81
137.32
138.85
50
20
20
60
60Because the noise parts also belong to the oscillating parts, so the image decomposition can separate them [39, 55]. Thus, our model can also deal with images corrupted by noise with different level. Figure 7 is the example tested on synthetic noisy images corrupted by Gaussian noises with different levels. In Figure 7(a), there are two different areas corrupted by different noise level. In Figure 7(c), there are four parts with four different noise levels. The images cannot be segmented by using CV model [10]. In [13], the author uses covariance besides mean value of the gray value to separate different part noised by different noise with the same mean and different covariance. Our model can separate them because noise can be deemed as oscillating parts. From experiments, we can see that our model can also segment different noisy areas into different classes.Images with different noise level for segmentation: (a) original image, (b) the segmentation result, (c) original image, and (d) the segmentation result.
(a)
(b)
(c)
(d)


## 5. Conclusion

In this paper, we propose a new segmentation method for images consisting of texture. The new model does not use other tools for texture modeling. To ease the implementation, we also give the Split-Bregman method for the new model. Our method can also deal with images containing different kinds of noises. Qualitative and quantitative results show that the proposed method is good. Future research needs to address the issue of the coupling active contour model with the new proposed decomposition model for texture segmentation.



---

*Source: 614613-2014-06-26.xml*