A Completed Multiply Threshold Encoding Pattern for Texture Classification

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.

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.

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.

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.

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.

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

Recently, the local binary patterns (LBP) have been widely used in the texture classification. The LBP methods obtain the binary pattern by comparing the gray scales of pixels on a small circular region with the gray scale of their central pixel. The conventional LBP methods only describe microstructures of texture images, such as edges, corners, spots and so on, although many of them show good performances on the texture classification. This situation still could not be changed, even though the multi-resolution analysis technique is adopted by LBP methods. Moreover, the circular sampling region limits the ability of the conventional LBP methods in describing anisotropic features. In this paper, we change the shape of sampling region and get an extended LBP operator. And a multi-structure local binary pattern (Ms-LBP) operator is achieved by executing the extended LBP operator on different layers of an image pyramid. Thus, the proposed method is simple yet efficient to describe four types of structures: isotropic microstructure, isotropic macrostructure, anisotropic microstructure and anisotropic macrostructure. We demonstrate the performance of our method on two public texture databases: the Outex and the CUReT. The experimental results show the advantages of the proposed method.

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

Palmprint is a reliable and unique biometric trait with high acceptability. In this paper, we propose a new Local Composition Derivative Pattern (LCDP) for palmprint recognition. LCDP extracts first order derivative information of images along radial and directional directions which can capture more detailed information than the non-directional local binary pattern (LBP). Different from LBP encoding just the binary result of the radial derivative among central pixel and local neighbors by using a simple threshold function with static threshold value, the LCDP extracts discriminative local information by composition of both radial and directional derivatives information by using a threshold function with dynamic threshold value which obtains by first-order derivative information among local neighbors. Experimental evaluation through palmprint recognition on the Hong Kong Polytechnic University 2D_3D_palmprint database demonstrates the LCDP performs much better than LBP for palmprint identification.

A number of algorithms have been developed in the past for texture analysis and classification using the wavelet transform. In this paper we explore the effect of different wavelet bases on the classification performance. We use the algorithm developed by T. Chang and C.-C. Jay Kuo (see IEEE Trans. Image Process., vol.2, no.4, p.429-41, Oct. 1993) for texture analysis and classification with a tree-structured wavelet transform. The performance of the wavelet bases is measured in terms of the sensitivity and the selectivity for the classification of natural textures. The classification results show that the choice of wavelet basis has a considerable effect on the classification performance.

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.

Local binary pattern (LBP) is an important image texture feature extraction method. This paper proposes a combination of adaptive threshold and directional local image feature representation, and to realize the image retrieval. This local combination feature is composed of two parts: 1)The standard deviation of the gray value of all pixels in the local neighborhood of the image and the gray value of the center pixel are used as the comparison threshold for encoding. This threshold is adaptively changed following the grayscale changes in the neighborhood, and can indicate the severity of the gray scale change; 2)directional local pattern: by comparing the grayscale changes of local neighborhood pixels in different directions, discrimination and binary encoding are performed to indicate the local texture features directionality. Finally, the two features are combined to form the local features of the image, and the features are used for image retrieval. Experiments on the Corel-1k database show that this method has a better image retrieval effect than existing local feature representation methods.

Dense micro-block difference (DMD) has achieved good performance in gray texture representation and classification. However, its performance is not satisfactory when representing color texture. To alleviate this problem, we propose a novel color texture representation method based on Completed Extremely Nonnegative DMD (CEN-DMD) in this paper. In particular, we first use DMD to model interchannel features and interchannel features of color texture images. Considering that negative value is meaningless in a digital image, we perform a nonnegative operation during the difference process. Due to that the maximum value in a nonnegative difference patch represents a significant difference, we construct the Extremely Nonnegative DMD (EN-DMD) by fusing the maximum values of the intrachannel features and the maximum of interchannel features, and further build Completed Extremely Nonnegative DMD (CEN-DMD) by fusing EN-DMDs at five scales and the global feature of the color texture images. Finally, the Fisher Vector is used to encode the CEN-DMD to obtain a color texture descriptor. Experimental results on five published standard color texture datasets (CUReT, Colored Brodatz, VisTex, USPTex and KTH-TIPS) reveal that CEN-DMD is effective when compared to the thirteen representative color texture classification methods.

The main focus of this paper is to improve the performance of the texture model Optimized Local Ternary Patterns (OLTP), which is known as one of the successful variants of the texture model Local Binary Patterns (LBP), a well known method for texture analysis and its applications. Generally preprocessing is used in digital image processing for reducing the unwanted noise and disturbances in such a way that it improves the quality of the image. Preprocessing not only removes the distortions but also enhances the features of the image for further processing. To achieve better recognition accuracy, the texture model OLTP was combined with a preprocessing method that uses nonlinear diffusion method as a preprocessing tool in this paper, with the hope that this idea will surely improve the local feature description and texture classification process. This nonlinear diffusion method uses two newly developed edge stopping functions for preprocessing. This proposed method is tested with two standard texture datasets namely Brodatz Dataset and Usptex dataset. The results show that the use of the preprocessing step really improved the texture classification accuracy.

In the paper, we investigate the effectiveness of modified many-factor (bilateral, tri-, and four-lateral) denoising MIMO-filters for gray, color, and hyperspectral image procession. Conventional bilateral filter performs merely weighted averaging of the local neighborhood pixels. The weight includes two components: spatial and radiometric ones. The first component measures the geometric distances between the center pixel and local neighborhood ones. The second component measures the radiometric distance between the values of the center pixel and local neighborhood ones. Noise affects all pixels even the center one which is used as a reference for the tonal filtering. Thus, the noise affecting the center pixel has a disproportionate effect onto the result. This suggests the first modification: the center pixel is replaced by the weighted average (with some estimate of the true value) of the neighborhood pixels contained in a window around it. The second modification uses the matrix-valued weights. They include four components: spatial, radiometric, interchannel weights, and radiometric interchannel ones. The fourth weight measures the radiometric distance (for gray-level images) between the interchannel values of the center scalar-valued channel pixel and local neighborhood channel ones.