Hindawi Publishing Corporation

EURASIP Journal on Advances in Signal Processing

Volume 2008, Article ID 783898, 12 pages
doi:10.1155/2008/783898

Research Article
Fabric Defect Detection Using Modified Local Binary Patterns

F. Tajeripour,1 E. Kabir,1 and A. Sheikhi2

1 Department of Electrical Engineering, Tarbiat Modarres University, P.O. Box 14115-111, Tehran, Iran
2 Department of Electrical and Electronics Engineering, Shiraz University, P.O. Box 71348-51154, Shiraz, Iran

Correspondence should be addressed to Farshad Tajeripour, tajeri@modares.ac.ir

Received 24 December 2006; Revised 22 May 2007; Accepted 4 October 2007

Recommended by Liang-Gee Chen

Local binary patterns (LBPs) are one of the features which have been used for texture classification. In this paper, a method based
on using these features is proposed for fabric defect detection. In the training stage, at first step, LBP operator is applied to an
image of defect free fabric, pixel by pixel, and the reference feature vector is computed. Then this image is divided into windows
and LBP operator is applied to each of these windows. Based on comparison with the reference feature vector, a suitable threshold
for defect free windows is found. In the detection stage, a test image is divided into windows and using the threshold, defective
windows can be detected. The proposed method is multiresolution and gray scale invariant and can be used for defect detection
in patterned and unpatterned fabrics. Because of its simplicity, online implementation is possible as well.

Copyright 2008 F. Tajeripour 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.

1. INTRODUCTION detect specific types of the defects. Therefore, detection speed

Defect detection is an important problem in fabric quality
control process. Cost reduction in production and inspection
process is also an important objective for textile manufac-
turers. At present the quality inspection process is manually
performed by experts. Typical fabrics are 13 m wide and are
driven with speeds ranging from 20 to 200 m/min. Experts
cannot detect more than 60% of the overall defects if the fab-
ric moves faster than 30 m/min or wider than 2 m [1]. Like
other inspection processes, it has depended on workers ex-
perience until now. The development of a flexible, ecient,
reliable, and integrated real-time vision system for industrial
application is an essential issue in quality control process for
textile manufacturers. In particular, if there is a defect, it re-
duces the price of the fabric by 45%65%. To increase the
overall quality, the homogeneity of fabric, and reliability, an
automated visual inspection system is needed for better pro-
ductivity. Therefore, automation of visual inspection tasks
can increase the eciency of production lines and improve
quality of the products as well. The previous works in the
field of automatic defect detection are mainly done on paper
[2], steel roll [3], wood [4, 5], carpet [6], and textile [711].
Most of the automatic fabric inspection systems are oine
and have detection speed up to 100 m/min. An important
point regarding these systems is that each of them can only
and the range of the detectable defects are two main issues in
the field of automatic fabric inspection.
Many attempts have been made in the past three decades
to solve these problems. These attempts have been based on
three dierent approaches: statistical, spectral, and model
based. In statistical approach, gray-level texture features ex-
tracted from cooccurrence matrix [12], mean and standard
deviations of subblocks [13], autocorrelation of subimages
[14], and Karhunen-Loeve (KL) transform [15] have been
used for the detection of fabric defects. Bodnarova et al.
[16] made use of normalized cross-correlation functions for
detecting defects in fabrics. There exist many model-based
techniques for fabric defect detection. For example, Cohen et
al. [17] used a Markov random field (MRF) model for defect
inspection of fabrics. Chen and Jain [18] used a structural
approach to detect defects in textured images. Atalay [19] has
implemented an MRF-based method on TMS320C40 paral-
lel processing system for real-time defect inspection of fab-
rics. Methods that use low-order MRF are not capable of de-
tecting all kinds of the defects in fabric texture. In order to
detect all kinds of the defects, the order of the model should
be increased. This yields an increase in computational com-
plexity of the algorithm. There also exist many spectral ap-
proaches for fabric defect detection. For example, Kumar
and Pang [20] proposed a method for defect detection using
2 EURASIP Journal on Advances in Signal Processing
Unpatterned plain fabric Large repetitive unit
(flower)
Fabric
Patterned fabric
Dot patterned fabric
Repetitive pattern
Figure 1: Classification of fabrics [23].
Gabor filters which needs a large amount of computations.
They also developed a method for defect detection using only
imaginary part of Gabor filters. Chan and Pang [21] oered
a method for defect detection in textile fabrics using Fourier
analysis. Since Fourier bases are of infinite length, the con-
tribution from each of the spectral components is dicult
to quantify. Therefore, Fourier analysis is not suitable for
detecting local defects. Kumar and Pang [22] developed a
method for defect detection in textile fabrics using optimized
filters.
It should be noted that most of the researches about fab-
ric defect detection are made on unpatterned fabrics and
only a few works for defect detection in patterned fabrics
have been reported. For example, Ngan et al. [23] used a
wavelet-based method for defect detection in patterned fab-
rics. A patterned fabric is defined with repetitive patterned
units in its design. Under the class of patterned fabric, there
are many categories. Patterned fabrics that are used in this
research are Jacquard patterned fabrics. In these types of fab-
rics a flower or a graphical logo may appear on the fabric.
The repetitive unit can range from the simplest charter box,
dots, to the most complicated multiple flower, animals, or
other designed patterns. Besides there are a lot of subcate-
gories under patterned fabric. Figure 1 illustrates a classifica-
tion of fabrics [23].
The researches in this area can be divided into two dif-
ferent categories. In the first category, all attempts are con-
ducted to increase the range of the defects to be detected,
while they need a large amount of computations. References
[2022] belong to this category. In the second one, increasing
detection speed is the aim, while a restricted range of defects
can be detected. References [1219] belong to the second cat-
egory.
In this paper, a simple and straightforward method for
detecting irregularities in fabric texture is proposed, which
can detect a wide range of the defects. In this method, local
binary patterns (LBPs) are used. It should be noted that LBP
is used for texture classification [24] but in this paper for the
first time it is used for detecting textural defects in fabric. LBP
is theoretically very simple, yet ecient approach for texture
P = 4, R = 1 P = 8, R = 1 P = 12, R = 1.5
(a) (b) (c)
Figure 2: Circularly symmetric neighborhoods for dierent P and
R [24].
classification. This method is based on recognizing that cer-
tain LBP features are fundamental properties of local image
texture and their occurrence histograms are proven to be a
very powerful texture feature [24]. LBP is a highly discrimi-
native texture operator. It records the occurrence of various
patterns in neighborhood of each pixel in P-dimensional his-
tograms. Therefore, this method is used for detecting textural
defects in fabric. The proposed method is simple, multires-
olutional, and invariant to gray scale. Experimental results
show that a wide range of the defects can be detected through
this method. This method is applicable for defect detection
in both unpatterned and patterned fabrics which have a re-
peated and periodic texture.
This paper is organized as follows: in Section 2, local bi-
nary patterns are described in its basic and modified versions.
In Section 3, the proposed method for defect detection is pre-
sented. Section 4 is devoted to implementation and experi-
mental results and the conclusion is provided in Section 5.
2. USING LBP IN TEXTURE CLASSIFICATION
One of the methods used in texture classification is LBPs
[24]. In this method, a neighborhood of the image is consid-
ered and the gray value of the pixel in the center is compared
with the gray values of the other pixels in the neighborhood.
Usually the neighborhood is in circular form and the gray
values of the neighbors which do not fall exactly in the center
of pixels are estimated by interpolation. Figure 2 illustrates
circularly symmetric neighbor sets for various radii, R, and
dierent numbers of neighbors, P.
In basic form of this method, LBP operator in one neigh-
borhood of the image is defined as follows [24]:
1


P
  1, x 0,
LBPP,R = s gi gc 2i , s(x) = (1)
i=0 0, x < 0.
In (1), the gray value of the central pixel is gc and the gray
value of the ith neighbor is gi . According to this definition, it
is seen that the output of the operator is a P bit binary num-
ber with 2P distinct values. On the other hand, the value of
the output is quite dependent on the labeling of the neigh-
bors. When the image is rotated, since the neighborhood is
considered in circular form, neighbors will correspondingly
move along the perimeter of the circle. In order to make the
algorithm invariant to rotation and assign a unique value to
F. Tajeripour et al. 3

each neighborhood, the output of LBP operator is rotated 6 12 10 1 1 1

and the minimum value is selected: Thresholding
1
7 5 2 0
    1 1 1
LBPriP,R = min ROR LBPP,R , i | i = 0, 1, . . . , P 1 . (2) 5 9 5

In (2), a P-bit number is rotated i times and the minimum (a)

value between resulting numbers for i between 0 to P 1 is
selected. In (2), ROR is the abbreviation of rotate right. 1 1 1 0 0
10 12 13 7 7
In modified version of LBP [24], at first a uniformity 5 5 6 7 10 Thresholding
0 1
measure, U, is defined as the number of spatial transitions 1 1
8 8 8 9 9 1 1
between 1 s and 0 s in the pattern. Then patterns that have 10 11 13 15 10 1 1 1 1 1
uniformity measure less than UT are defined as uniform pat- 9 9 9 8 9
terns. The modified LBP is defined as follows: (b)
P 1

   Figure 3: LBPs for two square neighborhoods: (a) wm = 3, P = 8
s g p gc if U UT ,
LBPriu
P,R
T
=
p=0 (3) and (b) wm = 5, P = 16.


P+1 otherwise.

Equation (3) shows that modified LBP assigns labels from 0
to P to uniform neighborhoods and label P + 1 to nonuni-
form ones. After applying this operator to the image, the
probability of encountering a specific label can be approxi-
mated by the ratio of the number of neighbors which have
that label to the number of all neighbors. Therefore, at the
end of this process P+2 probabilities will be computed. These
probabilities can be used as powerful features for texture clas-
sification. For classification task, the log-likelihood ratio is
used. The sample under test belongs to class K if the com-
puted probabilities minimize the following ratio:

encountering these labels, as a key feature for our proposed
defect detection method. Experimental results show that if
the probability of encountering label P + 1 which is assigned
to nonuniform patterns is small (less than 1%) these features
can classify the texture correctly, otherwise dierent patterns
in the texture take the same label (P + 1) and cannot be clas-
sified.
Our simulation results show that if in the definition of
LBP operator the value of UT is selected equal to P/4, only
a negligible portion of the patterns in the texture takes label
P + 1.
In the subsequent sections, the proposed method for de-
P+1 
Si
L(S, K) = Si log . (4)
i=0
M iK
In (4), MiK is the probability of encountering label i in the
patterns of class K, and Si is the probability of encountering
label i found from the sample under test. According to (3),
it is obvious that any monotonic change in gray values does
not change the pattern and this method is invariant to gray
scale changes.
3. THE PROPOSED ALGORITHM FOR
TEXTILE DEFECT DETECTION
In this section, a new method for defect detection in fab-
rics, based on a modified version of LBP, is presented. In
basic and modified versions of LBP, selecting neighborhood
in circular form is to make the algorithm invariant to rota-
tion. Since during inspection process, rotation of fabric rolls
can be avoided, selecting circular neighborhood is not neces-
sary. On the other hand, computing brightness using inter-
polation in circular neighborhood takes a lot of time. There-
fore, in our proposed method, a square neighborhood is con-
sidered. In this case, the notation of LBPs is renamed from
LBPP,R to LBPP,wm , where the size of the window for apply-
ing LBP operator is wm wm pixel. Figure 3 illustrates square
neighborhoods and how to apply the LBP operator. Using
LBP operator, a label from 0 to P + 1 is assigned to each
neighborhood of the image. These labels reflect the relation
between a pixel and its neighbors. We use the probability of
fect detection in unpatterned and patterned fabrics will be
presented. Output of the proposed algorithm is a binary im-
age which is called defect pattern. Black pixels in the defect
pattern represent nondefective areas of the fabric and white
pixels represent defective areas. The size of the defect pattern
is the same as the size of the input image.
3.1. Defect detection in unpatterned fabrics
For detecting defects in unpatterned fabrics, in training stage,
LBP operator is applied to the whole image of a defect free
fabric and reference feature vector, M, is computed. Each el-
ement of this vector is the probability of encountering la-
bels 0 to P + 1 in the defect free image. If the number of
points in LBP (number of pixels in the neighborhood) op-
erator is P, the reference feature vector which is called M will
be P + 2 dimensional. After computing M, the image of the
defect free fabric is divided into nonoverlapping windows of
size Wd Wd which are called detection windows. Then LBP
operator is applied to each of these windows. The window
for applying LBP operator is called LBP mask. Each element
of the feature vector computed for a window is the proba-
bility of encountering a specific label in that window. In or-
der to estimate these probabilities accurately, the number of
operators applied to each detection window should be large
enough (as a rule of thumb, at least 100 operators in each
window). If the size of the detection window is Wd Wd
and the size of LBP mask is wm wm (Wd  wm ), then the
number of operators in each window will be (Wd wm + 1)2 .
4 EURASIP Journal on Advances in Signal Processing
Therefore, if the minimum number of operators applied in
each window is 100, then Wd 9 + wm .
It should be noted that the features extracted by LBP op-
erator can describe fabric texture correctly if the textures ap-
peared in detection windows are similar to fabric texture.
Therefore, the size of the detection window (Wd Wd ) cre-
ated on the image should be greater than the size of the repet-
itive unit of fabric texture. However, in unpatterned fabrics
the only condition for window size is Wd 9 + wm . As the
size of the detection window increases, the capability of the
algorithm in detecting small defects and the resolution of the
defect pattern decrease. By applying LBP operator to each of
these windows, vector Sk which is P + 2 dimensional is com-
puted. The log-likelihood ratio for each of these windows will
be computed as follows:
windows. In this case, if the size of LBP mask is wm wm
pixel, overlapping step of wm 1 between detection win-
dows is sucient to take into consideration the interaction
between all pixels in dierent detection windows (interaction
between pixels in the last column and the last row of a win-
dow with pixels in the first column and the first row of the
adjacent window). Using these types of windows, the thresh-
old is computed as in (5) and (6). The remaining stages are as
for unpatterned fabrics. It should be noted that this method
is a multiresolution and the results of selecting dierent win-
dows can be combined easily as follows:

N
 
LNK = LK SnK , M n , (7)
n=1

where N is the number of windows (neighborhood) selected
  
P+1
Sik
Lk Sk , M = Sik log , k = 1, 2, . . . , N.
i=0
Mi
In (5), N is the number of detection windows. Since the min-
imization of log-likelihood ratio shows the similarity to a
specific class, the maximum value between these ratios will
be used as a threshold for defect-free windows as follows:
 
T = Max Lk , k = 1, 2, . . . , N.
After computing reference feature vector M and the
threshold T, in the detection stage, the test image is divided
into the detection windows and log-likelihood ratio is com-
puted for each of these windows. If log-likelihood ratio ex-
ceeds the threshold, the relevant window belongs to the de-
fective areas of the fabric. In order to increase the detection
capability of the algorithm, a large area of the detection win-
dow should be occupied by the defect. Therefore, in the de-
tection stage, image is divided into overlapping windows. Ac-
cording to the simulation results, if the overlapping step of
the detection windows is Wd /2, the proposed algorithm has
appropriate detection power. Increasing overlapping step will
decrease detection speed.
3.2. Defect detection in patterned fabrics
For detecting defects in patterned fabrics which have a peri-
odic texture, in training stage, as it was mentioned in the pre-
vious sections, at first LBP operator is applied to the whole
image of a defect free sample then the image is divided into
the detection windows and LBP operator will be applied to
each of these windows. Since the fabrics are patterned if the
size of the window is less than the size of the repetitive unit
in the fabric texture, then the texture in the detection win-
dows will be dierent. So, the size of the detection window
should be much greater than the repetitive unit of the fab-
ric texture. Increasing the size of the detection window will
increase computational complexity and decreases the resolu-
tion of the defect pattern. In order to solve this problem, the
size of the detection window will be chosen a little greater
than the size of the repetitive unit in the fabric texture and in
order to take into account the interaction between all pixels
with their neighbors, the image is divided into overlapping
(5) for applying LBP operator and K is the index of the test-
ing window. The overall block diagram of the proposed al-
gorithm is shown in Figure 4.
It should be mentioned that, in the training stage, if the
number of defect free sample is Ndf , then the reference fea-
ture vector can be estimated more accurately using
Ndf
i=1Mi
(6) M= , (8)
Ndf
where Mi is the reference feature vector computed for sam-
ple i. After computing the reference feature vector, M, the
threshold is computed using
 
T = max Ti , (9)
i
where Ti is the threshold computed for sample i using (5)
and (6) and computed M.
4. IMPLEMENTATION AND RESULTS
In this research, two types of unpatterned fabrics, twill and
plain, are used. Six dierent types of the defects like dou-
ble yarn, missing yarn, broken fabric, weft crack, float, and
knots in these types of fabrics are considered. These defects
are shown in Figure 5. All these fabrics have yarns of dierent
thicknesses, and their warp and weft direction thicknesses are
also dierent. Detection results for unpatterned fabrics are
also shown in Figure 5.
In patterned fabrics, six dierent types of defects that
usually appear in fabric texture are considered. These defects
are shown in Figure 6. Detection results for patterned fabrics
are also shown in Figure 6. Images are 8-bit gray scale images
of size 256 256. These images are also used in [23, 26]. The
resolution of the camera used for these images is 200 dpi.
For detecting defects, dierent sizes of detection windows
were tested and the size of 16 16 yielded the best results.
In patterned fabrics the size of the repetitive unit is nearly
16 16. As explained in Section 3.1, in order to estimate the
probability of encountering dierent labels (0 to P + 1) ac-
curately, the size of the detection windows should be large
enough. It is also dependent to P. Increasing the size of the
F. Tajeripour et al. 5

Applying LBP Calculating reference

mask on image feature vector, M
Defect free image

Dividing image Computing log likelihood Finding the

into detection ratio, L for each detection
windows window threshold, T

(a) Training stage

M T

Dividing image Computing log likelihood If L > T, label window as

Test sample into detection ratio, L for each detection
defective else non defective
windows window using M

(b) Testing stage

Figure 4: Overall block diagram of the proposed algorithm.

(a) (b) (c) (d) (e)

Figure 5: (a) Images of defective unpatterned fabrics from top to bottom: double yarn, missing yarn, broken fabric, weft crack, float, and
knot. Detection results in the form of defect pattern using (b) LBP8,3 , (c) LBP16,5 , (d) LBP24,7 , and (e) LBP8,3+16,5 .

detection windows decreases the capability of the algorithm mated accurately. Since the maximum size of LBP mask in
in detecting small size defects. Experimental results show that the proposed algorithm is 7 7, the size of 16 16 for detec-
if there are at least 100 operators in each detection window, tion windows is sucient for estimating these probabilities
the probability of encountering dierent labels can be esti- accurately.
6 EURASIP Journal on Advances in Signal Processing

(a) (b) (c) (d) (e)

Figure 6: (a) Images of defective patterned fabrics from top to bottom: dirty yarn, hole, thick bar, broken end, netting multiple, knot.
Detection results in the form of defect pattern using (b) LBP8,3 , (c) LBP16,5 , (d) LBP24,7 , and (e) LBP8,3+16,5 .

Table 1: Detection rate (%) for dierent defect types of patterned fabrics: (a) dirty yarn, (b) oil stain, (c) broken end, (d) netting multiple,
(e) hole, and (f) knots.

Defect types
Operator P, w Number of features
(a) (b) (c) (d) (e) (f)
8,3 10 97 95 95 92 96 95
16,5 18 96 94 94 N.D1 95 N.D
24,7 26 97 95 94 N.D 95 N.D
LBPP,w 8, 3 + 16, 5 10 + 18 98 98 98 95 96 95
8, 3 + 24, 7 10 + 26 98 96 96 94 95 97
16, 5 + 24, 7 18 + 26 97 95 94 N.D 95 N.D
8, 3 + 16, 5 + 24, 7 10 + 18 + 26 98 98 98 96 97 97
1 Not detected, when the number of detected defective windows is less than half of the number of true defective windows.

One of the ways to measure the performance of defect de- where Ncc is the number of defect free windows which are de-
tection algorithms is calculating the detection rate [25] which tected as nondefective (true negative). Ndd is the number of
is defined as follows: defective windows which are detected as defective (true pos-
itive). Ntotal is the total number of detection windows that
 is created on the image. Table 1 illustrates the detection rate
Ncc + Ndd for dierent types of the defects using dierent LBP masks.
DR = 100 , (10)
Ntotal For computing the detection rate, defect pattern generated
F. Tajeripour et al. 7

Table 2: Detection rate (%) for dierent defect types of unpatterned fabrics: (a) Double Yarn, (b) Missing Yarn, (c) Broken Fabric, (d) Weft
Crack, (e) Float, and (f) Knots.

Defect types
Operator P, w Number of features
(a) (b) (c) (d) (e) (f)
8,3 10 97 85 95 92 94 95
16,5 18 98 90 93 90 94 93
24,7 26 95 N.D 93 90 93 90
LBPP,w 8, 3 + 16, 5 10 + 18 98 98 98 95 97 97
8, 3 + 24, 7 10 + 26 98 96 96 94 95 95
16, 5 + 24, 7 18 + 26 97 N.D 94 92 95 94
8, 3 + 16, 5 + 24, 7 10 + 18 + 26 99 98 98 96 97 97

(a) (b) (c) (d)

Figure 7: (a) Images of defective fabrics, (b) defect pattern generated by the method of [26], (c) defect pattern generated by proposed
algorithm (overlapping step 8 pixels), and (d) defect pattern generated by proposed algorithm (overlapping step 15 pixels).

by the algorithm is divided into 16 16 windows and a win-
dow that contains at least one white pixel is considered as
defective. Since images are of size 256 256, Ntotal is 256. In
our image dataset of patterned fabrics, there exist sixty im-
ages of dot patterned Jacquard fabrics. Half of these images
are defect free. Training stage is done using only five sam-
ples of defect free images. In testing stage all of the defect free
samples are classified correctly. On the other hand, for each
type of the defects there exist five dierent images in our data
set. The detection rate listed in Table 1 is the average of the
detection rates for all of the defective images in the database.
In Table 2 detection rates for dierent types of the defects in
unpatterned fabrics are listed.
As shown in Figures 5 and 6, a 3 3 mask for apply-
ing LBP operator, LBP8,3 , detects almost all kinds of the de-
fects, but the defect pattern found for patterned fabrics is not
8 EURASIP Journal on Advances in Signal Processing

Table 3: Detection rate (%) of proposed algorithm and algorithm of [26] tested on dot patterned fabrics: (a) dirty yarn, (b) hole, (c) oil
stain, (d) knot, (e) broken end, and (f) netting multiple.

Defect type
Algorithm Average detection rate
(a) (b) (c) (d) (e) (f)
Reference [26] 96 97 94 95 95 94 95.1
Proposed1 98 95 97 94 97 93 95.8
Proposed2 98 96 98 94 98 95 96.5
1
Overlapping step 8 pixels.
2
Overlapping step 15 pixels.

continuous and exact in unpatterned fabrics. Therefore, the

features of 3 3 mask are combined with the features of 5 5
and 7 7 masks using (7). On the other hand, using 5 5
and 7 7 (LBP16,5 and LBP24,7 ) masks for detection as illus-
trated in Table 1 do not detect defects like netting multiple
and knots. Table 1 shows that combination of features of 3 3
Broken end
and 5 5 masks (LBP8,3+16,5 ) has an appropriate detection
rate (more than 95%).

4.1. Performance comparison

In the subsequent subsections, the performance of the pro-

posed algorithm is compared with the performance of simi- Holes
lar algorithms. For performance comparison two criteria are
used:
(1) defect detection accuracy,
(2) computational complexity and speed.
For comparing the detection accuracy of the algorithms, Netting multiple
the defect patterns generated by dierent algorithms are
compared visually. The detection rate is also used to compare
the detection accuracy.
In order to compare the computational complexity, the
number of operations required for processing a test sample
is considered.
Thick bar

4.1.1. Patterned fabrics

In order to make a comparison between the proposed

method and the existing methods for defect detection in pat-
terned fabrics, the results of the proposed method are com-
pared with the results of methods in [26, 27]. These methods
are the two newest methods for detecting defects in patterned
fabrics. In the training stage of the method of [26], a win-
dow of a defect free sample is selected. The size of this win-
dow should be greater than the size of the repeated part of
fabric texture. This window will be moved on a defect free
sample image pixel by pixel. At each point, dierence be-
tween gray values of pixels in the window and gray values
of pixels in the underlying window on the image is com-
puted. The average of absolute value of dierences is com-
puted for each point. By defining a suitable threshold, de-
fective points can be detected. Images of patterned fabrics
in both methods are the same. Comparison of the results
in Figure 7 reveals that in some specific types of the defects
like knot and hole, the method of [26] yields more accurate
defect pattern; and in some other types like dirty yarn, oil
Thin bar
(a) (b) (c)
Figure 8: Detection results for star patterned fabrics: (a) defective
samples, (b) detection results of the proposed algorithm, and (c)
detection results of the method of [27].
stain, and broken end, the proposed method generates more
accurate defect pattern. So, the proposed method and the
method in [26] have almost the same accuracy. The method
of [26] requires a large amount of computations and it is
not suitable for online implementation. However, the pro-
posed method due to its simplicity can be used for online
defect detection. It should be noted that the resolution of
the defect pattern generated by our proposed algorithm can
F. Tajeripour et al. 9

Table 4: Detection rate (%) of proposed algorithm and algorithm of [27] tested on star patterned fabrics: (a) thin bar (dirty yarn), (b) hole,
(c) thick bar (oil stain), (d) broken end, and (e) netting multiple.

Defect type
Algorithm Average detection rate
(a) (b) (c) (d) (e)
Reference [27] 95 95 94 93 96 94.6
Proposed1 97 97 96 98 96 96.8
Proposed2 98 97 99 98 95 97.4
1
Overlapping step 12 pixels.
2
Overlapping step 24 pixels.

Table 5: Detection rate (%) of proposed algorithm and algorithm of [27] tested on box patterned fabrics: (a) thin bar (dirty yarn), (b) hole,
(c) thick bar (oil stain), (d) broken end, and (e) netting multiple.

Defect type
Algorithm Average detection rate
(a) (b) (c) (d) (e)
Reference [27] 95 97 94 94 94 94.8
Proposed1 97 96 98 98 95 96.8
Proposed2 98 96 98 98 98 97.6
1
Overlapping step 12 pixels.
2
Overlapping step 24 pixels.

be increased by increasing the overlapping of the detection
windows. Moving windows pixel by pixel on the image will
generate a defect pattern like those in [26]. It is shown in
the fourth column of Figure 7. However, increasing the over-
lapping between detection windows will increase the com-
plexity of the algorithm. Table 3 illustrates the detection rate
computed for our proposed algorithm and algorithm of [26].
The method of [27] uses Bollinger bands for detecting defects
in patterned fabrics. Bollinger bands consist of three bands:
upper, middle, and lower. In this method, patterned fabrics
can be considered as comprising many rows (columns), with
a pattern designed on each row (column). The principle of
this method is that the patterned rows (columns) will gen-
erate periodic upper and lower bands. Any defect region in
windows will be 961. In each detection window, for ap-
plying LBP8,3 , 1568 comparisons, 10 multiplications, and
10 divisions are required. For applying LBP16,5 , 2304 com-
parisons, 18 multiplications, and 18 divisions are required.
Therefore, to process a test sample by the proposed method
(LBP16,5+8,3 ), 3 720 992 comparisons, 26 098 multiplications,
and 26 098 divisions are required.
It should be noted that for computing log-likelihood
ratio, the log() operation can be omitted and approxi-
mated log-likelihood ratio can be used. In approximated log-
likelihood ratio, log(x) is approximated as x 1 so approxi-
mated log-likelihood ratio (L) can be computed by

P+1 

P+1 

Si Si
patterned fabric means that there would be a break of pe- L(S, K) = Si log Si 1
i=0
MiK i=0
MiK
riodicity in the pattern. For better evaluation performance
of the proposed algorithm, it has been tested on two other 
P+1
S2i 
P+1 
P+1
S2i


types of patterned fabrics named as star patterned and box = Si = 1 (11)
i=0
MiK i=0 i=0
MiK
patterned. Detection results of the proposed algorithm and
method of [27] are compared in Figures 8 and 9. The size of 
P+1
S2i
 K) =
L(S, .
a repetitive unit for both fabrics is 25 25. Therefore, the size i=0
MiK
of 25 25 is selected for detection windows. The overlapping
step is 12 pixels. Tables 4 and 5 illustrate the detection rate Simulation results show that using approximated log-
of the proposed algorithm and algorithm of [27] tested on likelihood ratio does not change the detection rate of the pro-
star patterned and box patterned fabrics. In the method of pose algorithm.
[26] if the size of repetitive unit of fabric texture is 16 16 In the method of [27] if the size of repetitive unit of fab-
and the size of test sample is 256 256 pixel, moving the de- ric texture is 25 25 in each row (column) of the test sample
tection windows on test sample pixel by pixel yields 58 081 of size 256 256, 232 segments of length 25 pixels can be
dierent positions. For each position of detection window in considered. In each segment, 48 additions, 25 subtractions,
this method, 256 subtractions, 255 additions, 256 compar- 25 multiplications, 2 divisions, and one square root are re-
isons, and one division are required. Therefore, processing a quired. Table 6 illustrates the number of operations which
test sample of size 256 256 pixel by this method requires are required for processing a test sample of size 256 256,
14 868 736 subtractions, 14 810 655 additions, 14 868 736 using proposed method and methods of [26, 27].
comparisons, and 58 081 divisions. As shown the computational complexity of the proposed
In the proposed method if overlapping step between algorithm can be reduced by reducing the overlapping step
detection windows is 8 pixels, total number of detection between detection windows and reducing the resolution of
10 EURASIP Journal on Advances in Signal Processing

Table 6: Number of dierent operations which are required to process a test sample using dierent algorithms.

Algorithm Size of repetitive unit of fabric texture Addition subtraction Multiplication comparison division Square root
Proposed1 16 16 23064 0 26098 3720992 26098 0
Proposed2 25 25 8424 0 9072 3657312 9072 0
[26] 16 16 14810655 14868736 0 14868736 58081 0
[26] 25 25 33586176 33640000 0 33640000 53824 0
[27] 16 16 3701760 1974272 1974272 0 123392 123392
[27] 25 25 5701632 2969600 2969600 0 118784 118784
1
Overlapping step of 8 pixels between detection windows.
2
Overlapping step of 12 pixels between detection windows.

Broken end

Holes

Netting multiple

Thick bar

Thin bar
(a) (b) (c)
(a) (b) (c)
Figure 10: (a) Defective fabric images, (b) detection results using
Figure 9: Detection results for box patterned fabrics: (a) defective
our proposed algorithm, and (c) detection results using Gabor fil-
samples, (b) detection results of the proposed algorithm, and (c)
ters.
detection results of the method of [27].

the defect pattern, which cannot be done in similar algo-
rithms.
4.1.2. Unpatterned fabrics
For evaluating performance of the algorithm in detecting de-
fects of unpatterned fabrics, the detection results of the pro-
posed algorithm are compared with those of the defect de-
tection using Gabor filters [28]. Defect detection using Ga-
bor filters is one of the most accurate methods [29]. In this
method [28], an image of a defect free sample is passed
through a bank of Gabor filters. Transfer function of each
filter is obtained by changing scale and orientation of the Ga-
bor functions. In the method selected for comparison, there
F. Tajeripour et al.
exist 16 filters in the filter bank, which are obtained by chang-
ing the orientation and scale of Gabor functions to four ori-
entations and four scales. Output of each filter is thresholded
and combined with the output of the other filters using an
image fusion technique. So, for each filter in the filter bank, a
set of suitable parameters are computed. Passing test sample
through these filters will generate a defect pattern that detects
and localizes the irregularities in fabric texture. Figure 10 il-
lustrates the detection results of the proposed algorithm and
the detection results using Gabor filters. Some of the images
of unpatterned fabrics were scanned from album of standard
defects in textile industry [30] and the others were collected
from textile mills around TamilNadu state of India. These
images are gray-scale images with 8 bits long and with the
size of 256 256. If we use a procedure for computing detec-
tion rate like what was used for patterned fabrics, the aver-
age detection rate for proposed algorithm will be 97.1% and
for Gabor filters will be 98%. The methods that have been
based on Gabor filters use the idea of multichannel filtering
which takes a lot of time. Therefore, these methods have a
little chance for online implementation.
5. CONCLUSION
In this paper, a new method for detecting textural defects
in fabrics based on modified local binary patterns has been
presented. The proposed method has an acceptable detec-
tion rate (more than 95%) in all kinds of the defects which
is more than that of human experts in both unpatterned and
patterned fabrics. Furthermore, detecting all kinds of the de-
fects needs considering dierent windows which can be easily
done using the multiresolution property of this method.
This method is a useful tool for textile industries to in-
spect, identify, and localize local defects in textile products.
The proposed method is simple, gray-scale invariant, and
multiresolution. According to the performance comparison
and implementation results, it is evident that the proposed
method can detect and localize defects in patterned fabrics,
more accurately than similar algorithms. The computational
complexity of the proposed algorithm is less than similar al-
gorithms. Therefore, it can be used in online defect detection.
In spite of low-resolution defect pattern, the defect pat-
tern generated by the proposed method is suitable for a wide
range of the defects. It should be mentioned that, practically,
the detection rate and detection speed are of higher privilege
than the resolution of the defect pattern generated by the al-
gorithm.
The proposed method is implemented on three types
of patterned fabrics: dot patterned, box patterned, star pat-
terned and two types of unpatterned fabrics: twill and plain.
Six dierent types of patterned fabric defects and six dierent
types of unpatterned fabrics are considered in this research.
Implementation results show that the proposed method is
capable of detecting all kinds of the defects in both types of
the fabrics. It should be noted that this method can be used
for defect identification too. It can also be used for defect de-
tection in products which have regular and periodic textures
such as timber or plastic.
11
ACKNOWLEDGMENTS
The authors would like to thank Henry Y. T. Ngan and Indus-
trial Automation Research Laboratory, Department of Elec-
trical and Electronic Engineering, The University of Hong
Kong, for providing the database of patterned fabrics. They
also would like to thank S. Arivazhagan for providing some
samples of unpatterned fabrics.
REFERENCES
[1] C.-S. Cho, B.-M. Chung, and M.-J. Park, Development of
real-time vision-based fabric inspection system, IEEE Trans-
actions on Industrial Electronics, vol. 52, no. 4, pp. 10731079,
2005.
[2] J. W. Roberts, S. D. Rose, G. A. Jullian, et al., PC based real-
time defect imaging system for high speed web inspection, in
Machine Vision Applications in Industrial Inspection, vol. 1907
of Proceedings of SPIE, pp. 164176, San Jose, Calif, USA,
February 1993.
[3] J. Laitinen, Image quality in automated visual web inspec-
tion, in Machine Vision Applications in Industrial Inspection
V, vol. 3029 of Proceedings of SPIE, pp. 7889, San Jose, Calif,
USA, February 1997.
[4] R. W. Conners, C. W. McMillin, K. Lin, and R. E. Vasquez-
Espinosa, Identifying and locating surface defects in wood:
part of an automated lumber processing system, IEEE Trans-
actions on Pattern Analysis and Machine Intelligence, vol. 5,
no. 6, pp. 573583, 1983.
[5] E. Young, Use of linescan cameras and a DSP processing sys-
tem for high-speed wood inspection, in Machine Vision Ap-
plications, Architectures, and Systems Integration IV, vol. 2597
of Proceedings of SPIE, pp. 259264, Philadelphia, Pa, USA,
October 1995.
[6] L. Siew, R. M. Hodgson, and E. J. Wood, Texture measures for
carpet wear assessment, IEEE Transactions on Pattern Analysis
and Machine Intelligence, vol. 10, no. 1, pp. 92105, 1988.
[7] S. H. Sheen, H. T. Chien, W. P. Lawrence, and A. C. Raptis,
Ultrasonic imaging system for in-process fabric defect detec-
tion, U.S. Patent no. 5665 907, September 1997.
[8] L. Dorrity and G. Vachtsevanos, In-process fabric defect de-
tection and identification, in Proceedings of Mechatronics,
Skovde, Sweden, September 1998.
[9] C.-H. Chan and G. K. H. Pang, Fabric defect detection by
Fourier analysis, IEEE Transactions on Industry Applications,
vol. 36, no. 5, pp. 12671276, 2000.
[10] H. Sari-Sarraf and J. S. Goddard Jr., Vision system for on-
loom fabric inspection, IEEE Transactions on Industry Appli-
cations, vol. 35, no. 6, pp. 12521259, 1999.
[11] A. Kumar and G. Pang, Fabric defect segmentation using
multichannel blob detectors, Optical Engineering, vol. 39,
no. 12, pp. 31763190, 2000.
[12] I.-S. Tsai, C.-H. Lin, and J.-J. Lin, Applying an artificial neu-
ral network to pattern recognition in fabric defects, Textile
Research Journal, vol. 65, no. 3, pp. 123130, 1995.
[13] X. F. Zhang and R. R. Bresee, Fabric defect detection and
classification using image analysis, Textile Research Journal,
vol. 65, no. 1, pp. 19, 1995.
[14] E. J. Wood, Applying fourier and associated transforms to
pattern characterization in textiles, Textile Research Journal,
vol. 60, no. 4, pp. 212220, 1990.
12 EURASIP Journal on Advances in Signal Processing

[15] M. Unser and F. Ade, Feature extraction and decision proce-

dure for automated inspection of textured materials, Pattern
Recognition Letters, vol. 2, no. 2, pp. 181191, 1984.
[16] A. Bodnarova, M. Bennamoun, and K. K. Kubik, Defect de-
tection in textile materials based on aspects of the HVS, in
Proceedings of IEEE International Conference on Systems, Man
and Cybernetics (SMC 98), vol. 5, pp. 44234428, San Diego,
Calif, USA, October 1998.
[17] F. S. Cohen, Z. Fan, and S. Attali, Automated inspection of
textile fabrics using textural models, IEEE Transactions on
Pattern Analysis and Machine Intelligence, vol. 13, no. 8, pp.
803808, 1991.
[18] J. Chen and A. K. Jain, A structural approach to identify de-
fects in textured images, in Proceedings of IEEE International
Conference on Systems, Man, and Cybernetics (SMC 88), vol. 1,
pp. 2932, Beijing, China, August 1988.
[19] A. Atalay, Automated defect inspection of textile fabrics using
machine vision techniques, M.S. thesis, Bogazici University,
Istanbul, Turkey, 1995.
[20] A. Kumar and G. K. H. Pang, Defect detection in textured
materials using Gabor filters, IEEE Transactions on Industry
Applications, vol. 38, no. 2, pp. 425440, 2002.
[21] C.-H. Chan and G. K. H. Pang, Fabric defect detection by
Fourier analysis, IEEE Transactions on Industry Applications,
vol. 36, no. 5, pp. 12671276, 2000.
[22] A. Kumar and G. K. H. Pang, Defect detection in textured
materials using optimized filters, IEEE Transactions on Sys-
tems, Man, and Cybernetics, Part B, vol. 32, no. 5, pp. 553570,
2002.
[23] H. Y. T. Ngan, G. K. H. Pang, S. P. Yung, and M. K. Ng,
Defect detection on patterned jacquard fabric, in Proceed-
ings of the 32nd Applied Imagery Pattern Recognition Work-
shop (AIPR 03), pp. 163168, Washington, DC, USA, October
2003.
[24] T. Ojala, M. Pietikainen, and T. Maenpaa, Multiresolution
gray-scale and rotation invariant texture classification with lo-
cal binary patterns, IEEE Transactions on Pattern Analysis and
Machine Intelligence, vol. 24, no. 7, pp. 971987, 2002.
[25] A. Bodnarova, M. Bennamoun, and K. K. Kubik, Suitability
analysis of techniques for flaw detection in textiles using tex-
ture analysis, Pattern Analysis and Applications, vol. 3, no. 3,
pp. 254266, 2000.
[26] H. Y. T. Ngan, G. K. H. Pang, S. P. Yung, and M. K. Ng,
Wavelet based methods on patterned fabric defect detection,
Pattern Recognition, vol. 38, no. 4, pp. 559576, 2005.
[27] H. Y. T. Ngan and G. K. H. Pang, Novel method for patterned
fabric inspection using Bollinger bands, Optical Engineering,
vol. 45, no. 8, Article ID 087202, 15 pages, 2006.
[28] S. Arivazhagan, L. Ganesan, and S. Bama, Fault segmentation
in fabric images using Gabor wavelet transform, Machine Vi-
sion and Applications, vol. 16, no. 6, pp. 356363, 2006.
[29] A. Latif-Amet, A. Ertuzun, and A. Ercil, Ecient method for
texture defect detection: sub-band domain co-occurrence ma-
trices, Image and Vision Computing, vol. 18, no. 6-7, pp. 543
553, 2000.
[30] Graniteville Company, Manual of Standard Fabric Defects in
the Textile Industry, Graniteville, SC, USA, 1975.
 EURASIP Journal on Bioinformatics and Systems Biology

Special Issue on
Applications of Signal Processing Techniques to
Bioinformatics, Genomics, and Proteomics

Call for Papers

The recent development of high-throughput molecular ge- Guest Editors
netics technologies has brought a major impact to bioin-
Erchin Serpedin, Department of Electrical and Computer
formatics, genomics, and proteomics. Classical signal pro-
Engineering, Texas A&M University, College Station, TX
cessing techniques have found powerful applications in ex-
77843-3128, USA; serpedin@ece.tamu.edu
tracting and modeling the information provided by genomic
and proteomic data. This special issue calls for contributions Javier Garcia-Frias, Department of Electrical and
to modeling and processing of data arising in bioinformat- Computer Engineering, University of Delaware, Newark, DE
ics, genomics, and proteomics using signal processing tech- 19716-7501, USA; jgarcia@ee.udel.edu
niques. Submissions are expected to address theoretical de-
Yufei Huang, Department of Electrical and Computer
velopments, computational aspects, or specific applications.
Engineering, University of Texas at San-Antonio, TX
However, all successful submissions are required to be tech-
78249-2057, USA; yhuang@utsa.edu
nically solid and provide a good integration of theory with
practical data. Ulisses Braga Neto, Department of Electrical and
Suitable topics for this special issue include but are not Computer Engineering, Texas A&M University, College
limited to: Station, TX 77843-3128, USA; ulisses@ece.tamu.edu
Time-frequency representations
Spectral analysis
Estimation and detection
Stochastic modeling of gene regulatory networks
Signal processing for microarray analysis
Denoising of genomic data
Data compression
Pattern recognition
Signal processing methods in sequence analysis
Signal processing for proteomics
Authors should follow the EURASIP Journal on Bioinfor-
matics and Systems Biology manuscript format described
at the journal site http://www.hindawi.com/journals/bsb/.
Prospective authors should submit an electronic copy of
their complete manuscript through the EURASIP Journal on
Bioinformatics and Systems Biologys Manuscript Tracking
System at http://mts.hindawi.com/, according to the follow-
ing timetable:

Manuscript Due June 1, 2008

First Round of Reviews September 1, 2008
Publication Date December 1, 2008

Hindawi Publishing Corporation

http://www.hindawi.com
 EURASIP Journal on Wireless Communications and Networking
Special Issue on
Fairness in Radio Resource Management for
Wireless Networks
Call for Papers
Radio resource management (RRM) techniques (such as ad-
mission control, scheduling, sub-carrier allocation, channel
assignment, power allocation, and rate control) are essential
for maximizing the resource utilization and providing qual-
ity of service (QoS) in wireless networks.
In many cases, the performance metrics (e.g., overall
throughput) can be optimized if opportunistic algorithms
are employed. However, opportunistic RRM techniques al-
ways favor advantaged users who have good channel condi-
tions and/or low interference levels. The problem becomes
even worse when the wireless terminals have low mobility
since the channel conditions become slowly varying (or even
static), which might lead to long-term unfairness. The prob-
lem of fair resource allocation is more challenging in multi-
hop wireless networks (e.g., mesh and multihop cellular net-
works).
The performance fairness can be introduced as one of
the QoS requirements (e.g., as a condition on the minimum
throughput per user). Fair RRM schemes might penalize ad-
vantaged users; hence, there should be a tradeo between the
overall system performance and the fairness requirements.
We are soliciting high-quality unpublished research pa-
pers addressing the problem of fairness of RRM techniques
in wireless communication systems. Topics include (but are
not limited to):
Fairness of scheduling schemes in wireless networks
Tradeo between maximizing the overall throughput
and achieving throughput fairness
RRM fairness: problem definition and solution tech-
niques
Fairness performance in emerging wireless systems
(WiMAX, ad hoc networks, mesh networks, etc.)
Cross-layer RRM design with fairness
Short-term and long-term fairness requirements
Adaptive RRM to support fairness
Fairness in cooperative wireless communications
Issues and approaches for achieving fairness in multi-
hop wireless networks
Hindawi Publishing Corporation
http://www.hindawi.com
RRM framework and QoS architecture
Complexity and scalability issues
Experimental and implementation results and issues
Fairness in multiple-antenna transmission/reception
systems
Fairness in end-to-end QoS provisioning
Authors should follow the EURASIP Journal on Wire-
less Communications and Networking manuscript for-
mat described at the journal site http://www.hindawi.com/
journals/wcn/. Prospective authors should submit an elec-
tronic copy of their complete manuscript through the jour-
nal Manuscript Tracking System at http://mts.hindawi.com/,
according to the following timetable:
Manuscript Due July 1, 2008
First Round of Reviews October 1, 2008
Publication Date January 1, 2009
Guest Editors
Mohamed Hossam Ahmed, Faculty of Engineering and
Applied Science, Memorial University of Newfoundland,
St. Johns, NF, Canada A1B 3V6; mhahmed@engr.mun.ca
Alagan Anpalagan, Department of Electrical and
Computer Engineering, Ryerson University, Toronto, ON,
Canada M5G 2C5; alagan@ee.ryerson.ca
Kwang-Cheng Chen, Department of Electrical
Engineering, National Taiwan University, Taipei, Taiwan;
chenkc@cc.ee.ntu.edu.tw
Zhu Han, Department of Electrical and Computer
Engineering, College of Engineering, Boise State University
Boise, Idaho, USA; zhuhan@boisestate.edu
Ekram Hossain, Department of Electrical and Computer
Engineering, University of Manitoba, Winnipeg, MB,
Canada R3T 2N2; ekram@ee.umanitoba.ca
 EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING
Special Issue on
Cross-Layer Design for the Physical, MAC, and Link
Layer in Wireless Systems
Call for Papers
Cross-layer design is a common theme for emerging wire-
less networks, such as cellular systems and ad hoc networks,
though the objectives and requirements can be very dier-
ent. A cross-layer approach is particularly important when
designing protocols at the physical (PHY) and medium ac-
cess control (MAC)/link layer for several reasons. The past
decade gave birth to innovative techniques such as oppor-
tunistic communication, rate adaptation, and cooperative
coding, which all require close interaction between layers.
For example, optimizing the rate-delay tradeo in a mul-
tiuser wireless system requires knowledge of PHY parame-
ters such as channel state information (CSI) as well as delay
information from the MAC. As another example, the notion
of link in wireless relay systems is generalized towards a col-
lection of several physical channels related to more than two
nodes. The potential for novel solutions through cross-layer
design is further seen in the fact that it motivates collabora-
tion among researchers of dierent specialties, such as anten-
nas and propagation, signal processing, error-control coding,
scheduling, and networking (MAC) protocols.
This special issue is devoted to research eorts that use cross-
layer design to jointly optimize the lowest two layers of the
wireless communication systems. Such cross-layer solutions
will have decisive impact in future wireless networks.
Contributions on the following and related topics are so-
licited:
Random access protocols with multipacket reception
(MPR), multiantenna MPR protocols
MAC/ARQ protocols for multiantenna and wireless
relay systems
MAC-level consideration of time-varying channels:
channel estimation, channel state information (CSI),
and link adaptation
MAC-level interference mitigation via management
of PHY-level multiuser networks: for example, inter-
fering multipleaccess (MA) channels
MAC/PHY protocols and analysis of cognitive radio
networks
MAC protocols for PHY-restricted devices/circuitry
(e.g., RFID)
PHY-aware scheduling and resource allocation
Analysis of fundamental tradeos at the PHY/MAC
interface: rate-delay, energy-delay
PHY/MAC/link aspects of network coding in wireless
networks
PHY/MAC issues in wireless sensor networks and dis-
tributed source co
Cross-layer optimization of current standards
(WiMAX, W-CDMA, etc.)
Interaction of MAC/PHY design with the circuitry
and the battery management
Authors should follow the EURASIP Journal on Ad-
vances in Signal Processing manuscript format described
at http://www.hindawi.com/journals/asp/. Prospective au-
thors should submit an electronic copy of their com-
plete manuscript through the EURASIP Journal on Ad-
vances in Signal Processing Manuscript Tracking System
at http://mts.hindawi.com/, according to the following
timetable:
Manuscript Due February 1, 2008
First Round of Reviews May 1, 2008
Publication Date August 1, 2008
GUEST EDITORS:
Petar Popovski, Center for TeleInFrastructure, Aalborg
University, Niels Jernes Vej 12, A5-209, 9220 Aalborg, Den-
mark; petarp@kom.aau.dk
Mary Ann Ingram, School of Electrical and Computer Engi-
neering, Georgia Institute of Technology, 777 Atlantic Drive
NW, Atlanta, GA 30332-0250, USA;
maryann.ingram@ee.gatech.edu
Christian B. Peel, ArrayComm LLC, San Jose, CA 95131-
1014, USA; chris.peel@ieee.org
Shinsuke Hara, Graduate School of Engineering, Osaka
City University, Osaka-shi 558-8585, Japan;
hara@info.eng.osaka-cu.ac.jp
Stavros Toumpis, Department of Electrical and Computer
Engineering, University of Cyprus, 1678 Nicosia, Cyprus;
toumpis@ucy.ac.cy

Hindawi Publishing Corporation

http://www.hindawi.com
 EURASIP Journal on Image and Video Processing

Special Issue on
3D Image and Video Processing

Call for Papers

3D image and 3D video processing techniques have received Object recognition and tracking
increasing interest in the last years due to the availability of 3D video/communications
high-end capturing, processing, and rendering devices. Costs Streaming of 3D data
for digital cameras have dropped significantly and they allow Augmented/mixed reality
the capturing of high-resolution images and videos, and thus Image-based rendering
even multi-view acquisition becomes interesting in commer- Free viewpoint video
cial applications. At the same time, processing power and
storage have reached the level that allows the real-time pro- Authors should follow the EURASIP Journal on Im-
cessing and analysis of 3D image information. The synthe- age and Video Processing manuscript format described
sized 3D information can be interactively visualized on high- at http://www.hindawi.com/journals/ivp/. Prospective au-
end graphics boards that become available even on small mo- thors should submit an electronic copy of their com-
bile devices. 3D displays can additionally help to increase the plete manuscripts through the EURASIP Journal on Im-
immersiveness of a 3D framework. All these developments age and Video Processing Manuscript Tracking System
move the interest in 3D image and video processing meth- at http://mts.hindawi.com/, according to the following
ods from a more academic point of view to commercially at- timetable:
tractive systems and enable many new applications such as
3DTV, augmented reality, intelligent human-machine inter- Manuscript Due March 1, 2008
faces, interactive 3D video environments, and much more.
Although the technical requirements are more and more First Round of Reviews June 1, 2008
fulfilled for a commercial success, there is still a need of so- Publication Date September 1, 2008
phisticated algorithms to handle 3D image information. The
amount of data is extremely high, requiring ecient tech-
niques for coding, transmission, and processing. Similarly, Guest Editors
the estimation of 3D geometry and other meta data from
Peter Eisert, Fraunhofer Institute for Telecommunications,
multiple views, the augmentation of real and synthetic scene
Heinrich Hertz Institute, Berlin, Germany;
content, and the estimation of 3D object or face/body motion
eisert@hhi.fraunhofer.de
have been addressed mainly for restricted scenarios but often
lack robustness in a general environment. This leaves many Marc Pollefeys, Department of Computer Science,
interesting research areas in order to enhance and optimize University of North Carolina at Chapel Hill, USA, Institute
3D imaging and to enable fully new applications. Therefore, for Computational Science, ETH Zurich, Switzerland;
this special issue targets at bringing together leading experts marc@cs.unc.edu
in the field of 3D image and video processing to discuss and
Stefano Tubaro, Dipartimento di Elettronica e
investigate this interesting topic.
Informazione, Politecnico di Milano, Milano, Italy;
Specifically, this special issue will gather high-quality, orig-
stefano.tubaro@polimi.it
inal contributions on all aspects of the analysis, interaction,
streaming, and synthesis of 3D image and video data. Topics
of interest include (but are not limited to):
3D image and video analysis and synthesis
Face analysis and animation
3D reconstruction

Hindawi Publishing Corporation

http://www.hindawi.com
 EURASIP Journal on Image and Video Processing

Special Issue on
Distributed Video Coding

Call for Papers

Distributed source coding (DSC) is a new paradigm based on manuscripts through the journal Manuscript Tracking Sys-
two information theory theorems: Slepian-Wolf and Wyner- tem at http://mts.hindawi.com/, according to the following
Ziv. Basically, the Slepian-Wolf theorem states that, in the timetable:
lossless case, the optimal rate achieved when performing
joint encoding and decoding of two or more correlated Manuscript Due May 1, 2008
sources can theoretically be reached by doing separate encod-
ing and joint decoding. The Wyner-Ziv theorem extends this First Round of Reviews August 1, 2008
result to lossy coding. Based on this paradigm, a new video Publication Date November 1, 2008
coding model is defined, referred to as distributed video cod-
ing (DVC), which relies on a new statistical framework, in-
stead of the deterministic approach of conventional coding Guest Editors
techniques such as MPEG standards. Frederic Dufaux, Ecole Polytechnique Fdrale de
DVC oers a number of potential advantages. It first al- Lausanne, Lausanne, Switzerland; frederic.dufaux@epfl.ch
lows for a flexible partitioning of the complexity between the
encoder and decoder. Furthermore, due to its intrinsic joint Wen Gao, School of Electronic Engineering and Computer
source-channel coding framework, DVC is robust to channel Science, Peking University, Beijing, China;
errors. Because it does no longer rely on a prediction loop, wgao@pku.edu.cn
DVC provides codec independent scalability. Finally, DVC is Stefano Tubaro, Dipartimento di Elettronica e
well suited for multiview coding by exploiting correlation be- Informazione, Politecnico di Milano, Milano, Italy;
tween views without requiring communications between the stefano.tubaro@polimi.it
cameras.
High-quality original papers are solicited for this special Anthony Vetro, Mitsubishi Electric Research Laboratories,
issue. Topics of interest include (but are not limited to): Cambridge, MA, USA; avetro@merl.com
Architecture of DVC codec
Coding eciency improvement
Side information generation
Channel statistical modeling and channel coding
Joint source-channel coding
DVC for error resilience
DVC-based scalable coding
Multiview DVC
Complexity analysis and reduction
DSC principles applied to other applications such as
encryption, authentication, biometrics, device foren-
sics, query, and retrieval
Authors should follow the EURASIP Journal on Im-
age and Video Processing manuscript format described
at http://www.hindawi.com/journals/ivp/. Prospective au-
thors should submit an electronic copy of their complete

Hindawi Publishing Corporation

http://www.hindawi.com
Research Letters in
Signal Processing
Why publish in this journal?
Research Letters in
Research Letters in Signal Processing is devoted to very fast publication of short, high-
quality manuscripts in the broad field of signal processing. Manuscripts should not exceed Signal Processing
Hindawi Publishing Corporation
4 pages in their final published form. Average time from submission to publication shall http://www.hindawi.com Volume 2007

be around 60 days.

Editorial Board
Why publish in this journal? Tyseer Aboulnasr, Canada
Wide Dissemination T. Adali, USA
All articles published in the journal are freely available online with no subscription or registration S. S. Agaian, USA
barriers. Every interested reader can download, print, read, and cite your article. Tamal Bose, USA
Jonathon Chambers, UK
Quick Publication Liang-Gee Chen, Taiwan
The journal employs an online Manuscript Tracking System which helps streamline and speed P. Dan Dan Cristea, Romania
the peer review so all manuscripts receive fast and rigorous peer review. Accepted articles appear Karen Egiazarian, Finland
online as soon as they are accepted, and shortly after, the final published version is released online Fary Z. Ghassemlooy, UK
following a thorough in-house production process. Ling Guan, Canada

Research Letters in
M. Haardt, Germany
Professional Publishing Services Peter Handel, Sweden
The journal provides professional copyediting, typesetting, graphics, editing, and reference

Signal Processing
Alfred Hanssen, Norway
validation to all accepted manuscripts. Andreas Jakobsson, Sweden
Jiri Jan, Czech Republic
Keeping Your Copyright
Soren Holdt Jensen, Denmark
Authors retain the copyright of their manuscript, which is published using the Creative Commons Stefan Kaiser, Germany
Attribution License, which permits unrestricted use of all published material provided that it is
C. Chung Ko, Singapore
properly cited.
S. Maw Kuo, USA
Extensive Indexing Miguel Angel Lagunas, Spain
Hindawi Publishing Corporation James Lam, Hong Kong
Articles published in this journal will be indexed in several major indexing databases to ensure
thehttp://www.hindawi.com
maximum possible visibility of each published article. Mark Liao, Taiwan Volume 2007
Stephen Marshall, UK
Stephen McLaughlin, UK
Submit your Manuscript Now... Antonio Napolitano, Italy
In order to submit your manuscript, please visit the journals website that can be found at C. Richard, France
http://www.hindawi.com/journals/rlsp/ and click on the Manuscript Submission link in the M. Rupp, Austria
navigational bar. William Allan Sandham, UK
Ravi Sankar, USA
Should you need help or have any questions, please drop an email to the journals editorial office
John J. Shynk, USA
at rlsp@hindawi.com
A. Spanias, USA
ISSN: 1687-6911; e-ISSN: 1687-692X; doi:10.1155/RLSP
Yannis Stylianou, Greece
Jarmo Henrik Takala, Finland
S. Theodoridis, Greece
Hindawi Publishing Corporation Luc Vandendorpe, Belgium
410 Park Avenue, 15th Floor, #287 pmb, New York, NY 10022, USA
Jar-Ferr Kevin Yang, Taiwan