Local multiple patterns based multiresolution gray-scale and rotation invariant texture classification

2010 17th IEEE International Conference on Image Processing, ICIP 2010, Hong Kong, 26-29 September 2010

The Local Binary Pattern (LBP) and its variants are capable of extracting image texture and have been successfully applied to classification. However, LBP has not been used to extract and describe the texture of polarized images, and simple LBP cannot characterize the polarized texture information from different polarizations of angles. In order to solve these problems, we propose a new multi-angle orthogonal difference polarization image texture descriptor (MODP_ITD) by analyzing the relationship between the difference of orthogonal difference polarization images from different angles and the pixel intensity distribution in the local neighborhood of images from different angles. The MODP_ITD consists of three patterns: multi-angle polarization orthogonal difference local binary pattern (MODP_LBP), multi-angle polarization orthogonal difference local sampling point principal component sequence pattern (MODP_LPCSP) and multi-angle orthogonal difference polarization local difference binary pattern (MODP_LDBP). The MODP_LBP extracts local corresponding texture characteristics of polarized orthogonal difference images from multiple angles. The MODP_LPCSP sorts the principal component order of each angle orthogonal difference local sampling point. The MODP LDBP extracts the local difference characteristics between different angles by constructing a new polarized image. Then, the frequency histograms of MODP_LBP, MOD_LPCSP ,and MODP_LDBP are cascaded to generate MODP_ITD, so as to distinguish local neighborhoods. By using vertical and parallel polarization and unpolarized light active illumination, combined with the measurements at three different detection zenith angles, we constructed a polarization texture image database. A substantial number of experimental results on the self-built database show that our proposed MODP_ITD can represent the detailed information of polarization images texture. In addition, compared with the existing LBP methods, The MODP_ITD has a competitive advantage in classification accuracy.

Local Binary Pattern (LBP) has achieved great success in texture classification due to its accuracy and efficiency. Traditional LBP method encodes local features by binarying the difference in local neighborhood and then represents a given image using the histogram of the binary patterns. However, it ignores the directional statistical information. In this paper, some directional statistical features—including the mean and standard deviation of the local absolute difference—are integrated into the feature extraction to improve the classification ability of the extracted features. In order to reduce estimation errors of the local absolute difference, we further utilize the least square estimate technique to optimize the weight and minimize the local absolute difference, which leads to more stable directional features. In addition, a novel rotation invariant texture classification approach is presented. Experimental results on several texture and face datasets show that the proposed approach significantly improves the classification accuracy of the traditional LBP.

A rapid growth in medical ultrasound database makes it difficult for medical practitioners to manage and search relevant data with good efficiency. Hence, a novel image retrieval technique using Mean Distance Local Binary Pattern (Mean Distance LBP) has been proposed for content-based image retrieval. The conventional local binary pattern (LBP) converts every pixel of image into a binary pattern based on their relationship with neighbourhood pixels. The proposed feature descriptor differs from local binary pattern as it transforms the mutual relationship of all neighbouring pixels in a binary pattern based on their standard deviation templates as well as Euclidean distance from the center pixel. Color feature and Gray Level Co-occurrence Matrix have also been used in this work. To prove the excellence of the proposed method, experiments have been conducted on two different databases of natural images and face images. Further, the method is applied on real time ultrasound database for retrieval of liver images from a set of ultrasound images of various organs. The performance has been observed using well-known evaluation measures, precision and recall, and compared with some state-of-art local patterns. Comparison shows a significant improvement in the proposed method over existing methods.

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.

Texture classification algorithms using local binary pattern (LBP) and its variants usually can achieve attractive results. However, the selected rotation invariant structural patterns in numerous LBP variants are not absolutely continuous invariant to any rotation angle. To improve the classification effectiveness on this occasion, in this paper, we introduce a robust descriptor based on the principal curvatures (PCs) and rotation invariant version of CLBP_Sign operator in completed LBP (CLBP), namely PC-LBP. Different from the original LBP and many LBP variants, PCs are employed in this paper to represent each local structure information due to their continuous rotation invariance. Simultaneously, both micro-and macro-structure texture information can also be captured through PCs, which comprise maximum and minimum curvatures. Inspired by the similar coding strategy of the CLBP_Sign operator, a new operator CLBP_PC is developed. By exploiting complementary information resulting from the two operators combination, the final PC-LBP descriptor has the properties of conspicuous rotation invariance, strong discriminativeness, gray scale invariance, needless of pretraining, and high computational efficiency. In addition, to improve the robustness of texture classification with multiresolution, a multiscale sampling approach is designed by adjusting three parameters accordingly. Experimental results demonstrate that the proposed multiresolution PC-LBP approach achieves comparable performance or outperforms a large number of state-of-the-art methods. Impressively, the classification accuracy of the proposed method performed on Outex_TC_00010 test suite is 100%.

Texture classification generally requires the analysis of patterns in local pixel neighborhoods. Statistically, the underlying processes are comprehensively described by their joint probability density functions (jPDFs). Even for small neighborhoods, however, stable estimation of jPDFs by joint histograms (jHSTs) is often infeasible, since the number of entries in the jHST exceeds by far the number of pixels in a typical texture region. Moreover, evaluation of distance functions between jHSTs is often computationally prohibitive. Practically, the number of entries in a jHST is therefore reduced by considering only two-pixel patterns, leading to 2D-jHSTs known as cooccurrence matrices, or by quantization of the gray levels in local patterns to only two gray levels, yielding local binary patterns (LBPs). Both approaches result in a loss of information. We introduce here a framework for supervised texture classification which reduces or avoids this information loss. Local texture neighborhoods are first filtered by a filter bank. Without further quantization, the jPDF of the filter responses is then described parametrically by gaussian mixture models (GMMs). We show that the parameters of the GMMs can be reliably estimated from small image regions. Moreover, distances between the thus modelled jPDFs of different texture patterns can be computed efficiently in closed form from their model parameters. We furthermore extend this texture descriptor to achieve full invariance to rotation. We evaluate the framework for different filter banks on the Brodatz texture set. We first show that combining the LBP difference filters with the GMM-based density estimator outperforms the classical LBP approach and its codebook extensions. When replacing these-rather elementary-difference filters by the wavelet frame transform (WFT), the performance of the framework on all 111 Brodatz textures exceeds the one obtained more recently by spin image and RIFT descriptors by Lazebnik et al.

A Novel Texture Classification Scheme based on Completed Multiple Adaptive Threshold Patterns

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.

This paper proposes a novel face representation approach, local Gabor binary mapping pattern (LGBMP), for multi-view gender classification. In this approach, a face image is first represented as a series of Gabor magnitude pictures (GMP) by applying multi-scale and multi-orientation Gabor filters. Each GMP is then encoded as a LGBP image where a uniform local binary pattern (LBP) operator is used. After that, each LGBP image is divided into non-overlapping rectangular regions, from which spatial histograms are extracted. Although an LGBP feature vector can be obtained by fitting together the regional histograms, it can not be employed in pattern classification due to its high dimension. We propose that each regional LGBP feature be mapped onto a one-dimensional subspace independently before they are concatenated as a whole feature vector. This is attractive since we reduce the feature dimension and also preserve the spatial information of LGBP image. Two ways have been proposed to map the regional LGBP feature in this paper. One is so-called LGBMP-LDA using linear discriminant analysis (LDA) for dimensionality reduction while the other is to project the regional LGBP feature onto the class center connecting line, namely, LGBMP-CCL. As a result, despite several decades of Gabor filters, the final feature dimension is even less than that of the feature extracted by using LBP directly on gray-scale images. The classification tasks in our work are performed by support vector machines (SVM). The experimental results on the CAS-PEAL face database indicate that the proposed approach achieves higher accuracy than the others such as SVMs+Gray-scale pixel, SVMs+Gabor and SVMs+LBP approach, more particularly, it has the lowest dimension of feature vector.

Local feature descriptor plays a significant role in texture classification. However, in the traditional local binary pattern method, image pixels are converted into a binary pattern based on the relationship between center and neighborhood pixels. This paper introduces a novel feature extraction method named local neighbourhood edge responsive binary pattern to extract and categorize reliable texture features from images for achieving an automated classification of different types of ocean bottom sediments. Initially, the basic magnitude variance pixel values are derived depending on an odd and even pixel value of a 3 × 3 image patch. Further, the edge information is extracted using the local directional pattern method from all images. The edge response of the image is obtained using a kirsch mask in all eight directions. The encoding condition is then applied to both the local intensity and the edge information to create a unique descriptor value. Finally, a new learning algorithm called GMJAYA-ELM combines the Gaussian mutated JAYA (GMJAYA) with an extreme learning machine (ELM) for texture classification. The GMJAYA is used to optimize the input weights and hidden biases of single-hidden-layer feed-forward neural networks. Experimental findings indicate that the suggested method yields better accuracy and sensitivity efficiency among various groups. The proposed algorithm is tested by contrasting outcomes with standard learning schemes such as PSO-ELM, GA-ELM, ABC-ELM, Birdswarm-ELM, and JAYA-ELM, suggesting the dominance of GMJAYA-ELM.

The texture is an essential property of an image that tells about the arrangements of pixels of different intensities in an image matrix. Researchers have used many descriptors for texture classification of the images in computer vision and image processing. Local Binary Pattern (LBP) is one of the descriptors, which is computationally efficient and straightforward for texture classification. In recent years, researchers have made many enhancements to the basic LBP method to improve the quality of extracted features for an image. This paper presents a Local Roughness Binary Pattern (LRBP) descriptor for feature extraction of an image to increase LBP discriminative capability. This new descriptor extracts features from the local region of an image called a partial feature vector and concatenates these local features to obtain a feature vector of an image. This feature vector is used as input to a classifier to classify the class of an image. We tested the proposed descriptor for the images available on CUReT and KTHTIPS2b databases with Support Vector Machine (SVM) and k-nearest Neighbors (KNN) classifiers. We have presented the experimental results obtained from the analysis process regarding classification accuracy and confusion matrix. Finally, we have presented a performance comparison between the proposed method, basic LBP descriptor, and its variants. Results show that the proposed descriptor gives much better results than other descriptors on the KTHTIPS2b Database when we use the KNN classifier.KeywordsLBPLocal binary patternLRBPLocal roughness binary patternSVMSupport vector machineKNN K-nearest neighbors

Texture is the surface property that is used to identify and recognise objects. This property is widely used in many applications including texture-based face recognition systems, surveillance, identity verification and so on. The Local binary pattern (LBP) texture method is most successful for face recognition. Owing to the great success of LBP, recently many models, which are variants of LBP have been proposed for texture analysis. Some of the derivatives of LBPs are multivariate local binary pattern, centre symmetric local binary pattern, local binary pattern variance, dominant local binary pattern, advanced local binary pattern, local texture pattern (LTP) and local derivative pattern (LDP). In this scenario, it is essential to review, whether LBP or their derivatives perform better for face recognition. The real-time challenges such as illumination changes, rotations, angle variations and facial expression variations are evaluated by different LBP-based models. Experiments were conducted on the Japanese female facial expression, YALE and FRGC version2 databases. The results show that LDP and LTP perform much better than the other LBP-based models.

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.

This study focuses on a comprehensive study of Automatic Signature Verification (ASV) for off-line Thai signatures; an investigation was carried out to characterise the challenges in Thai ASV and to baseline the performance of Thai ASV employing baseline features, being Local Binary Pattern, Local Directional Pattern, Local Binary and Directional Patterns combined (LBDP), and the baseline shape/feature-based hidden Markov model. As there was no publicly available Thai signature database found in the literature, the authors have developed and proposed a database considering real-world signatures from Thailand. The authors have also identified their latent challenges and characterised Thai signature-based ASV. The database consists of 5,400 signatures from 100 signers. Thai signatures could be bi-script in nature, considering the fact that a single signature can contain only Thai or Roman characters or contain both Roman and Thai, which poses an interesting challenge for script-independent SV. Therefore, along with the baseline experiments, the investigation on the influence and nature of bi-script ASV was also conducted. From the equal error rates and Bhattacharyya distance, the score achieved in the experiments indicate that the Thai SV scenario is a script-independent problem. The open research area on this subject of research has also been addressed.