Completed Grayscale-Inversion and Rotation Invariant Local Binary Pattern for Texture Classification

In this paper, we present a novel image representation approach for classifying emphysema in computed tomography (CT) images of the lung. Our proposed method extends rotation invariant uniform local binary pattern (RIULBP) and local ternary pattern (LTP), which are extensively used in a variety of computer vision applications, into rotation invariant uniform local ternary pattern (RIULTP) with a human perception principle: Weber's law. In addition, by integrating the upper pattern and the lower pattern of the Weber-based RIULTP (WRIULTP), we further put forward the joint Weber-based rotation invariant uniform local ternary pattern (JWRIULTP), which allows for a much richer representation and also takes the comprehensive information of the image into account. The proposed methods are tested on the Outex database (texture database) and the Bruijne and S⊘rensen database (emphysema database). The results show the superiority of the proposed approaches to the state-of-the-art techniques for emphysema classification including rotation invariant local binary pattern (RILBP) and texton-based approach.

More and more attention has been paid to the invariant texture analysis, because the training and testing samples generally have not identical or similar orientations, or are not acquired from the same viewpoint in many practical applications, which often has negative influences on texture analysis. Local binary pattern (LBP) has been widely applied to texture classification due to its simplicity, efficiency, and rotation invariant property. In this paper, an integrated local binary pattern (ILBP) scheme including original rotation invariant LBP, improved contrast rotation invariant LBP, and direction rotation invariant LBP is proposed which can effectively overcome the deficiency of original LBP that is ignoring contrast and direction information. In addition, for surmounting another major drawback of LBP such as locality which can result in the lack of shape and space expression of the holistic texture image, Zernike moment features are fused into the improved LBP texture features in the proposed method because they comprise orthogonal and rotation invariant property and can be easily and rapidly calculated to an arbitrary high order. Experimental results show that the proposed method can be remarkably superior to the other state-of-the-art methods when rotation invariant texture features are extracted and classified.

Application of local binary patterns in digital images to estimate botanical composition in mixed alfalfa–grass fields

SIFT (scale invariant feature transform) is one of the most robust and the widely used image matching algorithms based on local features. It has been used in the aspect of the cameras target matching. For its high complexity, this paper proposes a target matching method for multiple cameras by combining SIFT and the rotation-invariant LBP (local binary patterns). The object detection is obtained by improved Back-ground subtraction technique, and particle filter is used for region-based object tracking. The descriptor combining SIFT and the rotation-invariant LBP is calculated for every object region. The object matching is obtained by comparing the distance of feature matrix. Experimental results show that the proposed algorithm is more rapid than the standard SIFT algorithm while the performance is favorably compared to the standard SIFT algorithm, and it is robust in various scenes.

The major aim of this paper consists of a comprehensive quantitative evaluation of adaptive texture descriptors when integrated into an unsupervised image segmentation framework. The techniques involved in this evaluation are: the standard and rotation invariant Local Binary Pattern (LBP) operators, multichannel texture decomposition based on Gabor filters and a recently proposed technique that analyses the distribution of dominant image orientations at both micro and macro levels. These selected descriptors share two essential properties: (a) they evaluate the texture information at micro-level in small neighborhoods, while (b) the distributions of the local features calculated from texture units describe the texture at macrolevel. This adaptive scenario facilitates the integration of the texture descriptors into an unsupervised clustering based segmentation scheme that embeds a multi-resolution approach. The conducted experiments evaluate the performance of these techniques and also analyze the influence of important parameters (such as scale, frequency and orientation) upon the segmentation results.

The local binary pattern (LBP) and its variants have shown the effectiveness in texture images classification, face recognition, and other applications. However, most of these LBP methods only focus on the histogram of LBP patterns and ignore the spatial contextual information between LBP patterns. In this paper, we propose a 2D-LBP method which uses a sliding window to count the weighted occurrence number of the rotation invariant uniform LBP pattern pairs to obtain the spatial contextual information. The multi-resolution 2D-LBP features can also be obtained when the radius of 2D-LBP is changed. At last, a two-stage classifier which acts as an ensemble learning step is followed to achieve an accurate classification by combining the predictions on each 2D-LBP with single resolution. Theoretical proof shows that the proposed 2D-LBP is a general framework and can be integrated on other LBP variants to derive new feature extraction methods. Experimental results show that, the proposed method achieves 99.71%, 97.09%, 98.48%, and 49.00% classification accuracy on the public “Brodatz,” “CUReT,” “UIUC,” and “FMD” texture image databases, respectively. Compared with the original LBP and its variants, the proposed method obtains higher classification accuracy under different cases, and simultaneously owns shorter time complexity.

This paper presents an analysis of the statistical texture representation of the Local Binary Pattern (LBP) variants in the classification of wood defect images. The basic and variants of the LBP feature set that was constructed from a stage of feature extraction processes with the Basic LBP, Rotation Invariant LBP, Uniform LBP, and Rotation Invariant Uniform LBP. For significantly discriminating, the wood defect classes were further evaluated with the use of different classifiers. By comparing the results of the classification performances that had been conducted across the multiple wood species, the Uniform LBP was found to have demonstrated the highest accuracy level in the classification of the wood defects.

In this paper, rotation invariant local binary pattern and local contrast measure have been joined together for describing the texture feature. In addition to this, colour features have also been included in the feature vector of the object tracking algorithm. Thus the texture can be characterised by two orthogonal properties like, the spatial structure local binary pattern and the strength of the pattern contrast. Covariance matrix of the feature vector has been taken as the object descriptor in the proposed algorithm. The performance of the proposed method has been compared by different performance measures, such as the detection rate, tracking speed and coverage test. The proposed method has also been tested for various challenging situations, such as occlusion, camera motion, non-rigidity, and changes in illumination. The experimental results show that the proposed method outperforms the existing methods in terms of performance indices.

Scene classiflcation is an appealing and challenging problem in image processing and machine vision. Recently, Bag-of-visual-words (BOVW) method using pyramid matching scheme has shown remarkable performance for scene classiflcation. But this method deriving from local keypoints does not contain texture features which are rich in scene images. To further improves the classiflcation accuracy, this paper presents a new method combining Rotation Invariant Local Binary Patterns (RILBP) texture features and BOVW model in spatial pyramid matching framework. First, scene image is subdivided at difierent resolutions for constructing a spatial pyramid. Then based on scale invariant feature transform descriptor and K-means clustering, Pyramid Histogram of visual Words (PHOW) is extracted. And RILBP texture feature is extracted using the mean of a 3*3 neighborhood as threshold. Last we construct a composite kernel of spatial pyramid matching. We regard the keypoint features and texture features as two independent feature channels, and combine them to realize scene classiflcation using one-against-rest SVMs with the composite kernel. Experiments results on the three difierent scene datasets show that our method is efiective.

This study addresses the classification problem of the HEp-2 cell using indirect immunofluorescent (IIF) image analysis, which can indicate the presence of autoimmune diseases by finding antibodies in the patient serum. Generally, the method used for IIF analysis remains subjective, and depends too heavily on the experience and expertise of the physician. Recently, studies have shown that it is possible to identify the cell patterns using IIF image analysis and machine learning techniques. However, it still has large gap in recognition rates to the physical experts' one. This paper explores an approach in which the discriminative features of HEp-2 cell images in IIF are extracted and then, the patterns of the HEp-2 cell are identified using machine learning techniques. Motivated by the progress in the research field of computer vision, as a result of which small local pixel pattern distributions can now be highly discriminative, the proposed strategy employs a parametric probability process to model local image patches (textons: microstructures in the cell image) and extract the higher-order statistics of the model parameters for the image description. The proposed strategy can adaptively characterize the microtexton space of HEp-2 cell images as a generative probability model, and discover the parameters that yield a better fitting of the training space, which would lead to a more discriminant representation for the cell image. The simple linear support vector machine is used for cell pattern identification because of its low computational cost, in particular for large-scale datasets. Experiments using the open HEp-2 cell dataset used in the ICIP2013 contest validate that the proposed strategy can achieve a much better performance than the widely used local binary pattern (LBP) histogram and its extensions, rotation invariant co-occurrence LBP, and pairwise rotation invariant co-occurrence LBP, and that the achieved recognition error rate is even very significantly below the observed intralaboratory variability.

Facial expression which carries rich information of body behavior is the leading carrier of human affective and the symbol of intelligence. The main purpose of this paper is to recognize 3D human facial expression. The research in this paper includes the expression feature extraction algorithm and fusion with different kinds of feature. To contain more local texture feature information, we proposed a new feature of 3D facial expression named Local Threshold Binary Pattern (LTBP) which based on Local Binary Pattern (LBP). We calculate the difference of gray value standard between neighboring pixels and the center pixel as a threshold to binary instead of the traditional LBP operation which only comparison of size between neighboring pixels and the center pixel. After we get the LTBP feature, we fuse the LTBP and HOG (Histogram of Oriented Gradient) features to get multi-feature fusion for 3D facial expression recognition. Our algorithm of 3D facial expression recognition comprises three steps: (1) extracting two sets of feature vectors and establishing the correlation criterion function between the two sets of feature vectors; (2) solving the two sets canonical projective vectors and extracting their canonical correlation features by the framework of canonical correlation analysis algorithm; (3) doing feature fusion for classification by using proposed strategy. We have performed comprehensive experiments on the BU-3DFE database which is presently the largest available 3D face database. We have achieved verification rates of more than 90% for the 3D facial expression recognition.

To enhance the weakness of Local Binary Pattern (LBP) and its state-of-the-art variants, this letter presents a new variant of the local concave microstructure pattern (LCvMSP). The proposed multi-scale shape index based texture descriptor is named as SI-LCvMSP. Contrarily to the original LBP and LCvMSP, SI-LCvMSP uses the shape index instead of the original texture image in the kernel function. The shape index is a differential calculation and it can be calculated from local second-order derivatives of texture images. It captures microstructure and macrostructure texture information mathematically. As textural features, we use multi-scale and multi-resolution shape index information as well as rotation-invariant uniform LBP. Thus, we obtain the discriminative feature representation schema to construct cross-scale joint coding. The proposed method has a high discriminability and is less sensitive to image transforms such as rotation and illumination. Experimental results show that the SI-LCvMSP descriptor can improve classification accuracy.

Local binary pattern (LBP) is a well-defined operator and it has been widely used in texture description. By representing a local region with its center pixel and local difference vector, LBP just encodes the sign component of this difference vector. This paper presents an operator, which efficiently encodes the magnitude part of local difference, as a complementary to LBP. We combine the sign and magnitude component of image local difference vectors, by making the joint distribution of LBP and presented magnitude based features. It has been experimentally demonstrated that, considerable improvement can be made for rotation invariant texture classification, in comparison with recently proposed completed LBP (CLBP) method.

Constructing a change magnitude map (CMM) is a key component of binary change detection. Recently, integrating multiple features to obtain a comprehensive CMM has become a popular research topic. However, the current integration approaches mainly utilize simple spectral CMMs that are derived based on a single spectral change index (e.g. image difference, Euclidean distance, and change vector analysis), which is not sufficient for addressing complex land cover changes. In this study, we propose a spectrally enhanced multi-feature fusion (SeMF) method with CMM integration for effective change detection. Seven commonly used spectral change indices are analysed from the aspects of the spectral value and spectral shape; two of these indices are selected to construct the optimal spectral-based CMM, which is more efficient, robust and stable than the single spectral change indices. The rotation-invariant local binary patterns (RiLBP) and Canny methods are further used for CMM generation via the textural and shape features, respectively. These three types of CMMs are adaptively assigned weights by using an information entropy-based fusion strategy and ultimately integrated into a comprehensive CMM. Two groups of experiments with Landsat 8 Operational Land Imager (OLI) and Gaofen (GF)-1 images are designed to verify the effectiveness of the SeMF method. The experimental results indicate that the SeMF method is superior to both spectral feature-based and multi-feature-based change detection methods.

This paper proposes a novel approach in image compression based on Local Binary Pattern (LBP). LBP has already been used as a simple texture descriptor, labeling the image pixels by looking at the points surrounding a central point (usually on a 3×3 neighborhood) and examining whether these neighbors' color values are greater or less than the central point and accordingly assigning a binary value to the corresponding bit. The description of image's local pattern results in an eight-bit binary description, but in order to restore the image from such a LBP description, the value of each central pixel is also needed. These two pieces of information, i.e. the LBP description and the actual original value for each local neighborhood central pixel, are stored in a newly proposed Local Binary Compressed format, denoted .LBC, from which the image can be reconstructed by employing statistical methods, i.e. generating smaller or larger sets of random numbers to fill in the missing information within each local neighborhood, based on the LBP descriptor. Two statistical distributions were tested and, apart from the compression performance, a Structural Similarity Index Metric was used to evaluate the results.