Beruflich Dokumente
Kultur Dokumente
symmetric
neighborhood
gp(p=0,1,2, . . . P-1) giving:
T=t(gc;g0-gc;g1-gc;.gp-1-gc)
=t (gc, gp)
Where gc corresponds to the value
of the centre pixel (Pc) of the local
neighborhood and gi corresponds
to the value of a pixel (pi, where
i=0,..., P) in the neighborhood of
pC
4.1
Segmentation
through
Uniform Local Binary pattern
method
Sample and model distributions
were obtained by scanning the
texture samples and prototypes
with the chosen operator and
dividing
the
distributions
of
operator outputs into histograms
having a fixed number of bins.
Fig 3.1
The 36 unique rotation
invariant binary patterns that can
occur in the circularly symmetric
neighbor set of LBPri 8,R. . Black and
white circles correspond to bit
values of 0 and 1 in the 8-bit
output of the operator. The first row
contains
the
nine
uniform
patterns and the numbers inside
them correspond to their unique
LBPriu2 8,R codes.
Superscript riu2 reflects the use of
rotation invariant uniform patterns
that have U value of at most 2. By
definition, exactly P+1 uniform
binary patterns can occur in a
circularly symmetric neighbor set
of P pixels. The following Equation
assigns a unique label to each of
them corresponding to the number
of 1 bits in the pattern (0 to P),
while the no uniform patterns are
grouped
under
the
miscellaneous label (P+1).
LBPriu2
P,R
P-1
= { s(gp-gc) if U( LBPP,R)<=2
P=0 P+1
otherwise
Where
U ( LBPP,R)= Is(gp-1-gc)- s(g0-gc)I
P-1
+ Is(gp-gc)- s(gp-1-gc)I
P=1
4.2 Algorithm
The Algorithm is described as
follows:
1. Select randomly a sample
sub image of 30*30 pixels
from each texture image
(one sample per texture)
2. Calculate ULBP for each
sample sub image, by
moving the 3*3 matrix,
across the sample with
overlap
3. Scan the input image by a
window of 30*30 pixels and
calculate the ULBP for
each window.
4. Calculate
the absolute
difference between the
ULBP of each window and
one of the each sample
10
D (i) = I W (j)-S (i ,j) I
J=1
i=1,2,3,4
Where:
D(i)
denotes
the
absolute
difference between the ULBP of a
window and the ULBP of a sample
sub image i; W(j) represents the
occurrence value of Binary Pattern
j in the ULBP of the window
considered; S(i,j) represents the
occurrence value of Binary pattern
j in the ULBP of the sample sub
image i.
5. The central pixel of the window
considered will be assigned to
Window
Size
25*25
20*20
15*15
10*10
Classification
Accuracy
80%
78.3%
76.67%
68.4%
Experiment #2
By using the above algorithm, fig
4.5 (a) have been processed and
segmented. The result is illustrated
in the fig 4.5(b), where two
different textures are represented
by two different grey levels. For
getting
higher
classification
accuracy Kullback-Leibler distance
is used as a similarity measure
and the window size is kept as
25*25
Window
Size
25*25
20*20
15*15
10*10
Classification
Accuracy
98%
97%
97%
97%
boundaries
in
segmentation.
the
texture