Documente Academic
Documente Profesional
Documente Cultură
Dr.V.Sadasivam
I. INTRODUCTION
Texture segmentation is one method among different
texture analysis approaches for pattern recognition tasks. This
paper evaluates the texture segmentation performance of some
texture models which have been successfully applied in various
texture related applications and of some newly introduced
approaches by using two popular benchmarks namely
segmentation accuracy and execution time. Texture
segmentation evaluation is not a new area of work, however
previous work has either compared too few algorithms or used
very small number of test images that makes it difficult to
come to a conclusion about the accuracy of results [1]. Texture
methods can broadly be classified into statistical, geometrical,
structural, model-based and signal processing feature based
methods [2]. A research report about many texture methods and
their performances on image segmentation has been presented
by du Buf et al. [3]. Madasu Hanmandlu et al. [4] have
presented a detailed survey of the various texture segmentation
methods used in image analysis. Zhang and Tan [5] have also
0 if X i X 0
th
LYCANS 2K14
One Day International Conference On Research Vogues in Inventive Engineering
SATYAM COLLEGE OF ENGINEERING & TECHNOLOGY, 26th FEBRUARY 2014
differently. If the eight elements are ordered clockwise as
shown in Fig. 1, the first element may take eight possible
positions from the top left (a) to the middle left (h) and then the
6561 texture units can be labeled by the following formula,
N TU Ei * 3i1
(2)
i 1
(3)
LTP 3n s(i n i c ),
n 1
and
- 1 if u i c t ,
s(u) 0 if i c t u i c t ,
1 if u i t ,
c
(4)
LYCANS 2K14
One Day International Conference On Research Vogues in Inventive Engineering
SATYAM COLLEGE OF ENGINEERING & TECHNOLOGY, 26th FEBRUARY 2014
of the pattern histogram is maintained as optimum and
minimum compared to other texture models. In OLTP, a
pattern is represented by eight elements, each of which has
one of three possible values (0,1,5) that are obtained from a
neighborhood of 3x3 pixels. Let ic, i1, i2, ,i8 be the pixel
values of a local 3x3 neighborhood region, where ic is the value
of the central pixel and i1, i2, ,i8 are the pixel values of its 8
neighbors. The following equation (5) defines the process for
converting a local 3x3 neighborhood into its pattern
representation (P),
(a)
(b)
1
Fig.4. Example of
neighborhood to a
string in OLTP
(c)
0
0 pattern
5 texture model.
transforming a 3x3
0
1
(a) 3x3 Local Region (b) Pattern Matrix (c) Pattern String
0 if i n (1 )i c
P(i c , i n ) 1 if (1 )i c i n (1 )i c (5)
5 if i (1 )i
n
c
L opt
1 if | A B | 0
where F(A,B) =
0 otherwise
10005510
P(i , i
OLTP
i 1
25
(6)
(7)
) if U 3 and L opt 2
otherwise
(8)
This recently proposed texture model, OLTP [13] uses only 24
unique optimal patterns for texture representation and it groups
all other patterns under one label 25 which are termed as suboptimal patterns. Therefore the dimension
25 17
168 of pattern spectrum has been reduced from
2
2
15 25
108
6
6
24 38
332
4
0
3
LYCANS 2K14
One Day International Conference On Research Vogues in Inventive Engineering
SATYAM COLLEGE OF ENGINEERING & TECHNOLOGY, 26th FEBRUARY 2014
6561 to 25, that too with optimal set of patterns. The occurrence
frequency of all the optimal patterns over a whole texture image
is termed as OLTP Pattern Spectrum or OLTP Pattern
Histogram, which describes the texture information of the
corresponding image.
III. TEXTURE SEGMENTATION
In order to evaluate the performance of the texture models
in the process of texture segmentation, nine texture images
with the size of 256 x 256 pixels have been selected from the
image set of Brodatzs natural images [14] and Figure 5 shows
all the selected images. These images were selected because
they are broadly similar to one another and also that they
resemble parts of remotely sensed images. A supervised
segmentation method was followed over the selected nine
texture images of Fig. 5. The kullbak-leibler distance was used
as the similarity measure and the difference between two
pattern spectrums was considered as the difference between
two texture classes. The supervised segmentation method is
followed and the following steps show the procedure of the
segmentation algorithm.
Step 1. Read the texture mosaic image.
Step 2. Select randomly a sample sub image of 30x30
pixels from the texture image as sample image.
Step 3. Transfer the 30x30 sub image into the OLTP
texture model and obtain the OLTP spectrum for
the selected sub image.
Step 4. Select one sample sub image for each selected
texture image and repeat step 1 to step3 for all
the selected texture sub images.
Step 5. Select a window size of 30x30 pixels starting
TABLE I.
Transition Length
Sub Pattern
Transition Length ()
type
S.N
o
1
01
10
15
51
05
50
015
510
105
10
150
11
051
12
501
(a)
(b)
(c)
(d)
(g)
(e)
(h)
(f)
(i)
LYCANS 2K14
One Day International Conference On Research Vogues in Inventive Engineering
SATYAM COLLEGE OF ENGINEERING & TECHNOLOGY, 26th FEBRUARY 2014
sensibly fine segmentation result (Fig. 7(h)) with some minor
errors especially around texture boundaries.
Input texture image
Sub image
(30x30) block
(a)
(e)
(b)
(f)
Image Segmentation
Segmented Texture
(c)
(g)
(d)
(h)
LYCANS 2K14
One Day International Conference On Research Vogues in Inventive Engineering
SATYAM COLLEGE OF ENGINEERING & TECHNOLOGY, 26th FEBRUARY 2014
received which is the upper limit in these experiments. The
valid reason for this success is LTP uses permanent threshold
TABLE 2: TEXTURE SEGMENTATION ACCURACY RESULTS
Image
Name
pressed calf
leather
brick wall
straw
matting
loose burlap
water
french
canvas
reptile skin
herringbone
weave
raffia
TS
LBP
LTP
OLTP
93.52
90.51
95.08
98.99
90.06
87.35
94.53
97.00
83.32
82.22
92.01
92.96
89.94
91.97
88.56
88.56
93.34
93.93
94.48
95.38
81.65
79.04
85.96
89.57
88.54
86.32
90.87
91.22
94.00
90.78
95.01
98.20
80.41
74.58
87.31
89.02
Fig. 8. Computational cost (in seconds) for the selected four texture
models for the segmentation experiments
LYCANS 2K14
One Day International Conference On Research Vogues in Inventive Engineering
SATYAM COLLEGE OF ENGINEERING & TECHNOLOGY, 26th FEBRUARY 2014
[11] T. Ojala, M. Pietikainen and T. Maenpaa, Multiresolution gray-scale
and rotation invariant texture segmentation with local binary patterns,
IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.
24, no. 7, pp. 971987, 2002.
[12] X. Tan and B. Triggs, Enhanced Local Texture Feature Sets for Face
Recognition under Difficult Lighting Conditions., IEEE Transactions
on Image Processing, 19(6), pp. 1635-1650, 2010.
[13] G. Madasamy Raja and V. Sadasivam, Optimized Local Ternary
Patterns: A New Texture Model with Set of Optimal Patterns for Texture
Analysis, Journal of Computer Science, vol. 9, no. 1, pp. 114, 2013.
[14] P. Brodatz, Textures, A Photographic Album for Artists and Designers,
Dover Publications, New York, 1966.