{'fraction_non_alphanumeric': 0.031306026754930355, 'fraction_numerical': 0.02050291913759022, 'mean_word_length': 4.442581936452339, 'pattern_counts': {'":': 0, '<': 1, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 7, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Classification of Textures based on Noise Resistant Fundamental Units of Complete Texton Matrix

One of the popular descriptor for texture classification is the local binary pattern (LBP). LBP and its variants derives local texture features effectively. This paper integrates the significant local features derived from uniform LBPs(ULBP) and threshold based conversion factor non-uniform (NULBP) with complete textons. This integrated approach represents the complete local structural features of the image. The ULBPs are proposed to overcome the wide histograms of LBP. The ULBP contains fundamental aspects of local features. The LBP is more prone to noise and this may transform ULBP into NULBP and this degrades the overall classification rate. To addresses this, this paper initially transforms back, the ULBPs that are converted in to NULBPs due to noise using a threshold based conversion factor and derives noise resistant fundamental texture (NRFT) image. In the literature texton co-occurrence matrix(TCM) and multi texton histogram (MTH) are derived on a 2x2 window. The main disadvantage of the above texton groups is they fail in representing complete textons. In this paper we have integrated our earlier approach “complete texton matrix (CTM)” [16] on NRFT images. This paper computes the gray level cooccurrence matrix (GLCM) features on the proposed NRFCTM (noise resistant fundamental complete texton matrix) and the features are given to machine learning classifiers for a precise classification. The proposed method is tested on the popular databases of texture classification and classification results are compared with existing methods.

Texture provides a significant and impressive cue about the physical information of object surfaces, however there is no unique definition for texture. The texture classification methods can be categorized into: spectral, statistical, model-based, structural and learning based approaches [27]. The statistical, structural or spectral methods are the oldest texture measures that are used for texture classification [28,29]. They have attained good results for simple classification tasks, however they are complex in nature and are unable to solve the general problems of natural material representation and recognition under varying lighting and viewing conditions. To overcome this present paper integrated structural features of textures in terms of ULBP and textons with GLCM and this has resulted in significant improvements in texture classification. The Model-based methods [30,31] are not widely used for image classification. The learning based methods like texton dictionary [32][33][34] and Bag-of-Features (BoF) framework [35] require a representation and learning stage to derive the feature vector of the image. The Bagof-Words (BoW) [32,33,35,37,38] approach has become very popular and successful in texture Copyright © 2018 MECS I.J. Image, Graphics and Signal Processing, 2018, 2, 43-51 classification tasks. The BOW represents the texture image statistically as histograms over a discrete texton dictionary. The local descriptors play a vital role In BOW, and that is the reason they have received considerable attention [32,33,37,38] in these years. The local approaches are generally grouped in to sparse and dense type approaches. The sparse approach uses appearance descriptors as a sparse set of interested points and the popular descriptors of this model include SPIN, SIFT and RIFT [38,39]. The dense approaches use appearance descriptors i.e., pixel by pixel [32,33,37,38]. The interested points of a sparse set of local or region detectors sometimes miss important texture primitives and thus may not result a robust classification. The popular dense descriptors are the filter bank of Leung and Malik [37], Gabor filters [1], the MR8 [32], the filter bank of Schmid [36,37] and many others. The design of a filter bank is nontrivial and likely to be application dependent. The supremacy of filter bank-based descriptors has been challenged by several authors in the literature [33,40]. A superior classification than filter banks are achieved by the authors [33,40] by considering the local intensity differences or local patches. In this regard sparse modeling of local texture patches are proposed in the literature, however it is time consuming [40]. The simple, elegant and efficient local texture descriptor LBP [41] is particularly an important work in this direction. The LBP uses a pre-defined texton dictionary and does not need to use nearest neighbor to obtain the texton labels, a time consuming step. The term texton on a neighborhood is defined by the adjacent elements, of a grid, with the same pixel value and it was proposed by Julesz [42]. With the help of textons, one can define complex structures with simple primitives. Texture is also described in terms of microprimitives (textons) and their statistical placement rules. The texton co-occurrence matrices (TCM) [43] and MTH [14] describe the spatial correlation of textons for image retrieval. The TCM and MTH describe the partial correlation because they define only few textons with similar intensities on a 2 x 2 grid. To addresses this, in our earlier work [16], we have proposed complete texton matrix (CTM) [16] that defines all possible, eleven textons of a 2 x 2 grid. The CTM approach achieved a better classification than TCM and MTH. The present paper integrates the color, fundamental units of texture, noisy patens (NULBP) that are closer to ULBP, and shape features. And this paper, derives noise resistant fundamental complete texton matrix (NRFCTM) to describe image features for a precise texture classification.
The rest of this paper is organized as follows. In Section 2, the proposed NRFCTM is presented, with a brief discussion on LBP, ULBP, TCM, MTH and CTM concepts. In Section 3, results, discussions and performance comparisons with other methods is carried out under various natural databases. Section 4 concludes the paper.

A. Local binary pattern (LBP)
The popularly used local texture descriptor by many researchers in different applications of image and video processing is the local binary pattern (LBP) introduced by Ojala [2]. The LBP achieved its popularity because it is simple, effectual and grey scale invariant texture primitive. The LBP measures effectively and precisely the local attributes of the neighborhood thus derives a local structure. The LBP operator is initially defined on a 3×3 neighborhood or second order neighborhood around the centre pixel Z c (Fig.1). The LBP estimates the neighboring pixels using bilinear interpretation on the circle of radius of R around Zc (Fig.1). Later it is also extended to the third order neighborhood. Thus the local gray level structure is summarized more precisely by LBP around the centre pixel Z c . The LBP code on a 3x3 neighborhood with 8 neighboring pixels i.e. N= 8 and over a radius R=1 around Z c is computed by equation 1.
Where z c is the centre pixel, z i is the neighboring pixel and N is the total number of neighboring pixels. The LBP N,R derives the unique codes or histogram of 2 N bins. The major factors for considering LBPs in many applications is, invariant to monotonic intensity changes. Hence it is robust to illumination and contrast variations. LBP is sensitive to noise and small pixel fluctuations.

B. Uniform LBP
The basic LBP produces an eight bit patterns i.e. LBP code ranges from 0 to 2 N -1 i.e. directly proportional to number of neighborhood pixels 'N' considered, but not on R. Considering such a huge number of patterns especially when combing these structural representative codes with statistical measures such as GLCM and textons may become a complex and monotonous task. Later it is found that most of the LBPs are not playing a significant role in image classification and analysis and this has made to derive the significant patterns among LBPs. The significant and fundamental patterns of LBP are identified based on the number of transitions from 0 to 1 or 1 to 0 and they are named as Uniform LBP (ULBP). This will reduce the width of the LBP histogram and thus reduces the overall complexity. The ULBP represents the basic fundamental structural information such as borders, corners, lines and edges. If the LBP results 0 or 2 circular transitions from 1 to 0 or 0 to 1, then such patterns are named as ULBPs and rest of the patterns are NULBP's. The NULBP are treated as noisy patterns. There will be either 0 or 2 or 4 or 6 or 8 circular transitions from 0 to 1 or 1 to 0 on 3 x 3 LBP. The following are noted from a 3 x 3 LBP neighborhood: There will be 58 (N * (N-1) +2) different ULBPs. The ULBPs are assigned a unique index code since they represent most significant information. Interestingly the representations of ULBPs are only 22.66% of total LBP codes. However ULBP accounts more than 85% of windows in texture [44] and in facial images [45] and the remaining are NULBPs. That's why ULBPs are statistically more significant and NULBPs are not.
The numbers of NULBP are 198 (256-58) on a window with 8-neighboring pixels i.e. they constitutes 77.34% of total LBP codes; However their appearance in the textures is very poor (less than 10% of the windows generate NULBS). That is the reason researchers considered NULBP's as miscellaneous;

C. Conversions of noisy ULBPs in to ULBPS (NULBPS that are closer to ULBPs)
Some researchers [46,47,48] argued and proved that by considering a subset of NULBPS along with ULBPs increased the overall performance. The authors concatenated the derived subset of NULBPs with ULBPs for classification purpose and achieved a little improvement when compared to ULBP. The main disadvantage of the above methods is they have not considered the noise factor in deriving the sub sets of NULBPs. The basic disadvantage is, a small fluctuation of noise may convert a ULBP in to a NULBP ( Fig. 2 and 3) and this degrades the overall performance of the above methods. The main reason for this is the LBP and other neighborhood approaches make use of the sign of pixel differences to compute its code and that's why they are more vulnerable to noise when they are small ( Fig. 2 and  3). Further more than 90 % of the texture image windows are uniform patterns, which indicate there are more number of chances for ULBPS to be converted in to NULBPS due to small fluctuation of noise. If more than 4 % ULBPs are transformed in to NULBPs (fundamental information is transformed in to miscellaneous) by random or any other noise then overall classification rate will be degraded, even though if one considers a sub set of NULBPs. To overcome this present paper derived a threshold 't' and conversion factor 'c' for a NULBP window. By this the NULBP which is very closer to ULBP are transformed in to ULBP. The proposed NRFT image, initially identifies the floating pixels of a NULBP window. A neighboring pixel of a NULBP is treated as a floating pixel if the absolute grey level intensity of the centre pixel Z c and neighboring pixel Z i falls within the range of threshold 't' and such windows are treated as floating windows. A floating window may be transformed into ULBP, by complementing one or 'c' number of floating pixels starting from least significant bit (LSB) position.
The neighboring pixels that differs with centre pixel widely (in terms of grey levels) will have no effect by random noise in the formation of binary patterns i.e. formation of ULBP's ( Fig. 3(b)) the neighboring pixels with green color); however if the difference (d) of grey levels is minimum i.e.( d <= t ), the noise may transform a ULBP into NULBP ( Fig. 3(b), the neighboring pixels with red color). The proposed NRFT scheme, applies threshold only to NULBP windows and determines the floating bits and try to transom it into ULBP if possible. A floating window may be transformed into uniform window (ULBP) by complementing one or more floating bits, given by 'c', from least significant bit (LSB), thus the code variation is least. The Fig. 3 will be converted into ULBP for a threshold value t=2 and for a maximum conversion factor c=2. In Fig. 3(b) the floating bits /pixels are shown in red color. The intensity values of the pixels with green color are also changed due to noise; however they have no effect in the transformation process of NULBP.

D. Complete Texton Matrix (CTM) Approach
The pixel based methods are not popular in image processing applications because they could not define neither local nor regional properties of a texture. The term texture defines a neighboring property: the value of a pixel at location (x,y) not only depends upon the value of the pixel at that location but also depends upon the neighboring pixel values surrounded by that pixel. Pattern based methods are also popular in the image processing. A pattern is generally formed based on some similarities with the neighboring pixels. The definition of a texton is based on the similarities with the neighboring pixels of a grid or region. Thus the textons have close relationship between the image attributes. I.J. Image, Graphics and Signal Processing, 2018, 2, 43-51 In literature TCM [43] and MTH [14] are popular methods based on textons. They have not defined complete set of textons. In our earlier work [16], we have listed out all possible number of textons on a 2 x 2 grid and based on this we have derived complete texton matrix [43]. All the three methods defined textons on a 2 x 2 grid. The CTM defined the total number of available textons on a 2 x 2 grid i.e. the textons with two, three and four pixels of exactly the similar grey level values. The CTM [16] has defined the following 11 textons i.e. complete range of textons on 2 x 2 grid with four pixels {v 1 , v 2 , v 3 , v 4 } as shown in Fig.4. The texton T 1 will be formed if all four pixels in the 2 x 2 grid exhibit exactly the similar values. The textons T 2 , T 3 , T 4 and T 5 will be resulted if any of the three pixels of the 2x 2 grid shows the same intensity value. The textons T 6 , T 7 , T 8 , T 9 , T 10 and T 11 will be formed if and only if any two pixels of 2 x 2 grid exhibits the same intensity values. The TCM defined only six types of texton of CTM i.e... T 1 , T 2 , T 3 , T 4 , T 5 and MTH approach only defined four types of texton types T 6 , T 7 , T 8 and T 9 . The following process is used by CTM in detecting textons on a 2 x 2 grid: Step 1: If the (texton type == T 1 ) (the four pixels with similar values) then go to step 4.
Step 2: if ( texton type == ( T 2 or T 3 or T 4 or T 5 ) then assign zero value to the pixel that is not part of the texton type . And go to step 4.
Step 3: if ( texton type == ( T 6 or T 7 or T 8 or T 9 or T 10 or T 11 ) then assign zero value to the pixels that are not part of the texton type. And go to step 4.
Step 4: Consider the next 2 x 2 grid with a step length of 2. And repeat the process from step one on entire image.
In the above process the step 1, 2, 3 verifies for the texton on a 2 x 2 grid with four, three and two similar values of pixels respectively. This process overcomes the ambiguity. That is for example CTM identifies texton type 1 if all four pixels have similar intensities, instead of other texton types. The advantage of CTM over TCM is, TCM only detects the texton types of three or four pixels of similar values and computes the textons with a step length of 1. This process is time consuming and fails in representing textons when two pixel values are of similar values. The MTH recognizes only few texton types with two similar values on a 2 x 2 grid (T 6 , T 7 , T 8 , T 9 ) and this creates an ambiguity especially when one wants to represent the 2 x 2 grid with texton indexes, as shown in Fig.5. In Fig.5 the MTH completely fails in identifying texton types with two identical values i.e. T 10 and T 11 and assigns entire grid a value zero. The reason for this is the MTH is not defined the texton type T 10 and T 11 . Further if one wants represent the 2 x 2 grid with texton indexes the MTH creates an ambiguity either to represent with T 6 or T 9 as shown in Fig.6. The CTM [16] and TCM [43] will have unique index on this as shown in Fig.6.
The working mechanisms of MTH [14], TCM [43] and CTM [16] for the image neighborhood of 8x8 of Fig.7 are given in Fig.8, 9 and 10 respectively.
ASM is a measure of homogeneity of an image. A homogeneous scene will contain only a few grey levels, giving a GLCM with only a few but relatively high values of P (i, j ). Thus, the sum of squares will be high. Energy : Contrast : This measure of contrast or local intensity variation will favor contributions from P (i, j) away from the diagonal, i.e. i ! = j. Correlation: Correlation is a measure of grey level linear dependence between the pixels at the specified positions relative to each other.
The proposed NRFCTM is different from CTM of our earlier approach. In CTM the grey level range of image is quantized or partitioned in to 'n' groups, without any significance or without any predefined criteria. In NRFCTM the image grey levels are is quantized based on significant attributes of textures, i.e. the image is indexed with fundamental units without any noise (0 to, 58, where 0 is assigned to all NULBPS). The noise part is taken care by the threshold 't' on NULBP. Further this paper derived GLCM on NRFCTM. The size of NRFCTM is 59 x 59. The NRFCTM can express the spatial correlation of textons and has the discrimination power of texture, color, and shape features. Color and texture have close relationship via fundamental micro-structures in natural images.
The Brodtaz database consists of gray level images and the other databases contain color images (mostly in RGB). The images of these databases are captured under varying lighting, illumination and other conditions with varying sizes. Each database consists of various classes and each class consists of various images. We selected 30 different texture images with a 512x512 pixels size from the Brodtaz database. The sample images are show in Fig.11. We divided each image into 16 non-overlapped texture images of size 128x128 and this results a dataset of 480 images (30x16). The present study used 60 images for training purpose (two images from each class). The remaining 420 texture images (14 texture images per class) are used for testing purpose.   The sample images of UIUC database are shown in Fig.13. This database includes 25 classes and each class consists of 40 images resulting a total of 1000(25x40) texture images. The size of each image is 640x480. The present paper considered one texture image from each class and partitioned it into 15 non-overlapped images of size 128x128. This results a total of 375 (25x15) images and out of this 50 images (2 images from each class) are used for training purpose and reaming 325 images (25x13) are used for test purpose.
The average classification rate of each texture dataset on the proposed NRFCTM descriptor using Liblinear, LibSVM classifiers and Naivebayes classifiers with different d values are given in Table 1(a) and 1(b) respectively. The last row of Table 1(a) and 1(b) gives the average classification rate. All the classifiers exhibited a slightly high classification rate for d value 2 followed by 3 and 4. The liblinear and lib SVM classifiers on the proposed method exhibited more or less the similar average classification rate on all considered databases and there is hardly 1 % of difference. In the rest of the paper, the classification rate of SVM classifier for'd' value =2 is considered on the proposed NRFCTM descriptor.   [52] and LTP [6] descriptors and moderate for CLBP-SMC [53], TCM [43] and MTH [14] this may be due to lot of orientation and scale changes in UIUC database. The proposed descriptor achieved high classification rate. This clearly indicates the NRFCTM outperformed other methods because it integrated the merits of ULBP, noisy ULBP and CTM to capture more spatial information to increase the classification accuracy. The classification rate on all four databases using the proposed and other descriptors is plotted in Fig.14 and following are noted.
1. The performance of ULBP and LTP are too low on Brodtaz textures when compared to other three texture databases. Out of these two, ULBP has shown low performance.
2. The classification rate of all descriptors is little low on Brodtaz textures around 85% to 90%, however the NRFCTM have achieved a classification rate around 95%.
3. The performance of all descriptors is high on Outex database when compared to Brodtaz and UIUC databases.
4. The performance of NRFCTM is very high on all databases followed by other descriptors MTH, CLBP-SMC, TCM, LTP and ULBP.

IV. CONCLUSION
In this paper we have integrated ULBP, noisy ULBP with CTM and derived NRFCTM descriptor. GLCM features are derived on NRFCTM to describe image features that represent both the spatial correlation of texture orientation and texture color based on textons for efficient texture classification. The present paper derived NRFCTM with different values of d and with different rotations. The dimension of NRFCTM is 59 X 59. The present method exhibited high classification rate because i) due to the consideration of ULBP ii) by transforming back the ULBPS that are effected by noise i.e., a subset of NULBPs that are closer to ULBPs iii) by considering the complete set of textons on a 2 x 2 grid instead of partial and ambiguous texton sets iv) by deriving GLCM features. The experimental results on all considered databases validated that our methods has strong discrimination power of color, texture and shape features, and outperforms other LBP based methods.