# Invariant texture analysis through Local Binary Patterns

###### Abstract

In many image processing applications, such as segmentation and classification, the selection of robust features descriptors is crucial to improve the discrimination capabilities in real world scenarios. In particular, it is well known that image textures constitute power visual cues for feature extraction and classification. In the past few years the local binary pattern (LBP) approach, a texture descriptor method proposed by Ojala et al., has gained increased acceptance due to its computational simplicity and more importantly for encoding a powerful signature for describing textures. However, the original algorithm presents some limitations such as noise sensitivity and its lack of rotational invariance which have led to many proposals or extensions in order to overcome such limitations. In this paper we performed a quantitative study of the Ojala’s original LBP proposal together with other recently proposed LBP extensions in the presence of rotational, illumination and noisy changes. In the experiments we have considered two different databases: Brodatz and CUReT for different sizes of LBP masks. Experimental results demonstrated the effectiveness and robustness of the described texture descriptors for images that are subjected to geometric or radiometric changes.

###### keywords:

Classification, Distance Measure, Invariant Descriptor, Local Binary Pattern, Texture Analysis^{†}

^{†}journal: Pattern Recognition Letters

## 1 Introduction

Texture is the term used to characterize object surfaces and is used for pattern identification. It has been studied in the fields of visual perception and computer vision. Although it is a feature often used to characterized objects, it has been difficult to establish an appropriate definition. Since a texture is quite varied and can exhibit a large number of properties, many vision researchers have given definitions frequently in the context of different applications areas, Tuceryan and Jain (1998). However, from a mathematical point of view, it is usual to analyze textures as intensity variations from regularity –when textures simply contain periodic patterns– to randomness –where textures look like unstructured noise.

There are many ways to classify textures. Haralick (1979) proposed two different approaches: the statistical and the structural methods. The first one considers textures as the arrangement of spatial distribution of gray values in images. Inside of this group one can highlight the features extracted from the co-occurrence matrix, Davis et al. (1979). Structural methods are based on considering that textures are composed by primitives called “textons”. In this direction, Wang and He (1990) introduced a model where textures can be characterized by its texture spectrum, a set of essential small units.

A more detailed texture classification was later proposed by Paget (2008), the approaches may be divided into the following categories: i) statistical methods:a set of features is used to represent textures. The basic assumption is that the intensity variations are more or less constant within a texture region and takes a greater value outside its boundary. Statistical measures analyze spatial distribution of pixels using features extracted from the first and second-order histogram statistics Guo et al. (2010b). ii) spectral methods:these methods collect a distribution of filter responses as input to further classification or segmentation. In particular, Gabor filters have proven to be powerful and precise for describing texture patterns, Nava et al. (2011). Novel approaches seem to lead towards an improvement of Gabor filters by using local binary patterns as a complementary tool to extract texture features as in Ma and Zhu (2007); Nguyen et al. (2009); Zhang et al. (2005). Many algorithms in this category are focusing on face recognition, Huang et al. (2011). In addition, a recent analysis of rotational invariant texture features appears in Estudillo-Romero and Escalante-Ramirez (2011). iii) structural methods:some textures can be viewed as two dimensional patterns consisting of a set of primitives which are arranged according to a certain placement rules. iv) stochastic methods:textures are assumed to be the realization of a stochastic process. The parameter estimation associated with the process is quite complicated although there are good approaches in the literature, e.g., Seetharaman (2009) use a Bayesian approach as a texture descriptor.

Texture analysis through a LBP operator can be considered as a combination of both statistical and structural methods. Therefore, it can be expected a good LBP performance in a wide variety of texture identification scenarios. LBP constitutes an image operator that transforms an image into an array of integer labels that encode the pixel-wise information of the texture images. These labels can be represented as a histogram that can be interpreted as the fingerprint of the analyzed object. In fact, the LBP approach belongs to a group of non-local parametric transformations that is distinguished by the use of ordering information among data, rather than the data values themselves. Non-parametric local transformations are local image transformations that rely on the relative ordering of the intensity values.

Similarly to the Ojala et al. (1994) work, Zabih and Woodfill (1994) proposed two alternative non-parametric local transforms. The first transform called rank transform (RT) is defined as the number of pixels in a local square region whose values are lesser that the value of a central pixel. The second non-parametric local transform named census transform (CT) maps the local square neighborhood into a bit string representing the set of neighbor pixels whose intensities are lesser than a central pixel value. Both RT and CT depend solely on a set of pixel comparisons. The first limitation of these kind of methods is that the amount of information associated to a pixel is not very large which induces noise sensitivity. Another limitation is that the local measures rely heavily upon the intensity of a central pixel. Nevertheless, the last drawback is not an issue by doing comparisons using local means or median values instead of central pixel intensities Zabih and Woodfill (1994).

After the initial LBP proposal, many modifications and improvements have emerged in the literature, most of them are related to face analysis where it is assumed that input faces are registered. For this reason, many modifications are not invariant to rotational transforms. For a thorough description of LBP operators see two recent surveys and a book monograph: Nanni et al. (2011); Huang et al. (2011); Pietikäinen et al. (2011).

This paper is organized as follows. Section 2 presents an overview of LBP methods as well as the most significant extensions that have been proposed to obtain rotational invariance. In Section 3 an exhaustive evaluation of different LBP approaches previously mentioned as well as a comparative analysis of LBP rotational invariant proposals is shown. This study includes a few tests with noise and illumination changes using a rotated version of the Brodatz database, Brodatz (1966) and the CUReT texture database, Dana et al. (1999). Finally our work is summarized in Section 4.

## 2 Local Binary Pattern Overview

The very first approach to LBP was given in Ojala et al. (1994). Ojala proposed a two-level version of the original method of Wang and He (1990). Ojala claimed that this refinement provides a robust way for describing local texture patterns. However, very recently Tan and Triggs (2010) have revisited the original approach and demonstrated that a generalization of LBP called local ternary patterns (LTP) is more discriminant and less sensitive to noise for texture analysis.

The simple LBP uses a square mask called “texture spectrum” that represents the neighborhood around a central pixel, (see Fig. 1). The values of the neighbor pixels within the square mask are thresholded by the value of their central pixel. Pixel values under the threshold are labeled with “” otherwise they are labeled with “”, Fig. 1. The labeled pixels are multiplied by a weight function according with their positions, Fig. 1. Finally, the values of the eight pixels are summed to obtain a label for this neighborhood, Fig. 1. This method produced possible labels. After this process is completed for the whole image, a label or LBP histogram is computed so that can be interpreted as a fingerprint of the analyzed object. Although this method provides information about local spatial structures, it is not invariant to rotational changes and does not include contrast information which has been demonstrated to be crucial to improve the discrimination of some textures.

The classic LBP operator was later generalized by Ojala et al. (2002). Such generalization can be obtained using a circular neighborhood denoted by where represents the number of sampling points and represents the radius of the neighborhood. The sampling point coordinates are calculated using the formula . When sampling coordinates do not fall at integer positions, the intensity value is bilinearly interpolated. This implementation is called interpolated LBP ().

is defined as an ordered set of binary comparisons of pixel intensities between a central pixel and its surrounding neighbors as follows:

(1) |

where is the intensity value of the central pixel at coordinates and is the intensity value of the -neighbor. The thresholding function is defined as:

(2) |

Eq. (1) represents a texture unit composed of elements (central pixel included). In total, there are possible texture units describing spatial patterns in a neighborhood of points. achieves invariance against any monotonic transformation by considering the sign of the differences in , which effectively corresponds to binary thresholding of the local neighborhood.

is defined on a circular neighborhood allowing to change the number of neighbors and the radius size. However, increasing the number of neighbors increases the information redundancy and the computational cost, which not always resulting in a more discriminant LBP label. In this direction, Liao and Chung (2007) defined the elongated LBP (ELBP) based on an anisotropic neighborhood allowing to improve texture discrimination by implementing multi-orientation analysis.

In relation with the size of the radius, Liao et al. (2007) proposed a representation called multi-scale block LBP (MBLBP). The computation is done based on averaging values of block subregions instead of individual pixels. In this paper will further analyze the influence of the neighborhood size, (see Fig. 2).

Under a rotational transform the values of will move along a circular path around a central pixel resulting into different labels. Pietikäinen et al. (2000) proposed a modification called rotational invariant LBP () to remove the rotational effects by labeling each rotation with an identifier as follows:

(3) |

where performs a circular bitwise right shift operation times.

The main idea is to rotate the neighbors to find the minimum value that the neighbor chain may represents. This approach identifies different values when using . Nevertheless, Eq. (3) achieves invariance only for a discrete digital domain because only for perfect rotational invariance can be attained.

Ojala et al. (2002) observed that over of LBPs entail fundamental properties of textures that can be described with very few spatial transitions. He introduced a uniformity measure which corresponds to the number of spatial transitions in the pattern as follows:

(4) |

in this way the so-called uniform LBP () can be obtained as:

(5) |

Eq. (5) represents a gray-scale and rotational invariant texture descriptor that assigns a unique label to each patterns where the number of spatial transitions is at most two. These labels corresponding to the number of “” in the pattern chain while the rest of the non-uniform patters (where the number of spatial transitions is greater than two) are grouped under the label . The discrete histogram of the uniform patterns obtained has been shown to be a very powerful feature for characterizing textures, Zhou et al. (2008).

### 2.1 Modifications of rotational invariant LBP

In Eq. (5) all patterns are divided according with the number of spatial transitions resulting in sets of uniform patterns. One disadvantage is that patterns with more that two transitions are grouped into a unique label which leads to loss of discrimination. The reason for that due to the fact there not exists a general pattern that will be able to describe all textures. Every pattern is well suited for describing just a certain texture. Ma (2011) proposed the number LBP () as an extension of the by dividing the non-uniform patterns into groups based on the number of “” bits or “” bits as follows:

(6) |

where is the number if “” and is the number of “” in the non-uniform pattern.

Along the same direction, Zhou et al. (2008) proposed an extension by dividing the non-uniform patterns according to their structural properties and merging them on the basis of their degree of similarity so that the final histogram reflects texture information more efficiently because it may represent the stochastic components of textures. Moreover, Ma (2011) outperforms Zhou’s results.

Liu et al. (2011) stated that the probability of a central pixel depends only on its neighbors. In this way the neighbor intensity LBP () can be defined by replacing the central pixel value with the average of its neighbors as follows:

(7) |

where

(8) |

The presence of noise in images can seriously impair the texture extraction performance of the LBP operator. In this paper we propose to use the median operator in order to reduce noise effects. Such proposal replace the central pixel value with the median of itself and the neighbors as follows:

(9) |

where represents the median of the neighbors and the central pixel, Zabih and Woodfill (1994). This LBP modification is still invariant to rotation but less sensitive to noise. It is also invariant to monotonic illumination changes.

### 2.2 Other LBP extensions oriented to face analysis

In the last few years, face image analysis has been one of the most active research areas where LBP has been exploited because its effectiveness in deal with various challenging task of face analysis. Since most of the face detection or segmentation algorithms include a normalization step –which means that faces are registered– as a preprocessing step and therefore the LBP methods do not need to present affine invariant features.

Fu and Wei (2008) addressed the problem of noise sensitivity by considering that in most cases central pixels provide more information than their neighbor counterparts, so they assigned to the central pixels a bigger weight. In the case of images degraded by white noise Fu and Wei considered a modified version of Eq. (2) as:

(10) |

where is a fixed threshold.

In summary, Fu and Wei considered that central pixels are more important than their neighbors and thus proposed the centralized LBP () as follows:

(11) |

and is defined as:

(12) |

where and represent the intensity and coordinates of the central pixel respectively. Due to the fact that the algorithm considers correlation between opposite pixel points, this algorithm is not rotational invariant.

Tan et al. (2010) proposed an extension to the operator, Eq. (1), called extended LBP () by using the value of central pixels plus a tolerance interval as local threshold, is a user-specific value, usually set at “1”. Each pixel value within the interval zone is quantized as zero. Pixel values above the tolerance interval are labeled with “” and those below this zone are labeled with “” as follows:

(13) |

here is the difference between the neighbors and their central pixels. Each ternary pattern is split into upper and lower pattern and each part is encoded as a separate LBP pattern. Finally, their LBP histograms are concatenated.

Guo et al. (2010a) suggested using both the sign and magnitude of a vector to form the so-called completed LBP (). In Eq. (1) only the sign component is considered whereas in the Guo et al. proposal, is split into two components as follows:

(14) |

where and are the sign and magnitude of respectively. In addition, they presented an analysis of the sign component and concluded that preserves more information of than . They defined three operators that are combined to build the LBP histogram: , which considers the sign component of , which considers the magnitude component of , and which considers the magnitude of central pixels.

Finally, Liao et al. (2009) proposed the dominant LBP () which is a modification of Eq. (5) based on the fact that in practice is not well suited to encode some complicated pattern textures such as curvature edges and crossing boundaries of corners. A possible explanation is due to the fact that the extracted uniform patterns do not have a dominant proportion of them to better represent the object (or image). Liao et al. have shown that given a set of training images, the required number of patterns to better representing textures corresponds to at least of the pattern occurrences. The first step of their procedure is to compute the LBP histogram and sort it in descending order. The second step is to extract a vector for obtain of pattern occurrences. This procedure guarantees a suitable framework for representing textures.

### 2.3 LBP histogram evaluation

Since LBP operators act as fingerprint of texture, it is possible to use LBP histogram distances as a similarity measure among all different textures. Two different methodologies can be used for histogram distance evaluation: vector and probabilistic approaches. In the vector approach, a histogram is treated as a fixed-dimensional vector. Hence standard vector norms such as city block or Euclidean between univariate histograms can be used. The probabilistic approach is based on the fact that a histogram provides the basis for an empirical estimation of the probabilistic density function (pdf). Computing the distance between two histograms is equivalent to measure the overlapping part between two pdf’s as the distance.

Although the Kullback-Leibler divergence (KL) –a generalization of Shannon’s entropy– is not a true metric rather it is a relative entropy, it can be used as a suitable metric for measuring distances between histograms as follows:

(15) |

where and are two histograms with bins length each, and denotes the probability of the bin .

Cha and Srihari (2002) proposed a novel histogram distance measure called ordinal distance (OD) based on the idea that a histogram can be transformed into a histogram by moving elements from left to right, being the total movements the distance between them.

(16) |

In the next Section 3, we present several experiments of texture classification using both KL and OD metrics in order to compare the performance of seven LBP approaches under several settings.

## 3 Experiments and results

We split experimental assessments into three categories: rotational, noisy, and illumination changes. The first two evaluations were performed using the USC-SIPI image database available at Brodatz (). This database is a rotated version of Brodatz database and consists of thirteen images each digitized at seven different rotation angles: , , , , , , and degrees. The images are all pixels with bits/pixel, see Fig. 3.

For illumination tests we used a large enough subset of the CUReT database, available at Dana et al. (), to validate our experiments. In the last case, we employed ten reference images with ten illumination variations each for a total of images; the images are all pixels and were converted into gray scale with bits/pixel, see Fig. 3. The classification procedure setup consisted of comparing LBP histogram distances of each reference image against the test images.

In order to evaluate the performance of the previously described seven rotational invariant LBP approaches, we used the next thirteen textures as reference images: bark (D12), brick (D94), bubbles (D112), grass (D9), leather (D24), pigskin (D92), raffia (D84), sand (D29), straw (D15), water(D38), weave (D16), wood (D68), and wool (D19) -the number between parenthesis is the identification number in the Brodatz texture book, Brodatz (1966). We measured and compared distances among all histograms ( rotated textures and reference textures) using the two metrics previously presented in Eq. (15) and Eq. (16) and we assigned a rotated image to a certain texture according to the closest distance between LBP histograms. See Table 1 for comparative study of the accuracy performance. In addition we used confusion matrices to obtained the accuracy rate (AR) of the seven LBP approaches using the next equation:

(17) |

where are matrix indexes and is the number of texture references.

Scheme | OD metric | KLD metric | Reference. | ||
---|---|---|---|---|---|

textures | Accuracy rate | textures | Accuracy rate | ||

35 | 38.46 | 39 | 42.86 | Ojala et al. (1994). | |

79 | 86.81 | 84 | 92.31 | Ojala et al. (1994). | |

77 | 84.62 | 72 | 74.00 | Pietikäinen et al. (2000). | |

80 | 87.91 | 82 | 90.11 | Ojala et al. (2002). | |

83 | 91.21 | 80 | 87.91 | Ma (2011). | |

76 | 83.52 | 74 | 81.32 | Liu et al. (2011). | |

72 | 79.12 | 64 | 70.33 | Zabih and Woodfill (1994). |

Original Ojala’s proposal achieved the lowest AR because is not invariant to rotation with out of textures correctly classified in the worst scenario. Although this paper is focused to analyze invariant to rotation approaches, we performed a comparison between and , (see Eq. 11). achieved an AR of using the OD metric and of textures correctly classified under the KL metric. performance was even lower than original Ojala’s proposal. One of the possible reasons is that uses a fixed threshold in Eq. (10) which influences the accuracy rate.

On the other hand, achieved of textures correctly classified, more than with . This can be interpreted as add extra information of non-uniform patterns into the LBP histogram whereas labels all non-uniform patterns into a unique label which discards the large amount of texture information represented by these patterns. Another possible explanation is that stochastic components are disregarded when all non-uniform patterns are grouped because they represent abrupt variations and changes in the textures.

Table 2 and Table 3 present the best AR in the form of confusion matrices for the OD and KLD metrics respectively.

Predicted | ||||||||||||||

bark | brick | bubbles | grass | leather | pigskin | raffia | sand | straw | water | weave | wood | wool | ||

Actual | bark | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |

brick | 0 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |

bubbles | 0 | 0 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |

grass | 0 | 0 | 0 | 4 | 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |

leather | 0 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |

pigskin | 0 | 0 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |

raffia | 0 | 0 | 0 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | |

sand | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | 0 | 0 | |

straw | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | 0 | |

water | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | |

weave | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 7 | 0 | 0 | |

wood | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 0 | 0 | 2 | 0 | |

wool | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 7 |

From Table 3 one can observe that provides the higher rate using the KL metric. Since KL metric is a measure of relative entropy, there is a strong suspicious that when neighbors are calculated by bilinear interpolation, extra information is added which increases the distance between LBP histograms affecting the classification.

Predicted | ||||||||||||||

bark | brick | bubbles | grass | leather | pigskin | raffia | sand | straw | water | weave | wool | wood | ||

Actual | bark | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |

brick | 0 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |

bubbles | 0 | 0 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |

grass | 0 | 0 | 0 | 6 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |

leather | 0 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |

pigskin | 0 | 0 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |

raffia | 0 | 0 | 0 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | |

sand | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | 0 | 0 | |

straw | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | 0 | |

water | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 6 | 0 | 0 | 0 | |

weave | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 7 | 0 | 0 | |

wool | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 0 | 0 | 2 | 0 | |

wood | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 7 |

We compared the performance of , , , , , and in terms of accuracy using and on a circular neighborhood, (see Fig. 4). This configuration has shown good results in discriminating similar textures. We computed a set of OD and KLD values by compared each reference image in the database with its rotated versions. Thus the most accurate technique is the one that brings the smallest mean. We followed the assessment methodology proposed in Orjuela et al. (2011) by quantifying the distance between distinctive textures using both OD and KL metrics, Fig. 4 and Fig. 4 respectively.

Since the seven LBP approaches are rotational invariant is expected that distances are to be zero or close to zero but due to the fact that the rotated textures were scanned using a pixel video digitizing camera, the CCDs may has introduced some values that produce higher distances among LBP histograms.

### 3.1 Neighborhood size

An important issue of original LBP is the neighborhood size. It has small spatial support area, hence the bit-wise therein made between two single intensity value pixels is affected by noise. The next experiment was aimed to assess the radius size influence in texture classification. We present the classification performance of five LBP approaches with different radius .

Fig. 5 shows the classification performance comparison among five LBPs. In all cases the highest classification rate was achieved with . On the contrary, the increased size of the radius caused a poor classification rate starting from .

### 3.2 Noise

LBP approaches are very sensitive to noise specially when a small neighborhood is used. Since the amount of information associated to a pixel is not very large, even a small pixel value change due to noise could lead to a different LBP label. Fig. 6 presents the accuracy rate of LBPs under the influence of additive Gaussian noise using OD metric. In this experiment we used the USC-SIPI database described in the preceding section. Gaussian noise with and was added to the image database. This addition was implemented using Matlab imnoise function.

Since Gaussian noise affects the AR, LBP demands to use preprocessing denoising step or normalization stage in order to avoid noise artifact influence.

### 3.3 Illumination

Lighting variation is one of the major challenge for the current feature descriptors. Tan and Triggs (2010) presented a study of texture analysis under difficult lighting conditions and claims that LBP performance decreases almost exponentially under extreme illumination conditions. LBP by itself is not invariant to illumination changes and does not address the contrast of textures which is important in the discrimination. For this purpose, we are interested in combined LBP operators with a contrast information measure (CI), Eq. (18). However, CI produces continuous values which need to be quantized. Ojala et al. (1994) proposed to quantize contrast values so that all bins have an equal number of elements. So far, setting the number of bins is still an open issue.

LBP and CI histograms could be combined in two ways: jointly or hybridly, Guo et al. (2010a). In the first one, similar to 2D joint histograms, we can build a 3D joint histogram of them. In the second way, a large histogram is built by concatenating both LBP and CI histograms to form the so-called “pseudo joint histogram”.

(18) |

where are the neighbor pixels greater or equals than and are the neighbor pixels lesser that .

In the next experiment we performed classification of textures under different illumination conditions using the CUReT database.

As we expected, the AR achieved are lower that the results presented for rotational invariant analysis because LBP methodology is not illumination invariant. Nevertheless, CI improved the AR of almost every LBP methods using OD metric except for those methods based on uniform patterns, where their LBP histogram contains bins. In these cases, we need to apply other methodologies that are out of the scope of this study. On the contrary, in Fig. 7 CI decreases the classification performance. A possible explanation is that CI entropy influences negatively KL metric leading a misclassification.

The combination of LBP and CI performs well in the case of rotational cases too. For rotational invariant experiments, the AR of original using the USC-SIPI image database are and for OD and KL metrics respectively. However, the AR increased up to and for OD and KL metrics respectively by adding CI histograms.

## 4 Conclusions

LBP descriptors have been powerful tools for feature encoding. They have been successfully used in many different image analysis applications, in particular in the area of face recognition due to their excellent properties and computational simplicity. Since original LBP proposal has many limitations such as noise sensibility and it is affected by rotational transforms, a large number of extensions have been proposed. We have presented a LBP state of art for invariant and non-invariant rotational approaches. We evaluated the performance of several LBP algorithms proposed in the literature for texture classification. The results can be summarized into three groups: i) LBPs based on minimal chains: and compute a minimal chain. Their performance could be affected by noise because if a pixel intensity value is disturbed the final LBP label changes. ii) LBPs based on neighborhood values: Prior a LBP label computation, and perform a weighted average of neighboring pixels to minimize the effects of noise. iii) LBPs based on uniform values: , compute a uniformity measure prior LBP label computation which corresponds to the number of spatial transitions in the pattern. Since add extra information of non-uniform patterns into the LBP histogram it has a better texture classification performance than . Further work includes extending this techniques by applying a preprocessing stage based on Gabor filtering for increasing the robustness to illumination and noise degradations. Another extension will be based on the use of FPGAs to reduce the computational time.

## Acknowledgments

This work has been partially supported by the following UNAM grants: PAPIIT IN113611 and IXTLI IX100610 and by the Spanish Ministry of Science and Technology under projects TEC2010-20307 and TEC2010-09834-E.

## References

- (1) Brodatz, P., . USC-SIPI. http://sipi.usc.edu/database/database.php?volume=rotate. [Online; accessed 1-September-2011].
- Brodatz (1966) Brodatz, P., 1966. Textures; a photographic album for artists and designers. Dover, New York.
- Cha and Srihari (2002) Cha, S.H., Srihari, S.N., 2002. On measuring the distance between histograms. Pattern Recognition 35, 1355–1370.
- Dana et al. (1999) Dana, J.K., Van-Ginneken, B., Nayar, S.K., Koenderink, J.J., 1999. Reflectance and texture of real world surfaces. ACM Transactions on Graphics (TOG) 18, 1–34.
- (5) Dana, K., Van-Ginneken, B., Nayar, S., Koenderink, J., . CUReT. http://www.cs.columbia.edu/CAVE/software/curet/html/btfm.html. [Online; accessed 1-September-2011].
- Davis et al. (1979) Davis, L.S., Johns, S.A., Aggarwal, J.K., 1979. Texture analysis using generalized co-occurrence matrices. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-1, 251–259.
- Estudillo-Romero and Escalante-Ramirez (2011) Estudillo-Romero, A., Escalante-Ramirez, B., 2011. Rotation-invariant texture features from the steered Hermite transform. Pattern Recognition Letters 32, 2150–2162.
- Fu and Wei (2008) Fu, X., Wei, W., 2008. Centralized Binary Patterns embedded with image euclidean distance for facial expression recognition, in: 4th International Conference on Natural Computation, pp. 115–119.
- Guo et al. (2010a) Guo, Z., Zhang, L., Zhang, D., 2010a. A completed modeling of Local Binary Pattern operator for texture classification. IEEE Transactions on Image Processing 19, 1657–1663.
- Guo et al. (2010b) Guo, Z., Zhang, L., Zhang, D., Zhang, S., 2010b. Rotation invariant texture classification using adaptive LBP with directional statistical features, in: 17th IEEE International Conference on Image Processing (ICIP), pp. 285–288.
- Haralick (1979) Haralick, R.M., 1979. Statistical and structural approaches to texture. IEEE Proc. 67, 786–804.
- Huang et al. (2011) Huang, D., Shan, C., Ardabilian, M., Wang, Y., Chen, L., 2011. Local Binary Patterns and its application to facial image analysis: a survey. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 41, 765–781.
- Liao and Chung (2007) Liao, S., Chung, A., 2007. Face recognition by using Elongated Local Binary Patterns with average maximum distance gradient magnitude, in: Yagi, Y., Kang, S., Kweon, I., Zha, H. (Eds.), Computer Vision (ACCV). Springer Berlin / Heidelberg. volume 4844 of Lecture Notes in Computer Science, pp. 672–679.
- Liao et al. (2009) Liao, S., Law, M.W.K., Chung, A.C.S., 2009. Dominant Local Binary Patterns for texture classification. IEEE Transactions on Image Processing 18, 1107–1118.
- Liao et al. (2007) Liao, S., Zhu, X., Lei, Z., Zhang, L., Li, S., 2007. Learning Multi-scale Block Local Binary Patterns for face recognition, in: Lee, S.W., Li, S. (Eds.), Advances in Biometrics. Springer Berlin/Heidelberg. volume 4642 of Lecture Notes in Computer Science, pp. 828–837.
- Liu et al. (2011) Liu, L., Fieguth, P., Kuang, G., 2011. Generalized Local Binary Patterns for texture classification, in: Proceedings of the British Machine Vision Conference, BMVA Press. pp. 123.1–123.11.
- Ma and Zhu (2007) Ma, L., Zhu, L., 2007. Integration of the optimal Gabor filter design and Local Binary Patterns for texture segmentation, in: IEEE International Conference on Integration Technology, pp. 408–413.
- Ma (2011) Ma, Y., 2011. Number Local binary Pattern: an extended Local Binary Pattern, in: International Conference on Wavelet Analysis and Pattern Recognition (ICWAPR), pp. 272–275.
- Nanni et al. (2011) Nanni, L., Brahnam, S., Lumini, A., 2011. Survey on LBP based texture descriptors for image classification. Expert Systems with Applications .
- Nava et al. (2011) Nava, R., Escalante-Ramirez, B., Cristobal, G., 2011. A comparison study of Gabor and log-Gabor wavelets for texture segmentation, in: 7th International Symposium on Image and Signal Processing and Analysis (ISPA), pp. 189–194.
- Nguyen et al. (2009) Nguyen, H., Bai, L., Shen, L., 2009. Local Gabor Binary Pattern whitened PCA: a novel approach for face recognition from single image per person, in: Tistarelli, M., Nixon, M. (Eds.), Advances in Biometrics. Springer Berlin / Heidelberg. volume 5558 of Lecture Notes in Computer Science, pp. 269–278.
- Ojala et al. (1994) Ojala, T., Pietikainen, M., Harwood, D., 1994. Performance evaluation of texture measures with classification based on Kullback discrimination of distributions, in: Proceedings of the 12th International Conference on Pattern Recognition - Conference A: Computer Vision Image Processing (IAPR), pp. 582 –585 vol.1.
- Ojala et al. (2002) Ojala, T., Pietikäinen, M., Maenpaa, T., 2002. Multiresolution gray-scale and rotation invariant texture classification with Local Binary Patterns. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 971–987.
- Orjuela et al. (2011) Orjuela, S.A., Quinones, R., Ortiz-Jaramillo, B., Rooms, F., de Keyser, R., Philips, W., 2011. Improving textures discrimination in the Local Binary Patterns technique by using symmetry & group theory, in: 17th International Conference on Digital Signal Processing (DSP), pp. 1–6.
- Paget (2008) Paget, R., 2008. Texture modeling and synthesis, in: Mirmehdi, M., Xie, X., Suri, J. (Eds.), Handbook of Texture Analysis. Imperial College Press, pp. 33–60.
- Pietikäinen et al. (2011) Pietikäinen, M., Hadid, A., Zhao, G., Ahonen, T., 2011. Computer vision using Local Binary Patterns. volume 40. Springer. 1st edition, xv, 207 p. 87 illus., 56 in color edition.
- Pietikäinen et al. (2000) Pietikäinen, M., Ojala, T., Xu, Z., 2000. Rotation-invariant texture classification using feature distributions. Pattern Recognition 33, 43–52.
- Seetharaman (2009) Seetharaman, K., 2009. Texture analysis based on a family of stochastic models, in: IEEE International Conference on Signal and Image Processing Applications (ICSIPA), pp. 518–523.
- Tan et al. (2010) Tan, T., Zhang, M., Liu, F., 2010. Face recognition using Extended Local Binary Patterns and fuzzy information fusion, in: 7th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), pp. 625–629.
- Tan and Triggs (2010) Tan, X., Triggs, B., 2010. Enhanced local texture feature sets for face recognition under difficult lighting conditions. IEEE Transactions on Image Processing 19, 1635–1650.
- Tuceryan and Jain (1998) Tuceryan, M., Jain, A., 1998. Texture analysis, in: The Handbook of Pattern Recognition and Computer Vision, pp. 207–248.
- Wang and He (1990) Wang, L., He, D.C., 1990. Texture classification using texture spectrum. Pattern Recognition 23, 905–910.
- Zabih and Woodfill (1994) Zabih, R., Woodfill, J., 1994. Non-parametric local transforms for computing visual correspondence, in: Proceedings of the third European conference on Computer Vision (Vol. II), Springer-Verlag New York, Inc., Secaucus, NJ, USA. pp. 151–158.
- Zhang et al. (2005) Zhang, W., Shan, S., Gao, W., Chen, X., Zhang, H., 2005. Local Gabor Binary Pattern histogram sequence (LGBPHS): a novel non-statistical model for face representation and recognition, in: 10th IEEE International Conference on Computer Vision (ICCV), pp. 786–791 Vol. 1.
- Zhou et al. (2008) Zhou, H., Wang, R., Wang, C., 2008. A novel extended Local-Binary-Pattern operator for texture analysis. Inf. Sci. 178, 4314–4325.